Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Logic Cheat Sheet Definitions and Logical equivalences, Cheat Sheet of Logic

Typology: Cheat Sheet

2020/2021

Uploaded on 04/26/2021

nicoline
nicoline 🇺🇸

4.6

(12)

277 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
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)
PQ
means “both P and Q”
Or (disjunction)
PQ
means “either P or Q (or both)”
Conditional connective
PQ
means
“P implies Q”
“if P then Q,”
“P is sufficient for Q”
1
pf3

Partial preview of the text

Download Logic Cheat Sheet Definitions and Logical equivalences and more Cheat Sheet Logic in PDF only on Docsity!

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”
  • “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