Professional Documents
Culture Documents
Axiom PDF
Axiom PDF
Rules
Axioms
Axiom 1.1 [Commutativity]
(p ∧ q) = (q ∧ p)
(p ∨ q) = (q ∨ p)
(p = q) = (q = p)
p ∧ (q ∧ r) = (p ∧ q) ∧ r
p ∨ (q ∨ r) = (p ∨ q) ∨ r
p ∨ (q ∧ r) = (p ∨ q) ∧ (p ∨ r)
p ∧ (q ∨ r) = (p ∧ q) ∨ (p ∧ r)
¬(p ∧ q) = ¬p ∨ ¬q
¬(p ∨ q) = ¬p ∧ ¬q
¬¬p = p
p ∨ ¬p = T
1
Axiom 1.7 [Contradiction]
p ∧ ¬p = F
p ⇒ q = ¬p ∨ q
(p = q) = (p ⇒ q) ∧ (q ⇒ p)
p ∨ p = p
p ∨ T = T
p ∨ F = p
p ∨ (p ∧ q) = p
p ∧ p = p
p ∧ T = p
p ∧ F = F
p ∧ (p ∨ q) = p
p = p
2
Inference Rules
p1 = p2 , p2 = p3
Transitivity
p1 = p3
p1 = p2
Substitution
E(p1 ) = E(p2 ) , E(p2 ) = E(p1 )
q1 , q2 , . . . , qn , q1 ∧ q2 ∧ . . . ∧ qn ⇒ (p1 = p2 )
Conditional Substitution
E(p1 ) = E(p2 ) , E(p2 ) = E(p1 )
3
2 Propositional Logic - Derived Theorems
((p = q) = r) = (p = (q = r))
(T = p) = p
F = ¬T
¬(p = q) = (¬p = q)
(¬p = q) = (p = ¬q)
¬F = T
4
Theorem 2.7 [Definition of ¬]
(¬p = p) = F
¬p = (p = F )
Disjunction
p ∨ (q ∨ r) = (p ∨ q) ∨ (p ∨ r)
Conjunction
(p ∧ q) = (p = (q = (p ∨ q)))
(p ∧ q) = ((p = q) = (p ∨ q))
((p ∧ q) = p) = (q = (p ∨ q))
((p ∧ q) = (p = q)) = (p ∨ q)
(((p ∧ q) = p) = q) = (p ∨ q)
p ∧ (q ∧ r) = (p ∧ q) ∧ (p ∧ r)
5
Theorem 2.12 [Absorption]
p ∧ (¬p ∨ q) = p ∧ q
p ∨ (¬p ∧ q) = p ∨ q
(p = q) ∧ (r = p) = (p = q) ∧ (r = q)
(p = q) = (p ∧ q) ∨ (¬p ∧ ¬q)
Implication
(p ⇒ q) = ((p ∨ q) = q)
((p ⇒ q) = (p ∨ q)) = q
(p ⇒ q) = ((p ∧ q) = p)
((p ⇒ q) = (p ∧ q)) = p
6
Theorem 2.18 [Contrapositive]
(p ⇒ q) = (¬q ⇒ ¬p)
p ⇒ (q = r) = ((p ⇒ q) = (p ⇒ r))
p ∧ q ⇒ r = p ⇒ (q ⇒ r)
p ∧ (p ⇒ q) = p ∧ q
p ∧ (q ⇒ p) = p
p ∨ (p ⇒ q) = T
p ∨ (q ⇒ p) = ¬q ∨ p
(p ∨ q) ⇒ (p ∧ q) = (p = q)
p ⇒ F = ¬p
F ⇒ p = T
(p ⇒ T ) = T
(T ⇒ p) = p
7
Theorem 2.24 [Weakening/Strengthening]
p ⇒ p ∨ q
p ∧ q ⇒ p
p ∧ q ⇒ p ∨ q
p ∨ (q ∧ r) ⇒ p ∨ q
p ∧ q ⇒ p ∧ (q ∨ r)
p ∧ (p ⇒ q) ⇒ q
(p ⇒ r) ∧ (q ⇒ r) = (p ∨ q ⇒ r)
(p ⇒ r) ∧ (¬p ⇒ r) = r
(p ⇒ q) ∧ (q ⇒ p) = (p = q)
(p ⇒ q) ∧ (q ⇒ p) ⇒ (p = q)
(p ⇒ q) ∧ (q ⇒ r) ⇒ (p ⇒ r)
(p = q) ∧ (q ⇒ r) ⇒ (p ⇒ r)
(p ⇒ q) ∧ (q = r) ⇒ (p ⇒ r)
(p ⇒ q) ⇒ (p ∨ r ⇒ q ∨ r)
8
Theorem 2.31 [Monotonicity of ∧ ]
(p ⇒ q) ⇒ (p ∧ r ⇒ q ∧ r)
Substitution
(e = f ) ⇒ (E(e) = E(f ))
(e = f ) ∧ E(e) = (e = f ) ∧ E(f )
(e = f ) ⇒ E(e) = (e = f ) ⇒ E(f )
q ∧ (e = f ) ⇒ E(e) = q ∧ (e = f ) ⇒ E(f )
p ∧ E(p) = p ∧ E(T )
p ⇒ E(p) = p ⇒ E(T )
q ∧ p ⇒ E(p) = q ∧ p ⇒ E(T )
p ∨ E(p) = p ∨ E(F )
E(p) ⇒ p = E(F ) ⇒ p
E(p) ⇒ p ∨ q = E(F ) ⇒ p ∨ q
9
3 Propositional Logic - Examples and Exer-
cises
10
4 Predicate Logic - Axioms
11
Axiom 4.3 [Range Split]
∀i : m1 ≤ i < m2 : pi
∧
(m1 ≤ m2 ≤ m3 ) ⇒
∀i : m2 ≤ i < m3 : p i
=
∀i : m1 ≤ i < m3 : pi
∀i : m1 ≤ i < n1 : pi
∧
(m1 ≤ m2 ) ∧ (n1 ≥ n2 ) ⇒
∀i : m2 ≤ i < n2 : pi
=
∀i : m1 ≤ i < n1 : pi
∃i : m1 ≤ i < m2 : pi
∨
(m1 ≤ m2 ≤ m3 ) ⇒
∃i : m2 ≤ i < m3 : p i
=
∃i : m1 ≤ i < m3 : pi
∃i : m1 ≤ i < n1 : pi
∨
(m1 ≤ m2 ) ∧ (n1 ≥ n2 ) ⇒
∃i : m2 ≤ i < n2 : p i
=
∃i : m1 ≤ i < n1 : pi
12
Axiom 4.5 [Dummy Renaming]
∀i : m ≤ i < n : pi = ∀j : m ≤ j < n : pj
∀i : m ≤ i < n : T = T
13
Axiom 4.11 [Existence of F ]
∃i : m ≤ i < n : F = F
(m ≤ i < n) ⇒ pi = ∀i : m ≤ i < n : pi
(m ≤ i < n) ∧ pi ⇒ ∃i : m ≤ i < n : pi
14
Axiom 4.15 [Definition of Σ]
Σi : m ≤ i < n : ei
(m ≥ n) ⇒ =
0
Σi : m ≤ i < n : ei
=
(m < n) ⇒
Σi : m ≤ i < n − 1 : ei
+
en−1
15
5 Predicate Logic - Derived Theorems
∀i : m < i ≤ n : pi
(m ≥ n) ⇒ =
T
∀i : m < i ≤ n : pi
=
(m < n) ⇒
∀i : m + 1 < i ≤ n : p i
∧
pm+1
16
Theorem 5.3 [Definition of Σ]
Σi : m < i ≤ n : ei
(m ≥ n) ⇒ =
0
Σi : m < i ≤ n : ei
=
(m < n) ⇒
Σi : m + 1 < i ≤ n : ei
+
em+1
Πi : m < i ≤ n : ei
(m ≥ n) ⇒ =
1
Πi : m < i ≤ n : ei
=
(m < n) ⇒
Πi : m + 1 < i ≤ n : ei
∗
em+1
17
6 Some Simple Laws of Arithmetic
Throughout this compendium, we assume the validity of all “simple” arith-
metic rules. Examples of such rules are all simplification rules, e.g. =
2+3 = 5
x+x = 2∗x
x+y−y =x
(x/3) ∗ 3 = x
0∗x = 0
1∗x = x
x ∗ x = x2
0x = 0
1x = 1
(2 ∗ x + 10 = 20) = (x = 5)
(x + y < 2 ∗ y) = (x < y)
(x + y = x + z) = (y = z)
x ∗ (y + 1) − (x + z) = (x ∗ y − z)
Following is a collection of theorems that might be used. The list is not
exhaustive but intend to show the level of complexity that you can specify
theorems on.
18
Theorems on < and ≤
(x < y) = (y > x)
(x < y) ⇒ ¬(y = x) ∧ ¬(y < x)
(x < y) ⇒ (x ≤ y)
(x < y) = (x ≤ y) ∧ (x 6= y)
(x < y) ∧ (y ≤ z) ⇒ (x < z)
(x ≤ y) = ¬(x > y)
(x ≤ x) = T
(x ≤ y) ∧ (y ≤ z) ⇒ (x ≤ z)
(x ≤ y) ∧ (y < z) ⇒ (x < z)
(x ≤ y) ∧ ¬(x < y) ⇒ (x < y)
(x ≤ y − 1) = (x < y)
(x ≤ y) ∨ (y ≤ x) = T
(x ≤ y) ∨ (y < x) = T
(x ≤ y) = (x < y) ∨ (x = y)
(x < y) ⇒ (x < y + 1)
(x < y + 1) = (x ≤ y)
(x < y) ⇒ (z − y < z − x)
(0 < x) = (−x < 0)
(x − 1 < x) = T
(x ≤ y − 1) = (x < y)
(x ≤ y) = (x − 1 < y)
(x1 < y1 ) ∧ (x2 < y2 ) ⇒ (x1 + x2 < y1 + y2 )
(x1 ≤ y1 ) ∧ (x2 ≤ y2 ) ⇒ (x1 + x2 ≤ y1 + y2 )
19
Theorems on properties about ∗ and /
(0 < x) = (0 < 2 ∗ x)
(0 < x) = (x < 2 ∗ x)
(0 < x) = (x ÷ 2 < x)
(0 ≤ x/2) = (0 ≤ x)
(x = 0) ⇒ (x ∗ y = 0)
2 ∗ (x/2) = x
(x = x) = T
(x = y) = (x ≤ y) ∧ (y ≤ x)
20
7 Predicate Logic - Examples and Exercises
21
8 Arrays - Axioms
8.1 Axioms
Axiom 8.1 [Assignment to Array Element]
(i = j) ⇒ (e = f )
((b; i : e) [j] = f ) = ∧
(i 6= j) ⇒ (b[j] = f )
22