Scribd
Upload
45 views3 pages

Formulas Logic

The document lists various logical formulas and rules of replacement, inference, and quantification in propositional and predicate logic. Specifically, it outlines 13 rules of replacement for propositional connectives like conjunction, disjunction, negation, implication and equivalence. It also provides 10 rules of inference like modus ponens, modus tollens, disjunctive syllogism and 4 quantification rules for introducing and generalizing quantifiers. Finally, it includes 4 rules for negating quantified statements.

Uploaded by

Kairu Kun
Copyright
© Attribution Non-Commercial (BY-NC)
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
45 views3 pages

Formulas Logic

The document lists various logical formulas and rules of replacement, inference, and quantification in propositional and predicate logic. Specifically, it outlines 13 rules of replacement for propositional connectives like conjunction, disjunction, negation, implication and equivalence. It also provides 10 rules of inference like modus ponens, modus tollens, disjunctive syllogism and 4 quantification rules for introducing and generalizing quantifiers. Finally, it includes 4 rules for negating quantified statements.

Uploaded by

Kairu Kun
Copyright
© Attribution Non-Commercial (BY-NC)
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

FORMULAS

Rules of Replacement
1. Idempotence P≡(P∨P), P≡(P∧P)
2. Commutativity ( P ∨ Q ) ≡ ( Q ∨ P ), (P∧Q)≡(Q∧P)
3. Associativity, ( P ∨ Q ) ∨ R ≡ P ∨ ( Q ∨ R ), (P∧Q)∧R≡ P∧(Q∧R)
4. De Morgan’s Laws ¬ ( P ∨ Q ) ≡ ¬P ∧ ¬Q, ¬ ( P ∧ Q ) ≡ ¬P ∨ ¬Q
5. Distributivity of ∧ over ∨ P∧(Q∨R)≡(P∧Q)∨(P∧R)
6. Distributivity of ∨ over ∧ P∨(Q∧R)≡ (P∨Q)∧(P∨R)
7. Double Negation ¬ (¬ P) ≡ P
8. Material Implication ( P ⇒ Q ) ≡ (¬ P ∨ Q )
9. Material Equivalence ( P ⇔ Q ) ≡ ( P ⇒ Q ) ∧ ( Q⇒P )
10. Exportation [(P∧Q)⇒R]≡[P⇒(Q⇒R)]
11. Absurdity [ ( P ⇒ Q ) ∧ ( P ⇒ ¬ Q )] ≡ ¬ P
12. Contrapositive ( P ⇒ Q ) ≡ (¬ Q ⇒ ¬P )
13. Identities
P∨1≡1 P∧1≡ P
P∨0≡P P∧0≡ 0
P ∨ ¬P ≡ 1 P ∧ ¬P ≡ 0
¬0 ≡ 1 ¬1 ≡ 0
Worded Forms of Some Propositional Forms
P ∧Q
P and Q P despite Q
P but Q Despite P, Q
P although Q P inspite of Q
Although P, Q P whereas Q
Not only P, but also Q P yet Q
While P, Q P while Q
P∨ Q
P or Q P and/or Q
P or Q or both P unless Q
Either P or Q
P⇒Q
If P then Q Q if P
If P, Q Q provided that P
P only if Q Q incase of P
P implies Q Q follows from P
P⇔Q
P if and only if Q If p and only then Q
If and only if P, Q P just incase Q
If P, and only if Q
Rules of Inference
1.Addition 5. Modus Tolens 8.Constructive Dilemma
P P⇒ Q (P⇒Q)∧(R⇒S)
_____ ¬Q PvR
∴P v Q ______ ______

∴¬P ∴Q v S

2.Conjunctiion . 6. Disjunctive Syllogism 9. Destructive Dilemma


P
Q PvQ (P⇒Q)∧(R⇒S)
______ ¬P ¬Q v ¬S
∴P∧Q ______ ______
∴Q ∴¬P v ¬R

3.Simplification 7. Hypothetical Syllogism


P∧Q P⇒Q
_______ Q⇒R
∴P ______
∴P⇒ R
4.Modus Ponens

P⇒ Q
P
______
∴Q
Quantification Rules
1. Universal Instantiation or Universal Specification
∀x P( x )__
∴P( c ) * c is an arbitrary element of U

2. Existential Instantiation or Existential Specification


∃x P( x )__
∴P( c ) *where c is some element of U

3. Universal Generalization ( UG )
P ( c )____
∴∀x P( x )

4. Existential Generalization ( EG )
P( c )____
∴∃x P( x )

QUANTIFICATION NEGATION Rules


1. ¬∃xA(x) ≡ ∀x ¬( A(x) )

2. ¬∀xA(x) ≡ ∃x ¬( A(x) )

3. ¬∃x ( A(x) ∧ B(x) ) ≡∀x ( A(x) ⇒ ¬B(x) )

4. ¬∀x ( A(x) ⇒ B(x) ) ≡ ∃x ( A(x) ∧ ¬B(x) )

You might also like