Retarded time - Revision history

en>Flyer22: Reverted 1 edit by 72.37.249.36 identified as test/vandalism using STiki

2014-06-11T17:41:40Z

Reverted 1 edit by 72.37.249.36 identified as test/vandalism using STiki

← Older revision		Revision as of 19:41, 11 June 2014
Line 1:		Line 1:
	~~{{otheruses4\|~~the ~~extension of Euler diagrams\|diagrams showing relationships among concepts\|concept map\|and\|mind map}}~~		Golda is what's written on my beginning certificate even though it is not the name on my birth certification. The preferred pastime for him and his children is to perform lacross and he would by no means give it up. Office supervising is exactly where her main earnings arrives from. Ohio is exactly where her house is.<br><br>my weblog; love psychic; [http://Checkmates.co.za/index.php?do=/profile-56347/info/ Checkmates.co.za],

	~~In mathematics, a '''unitary spider diagram''' adds existential points to an [[Euler diagram\|Euler]] or a [[Venn diagram]]~~. The points indicate the existence of an attribute described by the intersection of contours in the Euler diagram. These points may be joined together forming a shape like a [[spider]]. Joined points represent an "or" condition, also known as a [[logical disjunction]].

	~~A '''spider diagram'''~~ is ~~a boolean expression involving unitary spider diagrams~~ and ~~the logical symbols <math>\land,\lor,\lnot</math>. For example,~~ it ~~may consist of the conjunction of two spider diagrams, the disjunction of two spider diagrams, or the negation of a spider diagram~~.

	~~== Example ==~~
	~~[[Image:SpiderEuler.jpg\|thumb\|275px\|Logical disjunction superimposed on Euler diagram]]~~
	~~In the image shown, the following conjunctions are apparent~~ from ~~the Euler diagram~~.
	~~: <math>A \land B</math>~~
	~~: <math>B \land C</math>~~
	~~: <math>F \land E</math>~~
	~~: <math>G \land F</math>~~

	In the [[universe of discourse]] defined by this [[Euler diagram]], in addition to the conjunctions specified above, all possible sets from ''A'' through ''B'' and ''D'' through ''G'' are available separately. The set ''C'' is ~~only available as a subset of ''B''. Often, in complicated diagrams, [[singleton set]]s and/or conjunctions may be obscured by other set combinations~~.

	~~The two spiders in the example correspond to the following logical expressions:~~
	* Red spider: <~~math~~>~~(F \land E) \lor (G) \lor (D)~~<~~/math~~>
	*Blue spider: <math>(A) \lor (C \land B) \lor (F)</math>

	~~==References==~~
	* Howse, J. and Stapleton, G. and Taylor, H. ''Spider Diagrams'' [[London Mathematical Society]] Journal of Computation and Mathematics, (2005) v. 8, pp. ~~145–194. ISSN 1461-1570 Accessed on January 8, 2012~~ [http://~~eprints~~.~~brighton~~.~~ac.uk~~/~~8159/ here]~~
	* Stapleton, G. ~~and Howse, J. and Taylor, J. and Thompson, S. ''What can spider diagrams say~~?~~'' Proc. Diagrams, (2004) v. 168, pgs 169~~-~~219 Accessed on January 4, 2012 [http:~~//~~eprints.brighton~~.ac.~~uk/2864/1/D2K4SHTT.pdf here~~]
	* Stapleton, ~~G. and Jamnik, M. and Masthoff, J. ''On the Readability of Diagrammatic Proofs'' Proc. Automated Reasoning Workshop, 2009. [http://www.csc.liv.ac.uk/research/techreports/tr2009/ulcs-09-007.pdf PDF]~~
	~~==External links==~~
	~~{{commons category\|Spider diagrams}}~~
	* [http://www.cs.kent.ac.uk/events/conf/2004/euler/eulerdiagrams.html Brighton and Kent University - Euler Diagrams]

	~~[[Category:Diagrams]]~~
	~~[[Category:Diagram algebras]]~~

en>Auric: fix isbns

2013-08-16T12:38:24Z

fix isbns

← Older revision		Revision as of 14:38, 16 August 2013
Line 1:		Line 1:
	~~Hello~~, ~~my name~~ is ~~Andrew~~ and ~~my spouse doesn't like~~ it ~~at all~~. ~~To climb is some thing I truly appreciate performing~~. ~~Alaska is where I~~'~~ve usually been living~~. He is ~~an purchase clerk and it~~'s ~~something he truly appreciate~~.<br><br>~~my weblog~~: ~~online psychic reading~~ ([http://www.~~seekavideo~~.~~com~~/~~playlist~~/~~2199~~/~~video~~/ ~~Full File~~])		{{otheruses4\|the extension of Euler diagrams\|diagrams showing relationships among concepts\|concept map\|and\|mind map}}

			In mathematics, a '''unitary spider diagram''' adds existential points to an [[Euler diagram\|Euler]] or a [[Venn diagram]]. The points indicate the existence of an attribute described by the intersection of contours in the Euler diagram. These points may be joined together forming a shape like a [[spider]]. Joined points represent an "or" condition, also known as a [[logical disjunction]].

			A '''spider diagram''' is a boolean expression involving unitary spider diagrams and the logical symbols <math>\land,\lor,\lnot</math>. For example, it may consist of the conjunction of two spider diagrams, the disjunction of two spider diagrams, or the negation of a spider diagram.

			== Example ==
			[[Image:SpiderEuler.jpg\|thumb\|275px\|Logical disjunction superimposed on Euler diagram]]
			In the image shown, the following conjunctions are apparent from the Euler diagram.
			: <math>A \land B</math>
			: <math>B \land C</math>
			: <math>F \land E</math>
			: <math>G \land F</math>

			In the [[universe of discourse]] defined by this [[Euler diagram]], in addition to the conjunctions specified above, all possible sets from ''A'' through ''B'' and ''D'' through ''G'' are available separately. The set ''C'' is only available as a subset of ''B''. Often, in complicated diagrams, [[singleton set]]s and/or conjunctions may be obscured by other set combinations.

			The two spiders in the example correspond to the following logical expressions:
			* Red spider: <math>(F \land E) \lor (G) \lor (D)</math>
			*Blue spider: <math>(A) \lor (C \land B) \lor (F)</math>

			==References==
			* Howse, J. and Stapleton, G. and Taylor, H. ''Spider Diagrams'' [[London Mathematical Society]] Journal of Computation and Mathematics, (2005) v. 8, pp. 145–194. ISSN 1461-1570 Accessed on January 8, 2012 [http://eprints.brighton.ac.uk/8159/ here]
			* Stapleton, G. and Howse, J. and Taylor, J. and Thompson, S. ''What can spider diagrams say?'' Proc. Diagrams, (2004) v. 168, pgs 169-219 Accessed on January 4, 2012 [http://eprints.brighton.ac.uk/2864/1/D2K4SHTT.pdf here]
			* Stapleton, G. and Jamnik, M. and Masthoff, J. ''On the Readability of Diagrammatic Proofs'' Proc. Automated Reasoning Workshop, 2009. [http://www.csc.liv.ac.uk/research/techreports/tr2009/ulcs-09-007.pdf PDF]
			==External links==
			{{commons category\|Spider diagrams}}
			* [http://www.cs.kent.ac.uk/events/conf/2004/euler/eulerdiagrams.html Brighton and Kent University - Euler Diagrams]

			[[Category:Diagrams]]
			[[Category:Diagram algebras]]

en>NOrbeck: See also Light-time correction

2012-07-31T02:06:15Z