Scribd
Upload
418 views3 pages

Logic Cheat Sheet

This document provides definitions and logical equivalences for logic statements. It defines key logic terms like valid arguments, statements, negation, conjunction, disjunction, conditionals and their converses and contrapositives. Logical equivalences covered include DeMorgan's laws, conditional laws, biconditional laws, tautology laws and contradiction laws. The cheat sheet is intended to define common logic terms and equivalences for a logic class.

Uploaded by

hinton geoffery
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
418 views3 pages

Logic Cheat Sheet

This document provides definitions and logical equivalences for logic statements. It defines key logic terms like valid arguments, statements, negation, conjunction, disjunction, conditionals and their converses and contrapositives. Logical equivalences covered include DeMorgan's laws, conditional laws, biconditional laws, tautology laws and contradiction laws. The cheat sheet is intended to define common logic terms and equivalences for a logic class.

Uploaded by

hinton geoffery
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Logic Cheat Sheet

Prof. Woon
PS 2703
August 27, 2007

Definitions
Valid argument Reasoning in which a conclusion follows necessarily from
the premises presented, so that the conclusion cannot be false if the
premises are true.

Statements Either true or false, but not both. Represented by letters.


Not (negation)

¬P

means “it is not the case that P”


And (conjunction)

P ∧Q

means “both P and Q”


Or (disjunction)

P ∨Q

means “either P or Q (or both)”


Conditional connective

P ⇒Q

means

• “P implies Q”
• “if P then Q,”
• “P is sufficient for Q”

1
• “Q is necessary for P”
Converse

Q ⇒ P is the converse of P ⇒ Q

IMPORTANT! A conditional statement is NOT the same as its con-


verse.
Contrapositive

¬Q ⇒ ¬P is the contrapositive of P ⇒ Q

A conditional statement IS EQUIVALENT to its contrapositive.


Biconditional connective

P ⇔Q

means “P is necessary and sufficient for Q” or “P if and only if Q”


(abbreviated iff)

Tautology A statement that is always true.

Contradiction A statement that is always false.

Logical equivalences
Double negation law

¬¬P ≡ P

Commutative laws

P ∧Q≡Q∧P

P ∨Q≡Q∨P
Associative laws

P ∧ (Q ∧ R) ≡ (P ∧ Q) ∧ R

P ∨ (Q ∨ R) ≡ (P ∨ Q) ∨ R

2
Idempotent laws
P ∧P ≡P
P ∨P ≡P
Distributive laws
P ∧ (Q ∨ R) ≡ (P ∧ Q) ∨ (P ∧ R)
P ∨ (Q ∧ R) ≡ (P ∨ Q) ∧ (P ∨ R)
DeMorgan’s laws
¬(P ∧ Q) ≡ ¬P ∨ ¬Q
¬(P ∨ Q) ≡ ¬P ∧ ¬Q
Conditional laws
P ⇒ Q ≡ ¬P ∨ Q
P ⇒ Q ≡ ¬(P ∧ ¬Q)
Biconditional law
P ⇔ Q ≡ (P ⇒ Q) ∧ (Q ⇒ P )
Contrapositive law
P ⇒ Q ≡ ¬Q ⇒ ¬P
Tautology laws
P ∧ (a tautalogy) ≡ P
P ∨ (a tautology) is a tautology
¬(a tautology) is a contradiction
Contradiction laws
P ∧ (a contradiction) is a contradiction
P ∨ (a contradiction) ≡ P
¬(a contradiction) is a tautology
Quantifier negation laws
¬∃x s.t. P ≡ ∀x, ¬P
¬∀x, P ≡ ∃x s.t. P

You might also like