James Anderson (computer scientist): Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Barraki
rv joke
 
en>28bytes
m rvv
Line 1: Line 1:
Hi there, I am Andrew Berryhill. Mississippi is where his home is. Distributing manufacturing has been his occupation for some time. What I adore doing is soccer but I don't have the time recently.<br><br>Here is my blog post ... online psychics ([http://ustanford.com/index.php?do=/profile-38218/info/ Read the Full Report])
<!-- This is the truth table shown on the right. Scroll down to edit the rest of the article. !-->
{| class="wikitable" align=right
|- bgcolor="#ddeeff" align="center"
|colspan=3|'''Variable inputs'''
|colspan=2| '''Function values'''
|- bgcolor="#ddeeff" align="center"
| ''x'' || ''y'' || ''z'' || <math>xy \vee \bar{x}z \vee yz</math> || <math>xy \vee \bar{x}z</math>
|- bgcolor="#ddffdd" align="center"
| 0 || 0 || 0 || 0 || 0
|- bgcolor="#ddffdd" align="center"
| 0 || 0 || 1 || 1 || 1
|- bgcolor="#ddffdd" align="center"
| 0 || 1 || 0 || 0 || 0
|- bgcolor="#ddffdd" align="center"
| 0 || 1 || 1 || 1 || 1
|- bgcolor="#ddffdd" align="center"
| 1 || 0 || 0 || 0 || 0
|- bgcolor="#ddffdd" align="center"
| 1 || 0 || 1 || 0 || 0
|- bgcolor="#ddffdd" align="center"
| 1 || 1 || 0 || 1 || 1
|- bgcolor="#ddffdd" align="center"
| 1 || 1 || 1 || 1 || 1
|}
 
In [[Boolean algebra (logic)|Boolean algebra]], the '''consensus theorem''' or '''rule of consensus'''<ref>Frank Markham Brown, ''Boolean Reasoning: The Logic of Boolean Equations'', 2nd edition 2003, p. 44</ref> is the identity:
 
:<math>xy \vee \bar{x}z \vee yz = xy \vee \bar{x}z</math>
 
The '''consensus''' or '''resolvent''' of the terms <math>xy</math> and <math>\bar{x}z</math> is <math>yz</math>. It is the conjunction of all the unique literals of the terms, excluding the literal which appears unnegated in one term and negated in the other.
 
The conjunctive [[De Morgan's laws|dual]] of this equation is:
 
:<math>(x \vee y)(\bar{x} \vee z)(y \vee z) = (x \vee y)(\bar{x} \vee z)</math>
==Proof==
 
    [[Sides of an equation|LHS]] = <math>xy \vee \bar{x}z \vee (x \vee \bar{x})yz</math>
        = <math>xy \vee \bar{x}z \vee xyz \vee \bar{x}yz</math>
        = <math>xy \vee xyz \vee \bar{x}z \vee \bar{x}yz</math>
        = <math>xy(1 \vee z) \vee \bar{x}z(1 \vee y)</math>
        = <math>xy \vee \bar{x}z</math>
        = RHS
 
==Consensus==
{{anchor|Consensus}}{{anchor|Opposition}}
The '''consensus''' or '''consensus term''' of two conjunctive terms of a disjunction is defined when one term contains the literal <math>a</math> and the other the literal <math>\bar{a}</math>, an '''opposition'''. The consensus is the conjunction of the two terms, omitting both <math>a</math> and <math>\bar{a}</math>, and repeated literals; the consensus is undefined if there is more than one opposition. For example, the consensus of <math>\bar{x}yz</math> and <math>w\bar{y}z</math> is <math>w\bar{x}z</math>.<ref>Frank Markham Brown, ''Boolean Reasoning: The Logic of Boolean Equations'', 2nd edition 2003, p. 81</ref>
 
The consensus can be derived from <math>(x\vee y)</math> and <math>(\bar{x} \vee z)</math> through the [[resolution (logic)|resolution]] [[inference rule]].  This shows that the LHS is derivable from the RHS (if ''A'' &rarr; ''B'' then ''A'' &rarr; ''AB''; replacing ''A'' with RHS and ''B'' with (''y'' ∨ ''z'') ).  The RHS can be derived from the LHS simply through the [[conjunction elimination]] inference rule.  Since RHS &rarr; LHS and LHS &rarr; RHS (in [[propositional calculus]]), then LHS = RHS (in Boolean algebra).
 
==Digital logic circuitry==
 
In [[digital logic]], including the consensus term in a circuit can eliminate [[race hazard]]s.
 
==History==
 
The concept of consensus was introduced by Archie Blake in 1937.<ref name="blake">"Canonical expressions in Boolean algebra", Dissertation, Dept. of Mathematics, U. of Chicago, 1937, reviewed in J. C. C. McKinsey, ''The Journal of Symbolic Logic'' '''3''':2:93 (June 1938) {{DOI|10.2307/2267634}} {{jstor|2267634}}</ref> It was rediscovered by Samson and Mills in 1954<ref>Edward W. Samson, Burton E. Mills, Air Force Cambridge Research Center Technical Report 54-21, April 1954</ref> and by [[Willard van Orman Quine|Quine]] in 1955.<ref>W.V. Quine, "The problem of simplifying truth functions", ''American Mathematical Monthly'' '''59''':521-531, 1952</ref> Quine coined the term 'consensus'. Robinson used it for clauses in 1965 as the basis of his "[[resolution (logic)|resolution principle]]".<ref>J. Alan Robinson, "A Machine-Oriented Logic Based on the Resolution Principle", ''Journal of the ACM'' '''12''':1: 23–41.</ref><ref>D.E. Knuth, ''The Art of Computer Programming'' '''4A''': ''Combinatorial Algorithms'', part 1, p. 539</ref>
 
==Notes==
{{Reflist|1}}
 
== References ==
* Roth, Charles H. Jr. and Kinney, Larry L. (2004, 2010). "Fundamentals of Logic Design", 6th Ed., p.&nbsp;66ff.
 
{{DEFAULTSORT:Consensus Theorem}}
[[Category:Boolean algebra]]
[[Category:Theorems in propositional logic]]

Revision as of 00:36, 24 January 2014

Variable inputs Function values
x y z
0 0 0 0 0
0 0 1 1 1
0 1 0 0 0
0 1 1 1 1
1 0 0 0 0
1 0 1 0 0
1 1 0 1 1
1 1 1 1 1

In Boolean algebra, the consensus theorem or rule of consensus[1] is the identity:

The consensus or resolvent of the terms and is . It is the conjunction of all the unique literals of the terms, excluding the literal which appears unnegated in one term and negated in the other.

The conjunctive dual of this equation is:

Proof

   LHS = 
       = 
       = 
       = 
       = 
       = RHS

Consensus

<Consensus>...</Consensus><Opposition>...</Opposition> The consensus or consensus term of two conjunctive terms of a disjunction is defined when one term contains the literal and the other the literal , an opposition. The consensus is the conjunction of the two terms, omitting both and , and repeated literals; the consensus is undefined if there is more than one opposition. For example, the consensus of and is .[2]

The consensus can be derived from and through the resolution inference rule. This shows that the LHS is derivable from the RHS (if AB then AAB; replacing A with RHS and B with (yz) ). The RHS can be derived from the LHS simply through the conjunction elimination inference rule. Since RHS → LHS and LHS → RHS (in propositional calculus), then LHS = RHS (in Boolean algebra).

Digital logic circuitry

In digital logic, including the consensus term in a circuit can eliminate race hazards.

History

The concept of consensus was introduced by Archie Blake in 1937.[3] It was rediscovered by Samson and Mills in 1954[4] and by Quine in 1955.[5] Quine coined the term 'consensus'. Robinson used it for clauses in 1965 as the basis of his "resolution principle".[6][7]

Notes

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

References

  • Roth, Charles H. Jr. and Kinney, Larry L. (2004, 2010). "Fundamentals of Logic Design", 6th Ed., p. 66ff.
  1. Frank Markham Brown, Boolean Reasoning: The Logic of Boolean Equations, 2nd edition 2003, p. 44
  2. Frank Markham Brown, Boolean Reasoning: The Logic of Boolean Equations, 2nd edition 2003, p. 81
  3. "Canonical expressions in Boolean algebra", Dissertation, Dept. of Mathematics, U. of Chicago, 1937, reviewed in J. C. C. McKinsey, The Journal of Symbolic Logic 3:2:93 (June 1938) Electronic Instrument Positions Staff (Standard ) Cameron from Clarence Creek, usually spends time with hobbies and interests which include knotting, property developers in singapore apartment For sale and boomerangs. Has enrolled in a world contiki journey. Is extremely thrilled specifically about visiting . Template:Jstor
  4. Edward W. Samson, Burton E. Mills, Air Force Cambridge Research Center Technical Report 54-21, April 1954
  5. W.V. Quine, "The problem of simplifying truth functions", American Mathematical Monthly 59:521-531, 1952
  6. J. Alan Robinson, "A Machine-Oriented Logic Based on the Resolution Principle", Journal of the ACM 12:1: 23–41.
  7. D.E. Knuth, The Art of Computer Programming 4A: Combinatorial Algorithms, part 1, p. 539