Acnode - Revision history

en>Tamfang: /* top */ iffy grammar: "acnodes" was the only available subject of "studying"

2014-09-21T20:39:50Z

top: iffy grammar: "acnodes" was the only available subject of "studying"

← Older revision		Revision as of 22:39, 21 September 2014
Line 1:		Line 1:
	~~{{For\|the corresponding concept in [[combinational logic]]\|XNOR gate}}~~		Hi there, I am Alyson Boon even though it is online psychic reading ([http://srncomm.com/blog/2014/08/25/relieve-that-stress-find-a-new-hobby/ srncomm.com]) psychic phone readings - [http://appin.co.kr/board_Zqtv22/688025 appin.co.kr] - not the title on my beginning certificate. To climb is something I truly enjoy doing. She works as a journey agent but quickly she'll be on her own. For many years he's been residing in Alaska and he doesn't strategy on changing it.<br><br>My homepage; accurate psychic predictions ([http://medialab.zendesk.com/entries/54181460-Will-You-Often-End-Up-Bored-Try-One-Of-These-Hobby-Ideas- find out here])
	~~[[File:XNOR ANSI Labelled.svg\|thumb\|118px\|XNOR Logic Gate Symbol]]~~

	~~'''Logical equality'''~~ is ~~a [[logical operator]] that corresponds to [[equality (mathematics)\|equality]] in [[Boolean algebra (logic)\|Boolean algebra]] and to the [[logical biconditional]] in [[propositional calculus]].~~ ~~It gives the [[function~~ (~~mathematics)\|functional]] value ''~~[~~[Truth\|true]]'' if both functional arguments have the same [[logical value]], and ''[[False (logic)\|false]]'' if they are different~~.

	It is customary practice in various applications, if not always technically precise, to indicate the operation of '''logical equality''' on the logical operands ''x'' and ''y'' by any of the following forms:

	~~<math>\begin{matrix}~~
	~~x \leftrightarrow y & \quad & \quad & x \Leftrightarrow y & \quad & Exy \\~~
	~~x \ \mbox{EQ} \ y & \quad & \quad & x = y~~
	~~\end{matrix}<~~/~~math>~~

	~~Some logicians, however, draw~~ a firm distinction between a ''functional form'', like those in the lefthand column, which they interpret as an application of a function to a pair of arguments — and thus a mere indication that the value of the compound expression depends on the values of the component expressions — and an ''equational form'', like those in the righthand column, which they interpret as an assertion that the arguments have equal values, in other words, that the functional value of the compound expression is ''true''.

	~~In [[mathematics]], the plus sign "+" almost invariably indicates an operation that satisfies the axioms assigned to addition in the type of [[algebraic structure~~]~~] that is known as a ''[[field (mathematics~~)~~\|field]]''.~~ ~~For boolean algebra, this means that the logical operation signified by "+" is not the same as the~~ [[inclusive disjunction]] signified by "∨" but is actually equivalent to the logical inequality operator signified by "≠", or what amounts to the same thing, the [[exclusive disjunction]] signified by "XOR". ~~Naturally, these variations in usage have caused some failures to communicate between mathematicians and switching engineers over the years~~. ~~At any rate, one has the following array of corresponding forms for the symbols associated with logical inequality:~~

	~~: <math>\begin{matrix}~~
	~~x + y & \quad & \quad & x \not\equiv y & \quad & Jxy \\~~
	~~x \ \mbox{XOR} \ y & \quad & \quad & x \ne y~~
	~~\end{matrix}<~~/~~math>~~

	This explains why "EQ" is often called "[[XNOR gate\|XNOR]]" in the [[combinational logic]] of circuit engineers, since it is the ''Negation'' of the ''[[XOR]]'' operation; '''NXOR''' is a less commonly used alternative.~~{{cn\|date=September 2012}} Another rationalization of the admittedly circuitous name "XNOR" is that one begins with the "both false" operator NOR and then adds the eXception, "or both true"~~.

	~~==Definition==~~

	~~'''Logical equality''' is an [[logical operation\|operation]~~] on ~~two [[logical value]]s, typically the values of two [[proposition]]s, that produces a value of ''true'' if and only if both operands are false or both operands are true~~.

	~~The [[truth table]] of '''p EQ q''' (also written as '''p = q''', '''p ↔ q''', or '''p ≡ q''', or '''p == q''')~~ is as ~~follows:~~

	~~{\| align="center" border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:45%"~~
	\|+ '~~''Logical Equality'''~~
	~~\|- style="background:paleturquoise"~~
	~~! style="width:15%" \| p~~
	~~! style="width:15%" \| q~~
	~~! style="width:15%" \| p = q~~
	\|-
	~~\| 0 \|\| 0 \|\| 1~~
	\|-
	~~\| 0 \|\| 1 \|\| 0~~
	\|-
	~~\| 1 \|\| 0 \|\| 0~~
	\|-
	~~\| 1 \|\| 1 \|\| 1~~
	\|}

	~~[[File:Venn1001~~.~~svg\|thumb\|left\|150px\|The [[Venn diagram]] of A EQ B (red part is true)]]~~
	~~{{Clear}}~~

	~~==Alternative descriptions==~~

	~~The form (''x'' = ''y'') is equivalent to the form (''x'' ∧ ''y'') ∨ (¬''x'' ∧ ¬''y'').~~

	~~<math>(x = y) = \lnot(x \oplus y) = \lnot x \oplus y = x \oplus \lnot y = (x \land y) \lor (\lnot x \land \lnot y) = (\lnot x \lor y) \land (x \lor \lnot y)</math>~~

	For ~~the operands ''x'~~' and '~~'y'', the [[truth table]] of the logical equality operator is as follows:~~

	~~{\| class="wikitable"~~
	~~! colspan="2" rowspan="2" \|~~ <~~math~~>~~x \leftrightarrow y~~ <~~/math~~> ~~!! colspan="2" \| y~~
	\|-
	~~! T !! F~~
	\|-
	~~! rowspan="2" \| x !! T~~
	~~\| style="padding: 1em~~;~~" \| T~~
	~~\| style="padding: 1em;" \| F~~
	\|-
	~~! F~~
	~~\| style="padding: 1em;" \| F~~
	~~\| style="padding: 1em;" \| T~~
	\|}

	~~== See also ==~~
	~~{{Portal\|Thinking}}~~
	* [[Boolean function]]
	* [[If and only if]]
	* [[Logical equivalence]]
	* [[Logical biconditional]]
	* [[Propositional calculus]]

	~~==External links==~~
	* Mathworld, [http://~~mathworld~~.~~wolfram~~.com/~~XNOR.html XNOR]~~

	~~{{Logical connectives}}~~

	~~{{DEFAULTSORT:Logical Equality}}~~
	~~[[Category:Logical connectives]]~~
	~~[[Category:Logic gates]~~]

en>Addbot: Bot: Migrating 3 interwiki links, now provided by Wikidata on d:q844451

2013-03-06T20:22:24Z

Bot: Migrating 3 interwiki links, now provided by Wikidata on d:q844451

← Older revision		Revision as of 22:22, 6 March 2013
Line 1:		Line 1:
	~~Hello~~ and ~~welcome~~. ~~My title~~ is ~~Figures Wunder~~. ~~California~~ is ~~our beginning place~~. ~~It's~~ not ~~a common thing~~ but what ~~she likes doing~~ is ~~foundation leaping~~ and ~~now she~~ is ~~trying~~ to ~~earn money with it~~. ~~Bookkeeping~~ is ~~her day occupation now.~~<br><br>~~My webpage~~; [http://~~www~~.~~january-yjm~~.com/~~xe/index~~.~~php?mid=video&document_srl=182582 home std test kit~~]		{{For\|the corresponding concept in [[combinational logic]]\|XNOR gate}}
			[[File:XNOR ANSI Labelled.svg\|thumb\|118px\|XNOR Logic Gate Symbol]]

			'''Logical equality''' is a [[logical operator]] that corresponds to [[equality (mathematics)\|equality]] in [[Boolean algebra (logic)\|Boolean algebra]] and to the [[logical biconditional]] in [[propositional calculus]]. It gives the [[function (mathematics)\|functional]] value ''[[Truth\|true]]'' if both functional arguments have the same [[logical value]], and ''[[False (logic)\|false]]'' if they are different.

			It is customary practice in various applications, if not always technically precise, to indicate the operation of '''logical equality''' on the logical operands ''x'' and ''y'' by any of the following forms:

			<math>\begin{matrix}
			x \leftrightarrow y & \quad & \quad & x \Leftrightarrow y & \quad & Exy \\
			x \ \mbox{EQ} \ y & \quad & \quad & x = y
			\end{matrix}</math>

			Some logicians, however, draw a firm distinction between a ''functional form'', like those in the lefthand column, which they interpret as an application of a function to a pair of arguments — and thus a mere indication that the value of the compound expression depends on the values of the component expressions — and an ''equational form'', like those in the righthand column, which they interpret as an assertion that the arguments have equal values, in other words, that the functional value of the compound expression is ''true''.

			In [[mathematics]], the plus sign "+" almost invariably indicates an operation that satisfies the axioms assigned to addition in the type of [[algebraic structure]] that is known as a ''[[field (mathematics)\|field]]''. For boolean algebra, this means that the logical operation signified by "+" is not the same as the [[inclusive disjunction]] signified by "∨" but is actually equivalent to the logical inequality operator signified by "≠", or what amounts to the same thing, the [[exclusive disjunction]] signified by "XOR". Naturally, these variations in usage have caused some failures to communicate between mathematicians and switching engineers over the years. At any rate, one has the following array of corresponding forms for the symbols associated with logical inequality:

			: <math>\begin{matrix}
			x + y & \quad & \quad & x \not\equiv y & \quad & Jxy \\
			x \ \mbox{XOR} \ y & \quad & \quad & x \ne y
			\end{matrix}</math>

			This explains why "EQ" is often called "[[XNOR gate\|XNOR]]" in the [[combinational logic]] of circuit engineers, since it is the ''Negation'' of the ''[[XOR]]'' operation; '''NXOR''' is a less commonly used alternative.{{cn\|date=September 2012}} Another rationalization of the admittedly circuitous name "XNOR" is that one begins with the "both false" operator NOR and then adds the eXception, "or both true".

			==Definition==

			'''Logical equality''' is an [[logical operation\|operation]] on two [[logical value]]s, typically the values of two [[proposition]]s, that produces a value of ''true'' if and only if both operands are false or both operands are true.

			The [[truth table]] of '''p EQ q''' (also written as '''p = q''', '''p ↔ q''', or '''p ≡ q''', or '''p == q''') is as follows:

			{\| align="center" border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:45%"
			\|+ '''Logical Equality'''
			\|- style="background:paleturquoise"
			! style="width:15%" \| p
			! style="width:15%" \| q
			! style="width:15%" \| p = q
			\|-
			\| 0 \|\| 0 \|\| 1
			\|-
			\| 0 \|\| 1 \|\| 0
			\|-
			\| 1 \|\| 0 \|\| 0
			\|-
			\| 1 \|\| 1 \|\| 1
			\|}

			[[File:Venn1001.svg\|thumb\|left\|150px\|The [[Venn diagram]] of A EQ B (red part is true)]]
			{{Clear}}

			==Alternative descriptions==

			The form (''x'' = ''y'') is equivalent to the form (''x'' ∧ ''y'') ∨ (¬''x'' ∧ ¬''y'').

			<math>(x = y) = \lnot(x \oplus y) = \lnot x \oplus y = x \oplus \lnot y = (x \land y) \lor (\lnot x \land \lnot y) = (\lnot x \lor y) \land (x \lor \lnot y)</math>

			For the operands ''x'' and ''y'', the [[truth table]] of the logical equality operator is as follows:

			{\| class="wikitable"
			! colspan="2" rowspan="2" \| <math>x \leftrightarrow y </math> !! colspan="2" \| y
			\|-
			! T !! F
			\|-
			! rowspan="2" \| x !! T
			\| style="padding: 1em;" \| T
			\| style="padding: 1em;" \| F
			\|-
			! F
			\| style="padding: 1em;" \| F
			\| style="padding: 1em;" \| T
			\|}

			== See also ==
			{{Portal\|Thinking}}
			* [[Boolean function]]
			* [[If and only if]]
			* [[Logical equivalence]]
			* [[Logical biconditional]]
			* [[Propositional calculus]]

			==External links==
			* Mathworld, [http://mathworld.wolfram.com/XNOR.html XNOR]

			{{Logical connectives}}

			{{DEFAULTSORT:Logical Equality}}
			[[Category:Logical connectives]]
			[[Category:Logic gates]]

en>Bender235 at 22:38, 8 June 2012

2012-06-08T22:38:25Z

New page

Hello and welcome. My title is Figures Wunder. California is our beginning place. It's not a common thing but what she likes doing is foundation leaping and now she is trying to earn money with it. Bookkeeping is her day occupation now.<br><br>My webpage; [http://www.january-yjm.com/xe/index.php?mid=video&document_srl=182582 home std test kit]