Professional Documents
Culture Documents
Propositional Logic: September 2017
Propositional Logic: September 2017
Propositional Logic: September 2017
net/publication/319702897
Propositional Logic
CITATIONS READS
0 7,724
1 author:
Bhowmik Subrata
Tripura University
41 PUBLICATIONS 31 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
All content following this page was uploaded by Bhowmik Subrata on 14 September 2017.
1 Introduction:
The term ’logic’ came from GREEK word ’logos’, which is sometimes translated as ’sentence’,
’discourse’, ’reason’, ’rule’ and ’ratio’. The GREEK word ’logos’ means thought. There are many
thought processes such as ’reasoning’, ’remembering’, ’imagining’. Reasoning is a thought process
in which inference takes place. Logic is the science of reasoning.
Briefly speaking we might define logic as the study of principles of correct reasoning. Logic is
the former discipline, and it tells us how we ought to reason if we want to reason correctly. Logic is
the science of how to evaluate arguments and reasoning. Critical thinking is a process of evaluation
which uses logic to separate truth from falsehood, reasonable from unreasonable beliefs.
1
3 Syntax and Semantics of Propositional Calculus:
Propositional logic is the most basic branch of mathematical logic. The area of logic that
deals with propositions is called Propositional logic. It is also called propositional calculus(PC). In
Latin, calculus means a stone used in counting. In PC, the truth or falsity of a ”proposition” can
be ”counted” determined using ”truth table”.
Definition3.1: A declarative sentence ia a sentence which is true or false, but not both, is
called a Proposition (or statement). Statements which are exclamatory, interrogative or imperative
in nature are not propositions.
For example we consider the following sentences
(i) New Delhi is the capital of India.
(ii) How beautiful is Rose?.
(iii) 2+2=3.
(iv) What time is it?
(v) Take a cup of coffee.
In these sentences (ii), (iv) and (v) are obviously not propositions as they are not declarative
in nature. Whereas (i) and (iii) are propositions.
If a proposition is true, we say that the truth value of the proposition is TRUE, denoted by T
or 1. If a proposition is FALSE, the truth value is said to be false, denoted by F or 0.
Propositions which do not contain any of the logical operators or connectives (not, and, or,
if-then, if-and-only-if) are called atomic propositions (or primitive/simple sentence). Many math-
ematical statement which can be constructed by combining one or more atomic statements using
connectives are called molecular or compound propositions (or compound sentences or simply sen-
tences).
The truth value of a compound proposition depends on those of sub propositions and the way
in which they are combined using connectives.
Truth Value Evaluation3.3: All our propositions are either true or false, that is taking only
one truth value not simultaneously both. So if a proposition is not true (denoted by T or 1) then
it must be of opposite truth value that is false (denoted by F or 0), similarly if it is not false then
it must be of opposite truth value that is T or 1.
From the truth value of the compound statement with connectives we need to understand the
meaning of connectives and evaluate the truth value from the nature of the connectives and the
component(s) of the sentence adjoint by the connectives.
2
(i) Negation(¬): It is an unary connective, that is it associated with only one statement. It is
in the sense of ”NOT” (not happening of the statement). The negation of a statement α is written
as ¬α (NOT ”α”). The truth evaluation of negation of statement is opposite to the statement,
thus the negation of a statement α is true iff the statement α itself false.
Consider the example: α=”City X is capital of country Y.” So ¬α=”City X in NOT capital
of country Y”. Naturally if α is true then obviously ¬α is false and α is false then obviously ¬α is
true.
The truth valuation of negation of a statement can be expressed by the following truth table:
α ¬α
1 0
0 1
(ii) Disjunction(∨): It is a binary connective, that is it adjoin with two statements. The
nature of this connective is in the sense of ”OR” (happening of at least any one of the statements).
The disjunction of two statement α and β is written as α ∨ β (”α OR ”β”). The truth evaluation
is true if we find at least any one of the adjoint statement is true, else false.
Consider the example: α=”SIMRAN is dancing” and β=”MITA is singing”. Thus α ∨
β=”SIMRAN is dancing” OR ”MITA is singing”. This compound statement is considered to
be true if at least any one of the event occur or both.
See the following truth table evaluation:
α β α∨β
1 1 1
1 0 1
0 1 1
0 0 0
(iii) Conjunction(∧): It is a binary connective, that is it adjoin with two statements. The
nature of this connective is in the sense of ”AND” (happening of both of the statements). The
conjunction of two statement α and β is written as α ∧ β (”α AND ”β”). The truth evaluation is
true if we find both of the adjoint statement is true, else false.
Consider the example: α=”SIMRAN is dancing” and β=”MITA is singing”. Thus α ∧
β=”SIMRAN is dancing” AND ”MITA is singing”. This compound statement is considered to
be true if both of the event occur. If any one or both do not happened the conjunction should be
considered false.
See the following truth table evaluation:
α β α∧β
1 1 1
1 0 0
0 1 0
0 0 0
(iv) Conditional(→): It is a binary connective, that is it adjoin with two statements. The
conditional statement for two statement α and β is written as α → β (If ”α” THEN ”β”), where α
is called antecedent and β is called consequent. Intuitively we mean α → β as β is deducible from
α.
3
(b) If α is true then we have applied Shredharacharya formula to the equation f (x) = 0 thus
if β is false then we have a wrong solution of the equation f (x) = 0 which is not possible, thus the
statement α → β becomes false.
(c) Again if α is false then we have not applied Shredharacharya formula to solve the equation
f (x) = 0, may be some other method applied (correct or false method) or may not applied any
method to solve f (x) = 0, then we may get solution of f (x) = 0 (correct or false) or may not get
any solution accordingly, that is whether β is true or false the conditional statement α → β have
to be taken true.
Consider another example: α=”KIRAN walk through the main way of University”, β=”KIRAN
get the University”.
(a) If α is true then KIRAN follow the right path to the university. Thus if β is true then we
must accept α → β is true.
(b) If α is true but is β is false, then though he follow correct path, he did not get the university
which we cannot accept and so we have to take the conditional statement α → β is false.
(c) If α is false, then KIRAN did not follow the main way, he may follow another way that may
lead to university or not or may did not follow any way; so accordingly he will get the university
or not, that is β may be true or false, and so we have to take the conditional statement α → β is
true for any truth value of β.
The truth value evaluation of conditional statement can be demonstrated in the following truth
table:
α β α→β
1 1 1
1 0 0
0 1 1
0 0 1
(v) biconditional(↔): It is a binary connective, that is it adjoin with two statements. The
biconditional statement for two statement α and β is written as α ↔ β (”α” IF ONLY IF ”β”).
The nature of this statement is that α is happening whenever β is happening and conversely, in
other words ”if α then β and if β then α”. The truth value of this statement is consider to be true
if both agree that is both have the same truth value.
Consider the example: For triangles consider the statements in Euclidean plane geometry,
α=”All sides are equal” and β=”All angle are equal”. We already know that if α is true then also
β and conversely; in other word if α is false then β is false and conversely. Thus the statement ”α
IF AND ONLY IF β” that α ↔ β is true whenever α and β are simultaneously true or false.
The truth evaluation of conditional statement can be demonstrated in the following truth table:
α β α↔β
1 1 1
1 0 0
0 1 0
0 0 1
Now we define the truth evaluation of a sentence from the truth assignment of the simple
sentences.
4
Definition3.4: A truth assignment or valuation or model of the language L of propositional
calculus is a mapping:
v : P → {0, 1}
.
Now we define the truth value of any sentence of W to be the extension of the mapping v to
v : W → {0, 1}
as inductively in the following way(see the truth tables constructed in 3.3):
(i) v(¬α) = 1 iff v(α) = 0.
(ii) v(α ∨ β) = 1 iff v(α) = 1 or v(β) = 1.
(iii) v(α ∧ β) = 1 iff v(α) = 1 and v(β) = 1.
(iv) v(α → β) = 1 iff v(α) = 0 or v(β) = 1.
(v) v(α ∨ β) = 1 iff v(α) = 1 = v(β) or v(α) = 0 = v(β).
Definition3.5: α ∈ W is said to be a:
(i) Tautology if for any model v, v(α) = 1. We write |= α. If α is not a tautology we will write
2 α.
(ii) Contradiction if for any model v, v(α) = 0, or in other word ¬α is a tautology (i.e. |= ¬α).
Example3.6: Tautology: (i) α∨¬α (law of excluded middle). (ii) α → α∨β. (iii) α∧β → β.
Contradiction: (i) α ∧ ¬α, (ii) ¬(α → α).
Definition3.8: Let α, β ∈ W , we say α and β are logically equivalent if for any model v,
v(α) = v(β). We write α ≡ β.
Theorem3.10:
(i) α ≡ β iff |= α ↔ β iff |= α → β and |= β → α.
(ii) If α ≡ β and |= α then |= β.
(iii) If |= α and |= α → β then |= β.
(iv) If α ≡ β then ¬α ≡ ¬β.
(v) If α1 ≡ α2 and β1 ≡ β2 then α1 ∨ β1 ≡ α2 ∨ β2 and α1 ∧ β1 ≡ α2 ∧ β2 . Also α1 → β1 ≡
α2 → β2 .
5
Define the binary operations t; u and an unary operation ∼ on W/≡ as < α > t < β >=<
α ∨ β >, < α > u < β >=< α ∧ β > and ∼< α >=< ¬α >. Then these operations are well defined
and (W/≡ , t, u, ∼, ⊥, >) forms a Boolean algebra, where ⊥ =< α ∧ ¬α > the class of contradictions
and > =< α ∨ ¬α > the class of tautologies. (Exercise)
Exercise3.12: Consider the set of simple sentences P = {p, q, r}. Check weather the following
pair of formulas are equivalent or not.
(i) (p → q) → p and p.
(ii) ¬p ∨ q and ¬q ∨ p.
(iii) p ∨ (q ↔ r) and (p ∨ q) ↔ (p ∨ r).
(iv) p → (q → r) and (p → q) → (p → r).
Theorem3.14: Show that (i) {¬, ∨}, (ii) {¬, →}, (iii) {¬, ∧} are adequate set of connectives.
Proof: (i) and (iii) are exercise.
(ii) Let v be any model.
Claim I: α ∨ β ≡ ¬α → β.
Verification: v(¬α → β) = 1 iff v(¬α) = 0 or v(β) = 1 iff v(α) = 1 or v(β) = 1 iff v(α ∨ β) = 1.
Thus Claim I verified.
Hence by verifying Claim I, II and III we conclude that {¬, →} is a adequate set of connectives.
And this set is minimal as further reduction is not possible due to only one unary and only one
binary connectives, further reduction will loss all the binary connectives or the unary connective.
Theorem3.18:
(i) α ≡ β iff α |= β and β |= α.
(ii) α1 , α2 , ...., αn |= β iff α1 ∧ α2 ∧ ...... ∧ αn |= β.
(iii)For any α, β ∈ W , α, ¬α |= β (equivalently α ∧ ¬α |= β).
6
(iv) α, α → β |= β.
(v) α |= β iff |= α → β.
(vi) α1 , α2 , ...., αn |= β iff α1 , ...., αn−1 |= αn → β iff |= α1 → (α2 → (....(αn → β).....)).
Theorem3.21:
(i) F ⊆ E ⊂ W , F |= β implies E |= β.
(ii) F |= α or F |= β iff F |= α ∨ β.
(iii) If F |= α and F |= α → β then F |= β.
(iv) F |= α and F |= α iff F |= α ∧ β.
(v) If F |= α → β and F |= β → γ then F |= α → γ (Thus If |= α → β and |= β → γ then
|= α → γ).
4 Satisfiability:
Theorem4.3: (i) F is not satisfiable iff (ii) for any sentence α, F |= α iff (iii) there exists
a sentence β such that F |= α and F |= ¬β both iff (iv) there exists a sentence β such that
F |= β ∧ ¬β.
Proof:
(i) implies (ii): Let F is not satisfiable. So we can say for any model v and for any sentence
α, if v(α) = 0, there is some γ ∈ F such that v(γ) = 0, so F |= α for any sentence α.
(ii) implies (iii): Follows from (ii) for some fixed sentence β.
(iii) implies (iv): Immediate.
(iv) implies (i): Due to (iv) there is no model v which satisfies F .
7
Exercise4.5: Consider the set P = {p, q, r} of simple sentences. Check wheatear the following
formulas are tautology, contradiction or satisfiable:
(i) p → ((q ∧ ¬r) → ¬p).
(ii) (p ↔ (¬q ∨ r)) → (¬p → q).
(iii) (p → (q ∨ r)) ∨ (p → q).
(iv) (p ∧ q) → (p ∨ r).
(v) ((p → q) → p) → p.
Theorem4.6:
(i) F |= α iff F ∪ {¬α} is not satisfiable.
(ii) F ∪ {α} is satisfiable iff F 2 ¬α.
Proof:
(i) Let F |= α. If possible let F ∪ {¬α} is satisfiable. So there exists v |= F ∪ {¬α}, i.e. v |= F
and v(¬α) = 1, i.e. v(α) = 0 which is not possible. Hence F ∪ {¬α} is not satisfiable.
Conversely, suppose that F ∪{¬α} is not satisfiable. If possible let F 2 α, so there exists v ∈ V
sauch that v |= F and v(α) = 0, i.e. v(¬α) = 1, i.e. v |= F ∪ {¬α}, i.e. F ∪ {¬α} is satisfiable
which is not possible. Hence F |= α.
(ii) Let F ∪ {α} is satisfiable. So there exists v |= F ∪ {α}, i.e. v |= F and (vα) = 1, i.e.
v(¬α) = 0 and thus F 2 ¬α.
Conversely, suppose that F 2 ¬α. So there exists a model v such that v |= F but v(¬α) = 0,
i.e. v(α) = 1, i.e. v satisfies F ∪ {α}. So F ∪ {α} is satisfiable.
Corr4.7:
(i) F |= ¬α iff F ∪ {α} is not satisfiable.
(ii) F ∪ {¬α} is satisfiable iff F 2 α.
(iii) |= α iff ¬α is not satisfiable.
(iv) α is satisfiable iff 2 ¬α.
(v) |= ¬α iff α is not satisfiable.
(vi) ¬α is satisfiable iff 2 α.
8
Hence β ∈ M .
Theorem4.10: Every finitely satisfiable set of sentences contained in a maximal finitely sat-
isfiable set of sentences.
Conversely let F is finitely satisfiable. Then F contained in a maximal finitely satisfiable set
M (say).
We define v : W → {0, 1} as v(α) = 1 iff α ∈ M .
Now we see that for any α, β ∈ W
(i) v(¬α) = 1 iff ¬α ∈ M iff α ∈ / M iff v(α) = 0.
(iii) v(α ∨ β) = 1 iff α ∨ β ∈ M iff α ∈ M or β ∈ M iff v(α) = 1 or v(β) = 1.
Thus v/P defines a valuation (which is defined since for any simple sentence p either p ∈ M or
¬p ∈ M , i.e. either v(p) = 1 or v(p) = 0).
Thus v |= M , hence v |= F . Thus F is satisfiable.
9
(ii)-(v) Exercise.
(ii) We already know that F ⊆ T h(F ). Now let F is a propositional theory, so F |= β implies
β ∈ F , i.e. β ∈ T h(F ) implies β ∈ F , i.e. T h(F ) ⊆ F . Thus (ii) F = T h(F )
(iv) We already know that F ⊆ T h(F ). Now if E is a propositional theory then T h(E) = E
and if F ⊆ E then T h(F ) ⊆ T h(E) = E, ie. F ⊆ T h(F ) ⊆ E. Thus (iv) follows.
10
Definition4.19: For a truth assignment v we define the theory of v to be the set T h(v) of all
sentences which are true under v, i.e. T h(v) = {α ∈ W : v(α) = 1}.
Theorem4.21: M is a maximal satisfiable set iff it has an unique model (truth assignment).
If v that unique model then M = T h(v).
Proof: Let M is maximal. Let v satisfies M , so M ⊆ T h(v). but T h(v) is satisfiable set, so
M = T h(v). Thus for any two models u and v satisfying M , M = T h(u) and M = T h(v), i.e.
T h(u) = T h(v), i.e. u = v. Thus M has an unique model.
The last part follows from above proof.
Converse directly follows.
Definition4.23: For any non-empty set K of truth assignments / models we define the theory
of K to be the set T h(K) = {α ∈ W : v(α) = 1 for all v ∈ K}.
Definition4.24: For any non-empty set K of truth assignments / models we say K is axiom-
atizable if for some F of sentences, K = M od(F ).
11
(i) Exercise.
(ii) Let u ∈ K then u |= T h(u). Since ∩{T h(v) : v ∈ K} ⊆ T h(u), so u |= ∩{T h(v) : v ∈ K},
i.e. u |= M od(T h(K)). Thus K ⊆ M od(T h(K)).
(iv) Let α ∈ T h(M od(F )), so for any v ∈ M od(F ), v(α) = 1, so v |= F implies v(α) = 1,
i.e. F |= α, i.e. α ∈ T h(F ). Since F is a propositional theory T h(F ) = F . Thus α ∈ F . So
T h(M od(F )) ⊆⊆ F . Using (iii) (iv) follows.
(iii) Exercise.
(vi) Let K is axiomatizable. So there exists a set F of formulas such that K = M od(F ).
Now F ⊆ T h(M od(F )), i.e. F ⊆ T h(K), thus M od(T h(K)) ⊆ M od(F ) = K. Then using (i) (vi)
follows.
In this section we will construct a topological space and see the interpretation of the compact-
ness theorem from topological point of view.
(iii) τ (V ) is Hausdorff: Let u, v ∈ V and u 6= v, then there exists p ∈ P such that u(p) 6= v(p).
With out loss of generality suppose u(p) = 0, then v(p) = 1. So v ∈ V¬p and u ∈ Vp . Also
Vp ∩ V¬p = V¬p∧p = ∅.
12
F = {¬α : Vα ⊆ V − C for some C ∈ C}.
Let {¬α1 , ...., ¬αn } be a finite subset of F , So there exist Ck ∈ C, k = 1, ...., n such that
V αk ⊆ V − C k .
Now S = V − ∪nk=1 Vαk ⊇ ∩nk=1 Ck 6= ∅. So S is a non-empty set, and contains all v ∈ S such
that αk are 0 for k = 1, ..., n, i.e. there exists a v ∈ C such that v(¬αk ) = 1 for k = 1, ..., n.
Thus F is finitely satisfiable, so by compactness theorem F is satisfiable, so there exists a
v ∈ V such that v(¬α) = 1 for all ¬α ∈ F .
Since each sets in C is proper subset of V , so each set V − C for each C ∈ C contains a Vα for
some α and ¬α ∈ F .
Thus v ∈ / Vα ⊆ V − C for each C ∈ C, i.e. v ∈ C for each C ∈ C, i.e. C has non-empty
intersection.
Hence (V, τ (V )) is a compact space.
By the use of truth table or truth value evaluation we have decided whether a formula a
tautology or not, whether two formulas are equivalent or not etc. These were some simple part
of proposition logic. But dealing with more complex part of the logic cannot be handled by truth
table or truth value evaluation or by any other similar effective procedure. In this part we will
construct a formal axiomatic approach to deal with propositional logic.
In axiomatic approach we consider a set of tautologies as axioms and one ore more formal rule
of inferring a sentence from a finite number of sentences called rule of inference.
Definition6.1: Let P be a countable set of simple sentences. We consider the primitive set
of connectives {¬, →} and we form the set W of wff from P with the connectives ¬ and → as:
(i) P ⊂ W ,
(ii) If α, β ∈ W then ¬α, α → β ∈ W ,
(ii) The members of W are only defined by the above rules (i) and (ii).
13
α ↔ β = (α → β) ∧ (β → α).
α,¬α∨β
(NB: From truth valuation we can see that (MP) is of the form: β ).
Theorem6.4: ` α → α.
Proof:
(i) α → (α → α). (PC1)
(ii) α → ((α → α) → α). (PC1)
(ii) (α → ((α → α) → α)) → ((α → (α → α)) → (α → α)). (PC2)
(iii) (α → (α → α)) → (α → α). (MP (ii), (iii))
(iv) α → α. (MP (i), (iii))
Thus ` α → α.
Proof: Since ` α, so there is a proof of α say α1 , α2 , ...., αn such that each αk is an axiom of
PC or for k > 2, αk follows from αi , αj for some 1 ≤ i, j < k by MP.
Now, obviously α1 and α2 are axioms, so |= α1 and |= α2 . Lets us prove the theorem by
induction. Let k > 2 and for i < k, |= αi .
Now if αk is an axiom then |= αk . Now if αk is not an axiom then αk follows from αi and αj
by the rule MP where 1 ≤ i, j < k and αj is of the form αi → αk .
Now |= αi and |= αj , i.e. |= αi → αk . Hence |= αk .
And by induction |= αn , i.e. |= α.
Theorem6.9: α ∈ F implies F ` α.
Theorem6.10: ∅ ` α iff ` α.
Theorem6.11: α ` α.
Theorem6.12: If F ⊆E ⊂W then F ` α implies E ` α.
14
Theorem6.13: If ` α then for any set F of sentences F ` α.
Theorem6.14: If F ` α and F ` α → β then F ` β. (Exercise)
Theorem6.19:(MP) α, α → β ` β.
15
(v) (α → (β → γ)) → ((α → β) → (α → γ)) (PC2)
(vi) (α → β) → (α → γ) MP(iv, v)
(vii) α → γ MP(i, vi).
Thus α → β, β → γ ` α → γ.
Theorem6.24: ` ¬α → (α → β).
Proof:
(i) ¬α (Assumption 1)
(ii) α (Assumption 2)
(iii) α → (¬β → α) (PC1)
(iv) ¬α → (¬β → ¬α) (PC1)
(v) ¬β → α (MP(ii, iii))
(vi) ¬β → ¬α (MP(i, iv))
(vii)(¬β → ¬α) → (α → β) (PC3)
(viii) α → β (MP(vi, vii))
(ix) β (MP(ii, viii).
Thus ¬α, α ` β. Using deduction theorem ¬α ` α → β and again using deduction theorem
` ¬α → (α → β).
Theorem6.25: ` ¬¬α → α.
Proof:
(i) ¬¬α (We assume)
(ii) ¬¬α → (¬α → ¬¬¬α) (Theorem)
(iii) ¬α → ¬¬¬α (MP(i, ii))
(iv) (¬α → ¬¬¬α) → (¬¬α → α) (PCA3)
(v) ¬¬α → α (MP(iii, iv))
(vi) α (MP(i, v)).
Thus ¬¬α ` α, hence by deduction theorem ` ¬¬α → α.
Theorem6.26: ` α → ¬¬α.
Proof:
(i) ¬¬¬α → ¬α (Theorem)
(ii) (¬¬¬α → ¬α) → (α → ¬¬α) (PC3)
(iii) α → ¬¬α (MP(i, ii)).
Hence ` α → ¬¬α.
16
Again since, ` ¬β, thus ` ¬α.
17
From Syllogism(iv, v) we have α ` ¬β → ¬(α → β) and using deduction theorem we have the
required result.
Exercise6.37:
(i) ` α → ((α → β) → β).
(ii) For any two formulas α, β, show that α, ¬α ` β.
(iii) If F ` α and α ` β then F ` β.
(iv) If F ` α1 ,......, F ` αn and α1 , ....., αn ` β then F ` β.
Lemma6.37: Let α be a sentence in which the only occurrence of simple sentences are
/ /
p1 , p2 , ...., pk . Let v be a truth assignment. We define pi to be pi if v(pi ) = 1, otherwise pi is
¬pi and α/ to be α if v(α) = 1, otherwise α/ is ¬α. Then
/ / /
p1 , p2 , ...., pk ` α/
Proof: Let the assume the only connectives occurring in α are ¬ and →.
We will prove the claim by induction on the number n of all the total number of occurrence
of ¬ and → in α.
/
If n = 0 then, α is a simple sentence pi for some i = 1, 2, ...., k. Thus α/ is pi and the claim
follows immediately.
18
Since ` β → (¬γ → ¬(β → γ)).......(ix)
From (vii) and (ix) by MP we have:
/ / /
p1 , p2 , ...., pk ` ¬γ → ¬(β → γ).....(xi)
Again, by MP(viii, ix) we have:
/ / /
p1 , p2 , ...., pk ` ¬(β → γ) and the claim follows.
Theorem6.40:
(i) ` α ∨ ¬α, 0 α ∧ ¬α.
(ii) If F ` α and α ` β iff F ` α ∧ β. So ` α and ` β iff ` α ∧ β.
(iii) ` α → (α ∨ β)
(iv) ` (α ∧ β) → α.
(v) If ` α ↔ β then ` α iff ` β.
7 Consistency:
19
(ii) F is said to be maximal consistent if F is consistent and F cannot to enlarge to a bigger
set as consistent set, i.e. if E is consistent and F ⊆ E then E = F .
(ii) If {p} is inconsistent, then there exists β such that p ` β and p ` ¬β. By soundness
theorem
p |= β and p |= ¬β.......(**)
We take a model v such that v(p) = 1, then v(β) = 1 = v(¬β), which is not possible. Hence
(**) is not possible. Thus the proof follows.
(iii) Exercise.
Exercise 7.4: Prove 7.3(i) and (ii) without use of soundness theorem.
Theorem7.6:
(i) T H(∅) = {α :` α}.
(ii) E ⊆ F ⊆ W implies T H(E) ⊆ T H(F ).
(iii) If α ` β or equivalently ` α → β, then T H(β) ⊆ T H(α).
(iv) ` α ↔ β iff T H(α) = T H(β).
(vi) F ` β then β ∈ T H(F ).
(vii) If F ` β then T H(β) ⊆ T H(F ).
Proof: Exercise.
Theorem7.7:
(i) If {α} is consistent then T H(α) is a constituent set.
(ii) T H(α) = T h(α).
(iii) T H(α) ∩ T H(β) = T H(α ∧ β).
(iv) T H(α) ∪ T H(β) = T H(α ∨ β).
(vi) ` α ↔ β iff T H(α) = T H(β).
(vii) ` α → β iff T H(β) ⊆ T H(α).
Proof: (i) If T H(α) is inconsistent, then there exists β such that T H(α) ` β and T H(α) ` ¬β.
Now ∃ a finite subset {α1 , ..., αn } ⊆ T H(α) such that α1 , ..., αn ` β and α1 , ..., αn ` ¬β.
But α ` αk for any k = 1, ..., n, so α ` β and α ` ¬β, which is not possible. Hence the proof
follows.
20
Proof: Let F be consistent. So there is no formula β such that F ` β and F ` ¬β holds
simultaneously and so there exists some α (β or ¬β) such that F 0 α.
Conversely, let there is an α such that F 0 α. If possible let F is inconsistent, so there exists
β such that F ` β and F ` ¬β. Since β, ¬β ` α, so F ` α, which is not possible, hence F is a
consistent.
Theorem7.11:
(i) F ` α iff F ∪ {¬α} is inconsistent.
(ii) F ∪ {α} is consistent iff F 0 ¬α.
Proof: (i) Let F ` α. So F ∪ {¬α} ` α, and also F ∪ {¬α} ` ¬α. Hence F ∪ {¬α} is
inconsistent.
Conversely, suppose that F ∪{¬α} is inconsistent. So there is a formula β such that F ∪{¬α} `
β and F ∪ {¬α} ` ¬β. By deduction Theorem F ` ¬α → β and F ` ¬α → ¬β, so F ` β → α and
then using Syllogism F ` ¬α → α. Since ` (¬α → α) → α, by MP we have F ` α.
(ii) Let F ∪ {α} is consistent. Let if possible F ` ¬α. So F ∪ {α} ` ¬α, and also F ∪ {α} ` α.
which shows that F ∪ {α} is inconsistent, which is not possible, so F 0 ¬α.
Conversely suppose that F 0 ¬α. Let if possible F ∪ {α} is inconsistent. So there is a formula
β such that F ∪ {α} ` β and F ∪ {α} ` ¬β. As similar above we can show F ` ¬α, which is not
possible, so F ∪ {α} is consistent.
Corollary7.12:
(i) F ` ¬α iff F ∪ {α} is inconsistent.
(ii) F ∪ {¬α} is consistent iff F 0 α.
(iii) ` α iff {¬α} is inconsistent.
(iv) {α} is consistent iff 0 ¬α.
(v) ` ¬α iff {α} is inconsistent.
21
(vi) {¬α} is consistent iff 0 α.
(ii) Let α, ¬α ∈ M , then M ` α and M ` ¬α, i.e. M is inconsistent which is not possible, so
both α and ¬α cannot be both of them to be members of M .
Again let neither α and ¬α is in M , by maximality of M , M ∪ {α} and M ∪ {¬α} both
inconsistent. So M ` ¬α and M ` α. So α, ¬α ∈ M which is a contradiction, so α ∈ M or ¬α ∈ M
but not both.
(iii)-(vii) Exercise.
[α] = {M ∈ M : α ∈ M }
.
Theorem7.16:
(i) [α] = {M ∈ M : M ` α}.
(ii) ` α → β iff [α] ⊆ [β].
(iii) ` α ↔ β iff [α] = [β].
(iv) [¬α] = M − [α].
(v) For any theorem α, [α] = M.
(vi) For any theorem α, [¬α] = ∅.
(viii) [α ∨ β] = [α] ∪ [β].
(vii) [α ∧ β] = [α] ∩ [β].
Proof: Exercise.
Theorem:
(i) (M, τ (M)) is a zero-dimensional space, i.e. the topology τ (M) has a base consisting of
clopen sets.
(ii) (M, τ (M)) is a Hausdorff space.
22
(iii) (M, τ (M)) is a second countable space.
(v) B(M) is a base for closed sets also.
Proof: (i) Since [α] ∩ [¬α] = [α ∧ ¬α] = ∅, so if N ∈ M − [α], N ∈ [¬α] = M − [α], so [α] is
a closed set. So B(M) consisting of clopen sets. Hence (i) follows.
(ii) Let M, N ∈ M and M 6= N , so there exists α ∈ W such that α is only one of them, not in
both, say α ∈ M and α ∈ / N (other case similar). So ¬α ∈ N . Thus M ∈ [α] and N ∈ [¬α]. But
we have [α] ∩ [¬α] = ∅. Hence (ii) follows.
(iii) The space is second countable since P is countable and also the set of connectives, so the
set W is countable. So B(M) is a second countable space.
(v) Every open set U is of the form ∪i∈Λ [αi ] where Λ is an indexing set. So every closed set is
of the form M − ∪i∈Λ [αi ] = ∩i∈Λ (M − [αi ]) = ∩i∈Λ ([¬αi ]) = ∩i∈Λ ([βi ]).
8 Topological Semantics:
We have studied the semantics of propositional calculus as two two valued mappings. In this
section we will study the topological semantics of propositional calculus. Here we consider the
primitive connectives to be {¬, ∨} and other connectives are defined as defined before with ¬ and
∨.
For any topological space (X, τ (X)) we denote τclopen (X) be the collection of all clopen sets
in (X, τ (X)).
We will say a formula α is valid for the model (X, τ (X), v), if v(α) = X. α is said to be
topologically valid if for any model in T , α is valid. We write
α.
Let F ⊆ W and β ∈ W , we will write F
α, if for any (X, τ (X), v) ∈ T , v(α) = X for any
α ∈ F then v(β) = X.
If F = {α1 , ...., αn } we will write α1 , ...., αn
β.
Exercise8.3: ∅ β iff β.
Exercise8.4: (i)For any topological model (X, τ (X), v) v(α) ⊆ v(β) iff
α → β.
(ii)
α ↔ β iff for any topological model (X, τ (X), v) v(α) = v(β).
23
Theorem8.6:(Completeness Theorem for Topological Semantics): If
α then ` α.
Proof: We consider the topological space (M, τ (M)). Now we define the mapping:
v : P → τclopen (M)
defined as v(p) = [p]. So (M, τ (M), v) is topological model for L.
We claim that for any α ∈ W , v(α) = [α]. We prove it by induction on the connectives:
(i) Let α = ¬β and v(β) = [β]. So v(α) = v(¬β) = M − v(β) = M − [β] = [¬β] = [α].
(ii) α = β ∨ γ and v(β) = [β], v(γ) = [γ]. Now v(α) = v(β ∨ γ) = v(β) ∪ v(γ) = [β] ∪ [γ] =
[β ∨ γ] = [α].
Thus the claim is true.
9 Algebraic Semantics:
We have studied the semantics of propositional calculus as truth valued semantics and topo-
logical semantics.
It is easy to see that for any topological space (X, τ (X)), (τclopen (X), ∪, ∩, X − (.), ∅, X) forms
a Boolean algebra.
In this section we will study the algebraic semantics of propositional calculus. Here we consider
the primitive connectives to be {¬, ∨} and other connectives are defined as defined before with ¬
and ∨.
We will say a formula α is valid for the model (B, v), if v(α) = 1. α is said to be algebraically
valid if for any model in B α is valid. We write α.
Let F ⊆ W and β ∈ W , we will write F α, if for any (B, v) ∈ B, v(α) = 1 for any α ∈ F
implies v(β) = 1.
If F = {α1 , ...., αn } we will write α1 , ...., αn β.
Exercise9.3: ∅ β iff β.
Exercise9.4: (i) For any algebraic model (B, v) v(α) ≤ v(β) iff α → β. Here ≤ is the
partial order relation induced from the Boolean algebra B defined as a ≤ b iff a + b = b equivalently
iff a · b = a.
(ii) α ↔ β iff for any algebraic model (B, v) v(α) = v(β).
24
Theorem9.5:(Soundness Theorem for Algebraic Semantics): If ` α then α.
Proof: Exercise.
v : P → B(M)
defined as v(p) = [p]. So ((B(M), ∪, ∩, M − [.], ∅, M), v) is algebraic model for L.
It is easy already verified that for any α ∈ W , v(α) = [α]. The remaining proof is same as
that of topological semantics.
References
[1] A. H. Bassoon; D. J. O’connor, Introduction to Symbolic Logic, Oxford university press (1998).
25
View publication stats