Difference between revisions of "Logical equivalence"

From formulasearchengine
Jump to navigation Jump to search
en>CBM
(Add reference, plant flag for Harvard style citations)
 
en>Arthur Rubin
(no, that's absolutely correct. Removing incorrect comment)
Line 1: Line 1:
 
In [[logic]], statements <var>p</var> and <var>q</var> are '''logically equivalent''' if they have the same logical content. This is a [[semantic]] concept; two statements are equivalent if they have the same [[truth value]] in every [[model (logic)|model]] (Mendelson 1979:56). The logical equivalence of <var>p</var> and <var>q</var> is sometimes expressed as <math>p \equiv q</math>, E''pq'', or <math>p \Leftrightarrow q</math>.
 
In [[logic]], statements <var>p</var> and <var>q</var> are '''logically equivalent''' if they have the same logical content. This is a [[semantic]] concept; two statements are equivalent if they have the same [[truth value]] in every [[model (logic)|model]] (Mendelson 1979:56). The logical equivalence of <var>p</var> and <var>q</var> is sometimes expressed as <math>p \equiv q</math>, E''pq'', or <math>p \Leftrightarrow q</math>.
 
However, these symbols are also used for [[material equivalence]]; the proper interpretation depends on the context. Logical equivalence is different from material equivalence, although the two concepts are closely related.
 
However, these symbols are also used for [[material equivalence]]; the proper interpretation depends on the context. Logical equivalence is different from material equivalence, although the two concepts are closely related.
 +
==Logical equivalences==
 +
{| class="wikitable"
 +
|-
 +
! ''Equivalence'' !! ''Name''
 +
|-
 +
| p∧'''T'''≡p<br />p∨'''F'''≡p || Identity laws
 +
|-
 +
| p∨'''T'''≡'''T'''<br />p∧'''F'''≡'''F''' || Domination laws
 +
|-
 +
| p∨p≡p<br />p∧p≡p || Idempotent laws
 +
|-
 +
| ﹁(﹁p)≡p || Double negation laws
 +
|-
 +
| p∨q≡q∨p<br />p∧q≡q∧p || Commutative laws
 +
|-
 +
| (p∨q)∨r≡p∨(q∨r)<br />(p∧q)∧r≡p∧(q∧r)  || Assocative laws
 +
|-
 +
| p∨(q∧r)≡(p∨q)∧(p∨r)<br />p∧(q∨r)≡(p∧q)∨(p∧r) || Distributive laws
 +
|-
 +
| ﹁(p∧q)≡﹁p∨﹁q<br />﹁(p∨q)≡﹁p∧﹁q || De Morgan's laws
 +
|-
 +
| p∨(p∧q)≡p<br />p∧(p∨q)≡p || Absorption laws
 +
|-
 +
| p∨﹁p≡'''T'''<br />p∧﹁p≡'''F''' || Negation laws
 +
|}
 +
 +
Logical equivalences involving conditional statements:<br />
 +
:#p→q≡﹁p∨q<br />
 +
:#p→q≡﹁q→﹁p<br />
 +
:#p∨q≡﹁p→q<br />
 +
:#p∧q≡﹁(p→﹁q)<br />
 +
:#﹁(p→q)≡p∧﹁q<br />
 +
:#(p→q)∧(p→r)≡p→(q∧r)<br />
 +
:#(p→q)∨(p→r)≡p→(q∨r)<br />
 +
:#(p→r)∧(q→r)≡(p∧q)→r<br />
 +
:#(p→r)∨(q→r)≡(p∨q)→r<br />
 +
<br /><br />
 +
Logical equivalences involving biconditionals:<br />
 +
:#p↔q≡(p→q)∧(q→p)<br />
 +
:#p↔q≡﹁p↔﹁q<br />
 +
:#p↔q≡(p∧q)∨(﹁p∧﹁q)<br />
 +
:#﹁(p↔q)≡p↔﹁q<br />
  
 
==Example==
 
==Example==
Line 14: Line 56:
 
==Relation to material equivalence==
 
==Relation to material equivalence==
  
Logical equivalence is different from [[material equivalence]]. The material equivalence of ''p'' and ''q'' (often written ''p''↔''q'') is itself another statement, call it ''r'', in same [[formal system|object language]] as ''p'' and ''q''. ''r'' expresses the idea "''p'' if and only if ''q''". In particular, the truth value of ''p''↔''q'' can change from one model to another.
+
Logical equivalence is different from [[material equivalence]]. The material equivalence of ''p'' and ''q'' (often written ''p''↔''q'') is itself another statement, call it ''r'', in the same [[formal system|object language]] as ''p'' and ''q''. ''r'' expresses the idea "''p'' if and only if ''q''". In particular, the truth value of ''p''↔''q'' can change from one model to another.
  
 
The claim that two formulas are logically equivalent is a statement in the [[metalanguage]], expressing a relationship between two statements ''p'' and ''q''. The claim that ''p'' and ''q'' are semantically equivalent does not depend on any particular model; it says that in every possible model, ''p'' will have the same truth value as ''q''.  The claim that ''p'' and ''q'' are syntactically equivalent does not depend on models at all; it states that there is a deduction of ''q'' from ''p'' and a deduction of ''p'' from ''q''.
 
The claim that two formulas are logically equivalent is a statement in the [[metalanguage]], expressing a relationship between two statements ''p'' and ''q''. The claim that ''p'' and ''q'' are semantically equivalent does not depend on any particular model; it says that in every possible model, ''p'' will have the same truth value as ''q''.  The claim that ''p'' and ''q'' are syntactically equivalent does not depend on models at all; it states that there is a deduction of ''q'' from ''p'' and a deduction of ''p'' from ''q''.
Line 22: Line 64:
 
==See also==
 
==See also==
 
{{Portal|Thinking}}
 
{{Portal|Thinking}}
 +
* [[Entailment]]
 
* [[Equisatisfiability]]
 
* [[Equisatisfiability]]
 
* [[If and only if]]
 
* [[If and only if]]
Line 32: Line 75:
  
 
{{DEFAULTSORT:Logical Equivalence}}
 
{{DEFAULTSORT:Logical Equivalence}}
[[Category:Logic]]
+
[[Category:Mathematical logic]]
 
+
[[Category:Metalogic]]
[[cs:Ekvivalence (logika)]]
+
[[Category:Logical consequence]]
[[de:Logische Äquivalenz]]
 
[[es:Equivalencia lógica]]
 
[[fr:Équivalence logique]]
 
[[mk:Логичка еквиваленција]]
 
[[nl:Logische equivalentie]]
 
[[pt:Equivalência lógica]]
 
[[sk:Ekvivalencia (logika)]]
 
[[zh:逻辑等价]]
 

Revision as of 09:10, 28 January 2014

In logic, statements p and q are logically equivalent if they have the same logical content. This is a semantic concept; two statements are equivalent if they have the same truth value in every model (Mendelson 1979:56). The logical equivalence of p and q is sometimes expressed as , Epq, or . However, these symbols are also used for material equivalence; the proper interpretation depends on the context. Logical equivalence is different from material equivalence, although the two concepts are closely related.

Logical equivalences

Equivalence Name
p∧T≡p
p∨F≡p
Identity laws
p∨TT
p∧FF
Domination laws
p∨p≡p
p∧p≡p
Idempotent laws
﹁(﹁p)≡p Double negation laws
p∨q≡q∨p
p∧q≡q∧p
Commutative laws
(p∨q)∨r≡p∨(q∨r)
(p∧q)∧r≡p∧(q∧r)
Assocative laws
p∨(q∧r)≡(p∨q)∧(p∨r)
p∧(q∨r)≡(p∧q)∨(p∧r)
Distributive laws
﹁(p∧q)≡﹁p∨﹁q
﹁(p∨q)≡﹁p∧﹁q
De Morgan's laws
p∨(p∧q)≡p
p∧(p∨q)≡p
Absorption laws
p∨﹁p≡T
p∧﹁p≡F
Negation laws

Logical equivalences involving conditional statements:

  1. p→q≡﹁p∨q
  2. p→q≡﹁q→﹁p
  3. p∨q≡﹁p→q
  4. p∧q≡﹁(p→﹁q)
  5. ﹁(p→q)≡p∧﹁q
  6. (p→q)∧(p→r)≡p→(q∧r)
  7. (p→q)∨(p→r)≡p→(q∨r)
  8. (p→r)∧(q→r)≡(p∧q)→r
  9. (p→r)∨(q→r)≡(p∨q)→r



Logical equivalences involving biconditionals:

  1. p↔q≡(p→q)∧(q→p)
  2. p↔q≡﹁p↔﹁q
  3. p↔q≡(p∧q)∨(﹁p∧﹁q)
  4. ﹁(p↔q)≡p↔﹁q

Example

The following statements are logically equivalent:

  1. If Lisa is in France, then she is in Europe. (In symbols, .)
  2. If Lisa is not in Europe, then she is not in France. (In symbols, .)

Syntactically, (1) and (2) are derivable from each other via the rules of contraposition and double negation. Semantically, (1) and (2) are true in exactly the same models (interpretations, valuations); namely, those in which either Lisa is in France is false or Lisa is in Europe is true.

(Note that in this example classical logic is assumed. Some non-classical logics do not deem (1) and (2) logically equivalent.)

Relation to material equivalence

Logical equivalence is different from material equivalence. The material equivalence of p and q (often written pq) is itself another statement, call it r, in the same object language as p and q. r expresses the idea "p if and only if q". In particular, the truth value of pq can change from one model to another.

The claim that two formulas are logically equivalent is a statement in the metalanguage, expressing a relationship between two statements p and q. The claim that p and q are semantically equivalent does not depend on any particular model; it says that in every possible model, p will have the same truth value as q. The claim that p and q are syntactically equivalent does not depend on models at all; it states that there is a deduction of q from p and a deduction of p from q.

There is a close relationship between material equivalence and logical equivalence. Formulas p and q are syntactically equivalent if and only if pq is a theorem, while p and q are semantically equivalent if and only if pq is true in every model (that is, pq is logically valid).

See also

{{#invoke:Portal|portal}}

References

  • Elliot Mendelson, Introduction to Mathematical Logic, second edition, 1979.