Propositional logic, MFCS -2010, Mihaiela Lupea

4. Formal (axiomatic) system of propositional logic P = (Zp, Fp, Ap,Rp) where:

&,

,UE

. I"
-

=Var _propos

uCu{(,)}

vocabulary

-propos = {pr,p2,...} - aset of propositional variables - c = {- (negation), n (conjunction), v (crisjunction),-+ (imprication),+> (equivatece)}

var

t Fp: the set of well formed formulas, which is the smallest

satis$zing the ru1es:

set

of

formula

-base: pi e Fp,i =1,2,...; -induction: if u,rt

e

to then:
(J<>VeFo

-UeFr,UnVeFr, UvVe Fr, (J_+VeFr,

-closure: all formulas from Fp are obtained by applying the rules above in a finite number of times.

Ap = {A1, A2, A3} _ the set

of axioms of propositional logic

A1: U -+ (V -+ U) A2: (U -+ (V -+ Z)) -+ ((U _+V) A3:

1U
_+

(u

Z))

-+V) -+ (-V -+ -U)

axiomatic schemes, where (J,v,z can formulas, generating an infinite number of axioms .

These axioms are

in fact

be arbitrarv

{mp} - the set of inference(deduction) rules containing modus ponens rule. Notation: u,u -+vl-nprt , with the meaning: ,,from the facts ry and, u _+v we
Rp =

deduce

(infer) v ',.
obtained using the axiomatic schemes A:,A2.A3 are

Remark: All the axioms

tautologies (valid formulas).

Y/

Propositional logic, MFCS -2010, Mihaiela Lupea

Definition 7: LetIJI,rJ2,..,IJn be formulas, called hypotheses and V be a formula. V is deductible (derivable) from Ul,...,Un and we denote this by Ul,'.,Un l- V' if there
is a sequence
or c).

(f,,fr,...,f,,) of formulas such that f,,:Y andv;

e{1,...,m} we have a)

orb)

a) .fi Ap (axiom); b) f, e {U1,...,Un} (hypothesis formula); c) ft, fizl- *p .fr, il < i and i2 < i (formula is inferred
existed formulas) The sequence (l ,.f2,...,.f,,,)is called the deduction

using modus ponens from two

of V from U1,U2,..,Un'

DefinitionS:

formulaU

e ,Fo, such

that

A!U (or FU) iscalled theorem.

Remark; The theorems are the formulas deductible only from the axioms and using
modus ponens as inference rule.

Decision problems in propositional logic:

. .

"Is

a given

propositional formulaU

theorem or not?"

"Is a siven formula V deductible from the set of formulas Ul,U2,..,lJn?"

Example 5: Prove that: Ll,(J -+V,V -+ Z 1- Z using the definition of deduction:

We build the sequence (fl

,D,R,f4,f5) of formulas

as follows:

'

fl
f2:

u
U -+V

f|,f21-,,0v

R:V
f4: fi -+ z
f3,f41-n,oz

f5

We remark that

fl,n,f4 are initial formulas (hypotheses),

and f3, f5 are obtained using

modus ponens. According to the above definition, we have proved that the deduction
holds. AO

Propositional logic, MFCS _2010, Mihaiela Lupea

Example 6. Prove that I u -+u, building the deduction We build the sequence of formulas (f1,

fI:

from the axioms only. D, R,f2l, f5) as follows:

U -+

of

U -+ ((U _> U) _+ U)

- from AI: u_+(V_>LD replacing V with _+Lr U , _> _+ D.: (u ((u u) _+ u)) _+ ((u _> (u _+u)) _+ (u _+ (J)) - from A2: 11u __> (v _+ z)) _+ ((u _+ _+ _> v) (u z)) using the replacements:

V with

U -_>u and,

Zwith

U;

fl,f2 l*,
f3: f4:

{u _>(U _+u))_>(u _+u)

(u -+ (U _+ U)) _> (U _>U)

U _+ (U _> U)

- from

Al u + (V _+ (J) replacing V with (J

R, f4 l- *o u _>u f5: u _+u

The sequence (fl , D, U -+ U is a theorem. Example 7.
Prove that

R, fll, f5) is the deduction of u -+ty from the axioms,

therefore

-UlU-+z

using the definition of deduction.

We build (f7, f2, f3, f4, f5) as follows:

fl: -r_t --- hypothesis formula fl; -U _+ (_V _+ _(I)

- from

Ar: u -+ (v -+ u) repracing, with

fl, D.l- mp _v -+ _(J f3: -V -+ -(J .f4: (-V -+ -U) --> (U _+.tt)
- from
f3,

-u and v

with

-tt

A3 (u -+ v) --> (-v
u _>v

-->-u;reprac ing

f4l*o

u with -v

and

with _U

f5: U -+v
The sequence (f1,

D' R, f4,

f5) is the deduction

of u -_, v from -u

andthe axioms.

IA

Propositional logic, MFCS -2010, Mihaiela Lupea

Theorem of deduction:

If

U1,...,(Ia-y,UrlV, then (J1,...,(J,-vlU, ->V

'

Reverse of theorem of deduction:

If

(J1,...,(Jn-71-Ur+Vthen (/1,...,Un-t,U"lV.

Applying "n" times the theorem of deduction and its reverse we obtain:
(J1,...,(Ja*y,UnlV
(11,...,(J

if

and onlY

if if

n-1J-

+ fi if
+

atd onlY

(J1,...,(Ja-2lUn-t

(Un

-+Q if and only if

Utl- Uz -+ (...Un-t -+ (Un -->V)...) if and only

l- Ur -+ (Uz

if

+ (...-+ (U, -+ V)...))

Consequences of the theorem of deduction:

1. l-u -+ ((U'+ v) -+v) 2. l- (U -+V)'+ ((V -+ Z) -> (U + Z)) syllogism rule 3. l- (u -+ (v -+ z)) -+ (v -+ (u z)) permutation of the premises 4. l- (U -+ (v -+ z)) -> (v nu -+ z)) reunion of the premises 5. l- (u " v -+ Z) -+ (u -+ (v -+ z)) separation of the premises
-->

Example 8: We prove the consequences

I and2.
-+vl-^o t'

1. We begin with the modus ponens rule: u, U

Applying the theorem of deduction we obtain

another application of the same theorem:

: U | * (U -+ V) -+ V
'

and we continue with

lU

-+ ((U -+ V)-+V)

2. Using example

I we begin with the deduction:

U,(-/
V

-+V,V -+ z
|

l- z
-+ Z

::> Application of the theorem of deduction ::> Application of the theorem of deduction ::>
Application of the theorem of deduction

(J -+

,V -+ Z

Lr

U + V | -(V

-->

Z) -+
-->

(U + Z)
Z) -+ (U -+ Z))

l- (U -+ V) + ((V

t: lr\J

Propositional logic, MFCS _2010, Mihaiela Lupea Example

9.

Using the

l- @ -+ r) -+ ((p Ar _) q) _+ (p

theorem of ) q))

deduction

and

its

reverse

prove

stepl: we apply the reverse of the theorem of deduction to obtain the deduction to begin with: if l@ --> r) -+ (p __> q) _+ (p _> q)) then ^r
p -+rl_(pnr

p_)r,pAr-)qlp_>q p)r,pAr)q,pl_q

+ q)_>(p _+ q)

then

then

Step2: We prove the deduction obtained at Stepl. Using Definition 7 we build the sequence of formulas: (fl , D, R, f4, f5, f6): fl: p --- premise (hypothesis) f2: p -+ r --- premise
nl tt.t/. l_mDr IJ: r f4: fl n f3: p r (conjunction ofthe conclusions) ^ f5: p Ar -+ q --- premise f4, f5l-rroq f1

f6: q

The sequence

(fl' f2, g, f4, f5, f6) is the deduction of q p_>r,pAr_)q,p.

r,

from the premises

Step3: From the deduction p -+

p l- q we apply three times the theorem of deduction. 3!:6 such possibilities (to move the premises to the right side of the metasymbol l_ ) and we prove 6 theorems: T1,T2,T3,T4,T5, T6. 1. the order of moving the premises to the risht sicle is; pAr
q,

-)

There are

PAr)q, p_+r if p -+ r, p Ar ) Q, pl-4 then

P,

p)r,pAr-)ql_p_>q then p -> r l(p r,r + q) + (p _) q) then l* T1 = (p --> r) -+ ((p A r -+ q) -+ (p + q))___ the theorem to be proved.
the order of moving the premises to the right side is;

2.

P, Plr, pAr-)q if p -+ r, p Ar ) Q, pl-q then p)r,pAr-+ql_p_>q then

p Ar

(p -> r) _+ (p _+ q) then l- T2 = (p n r -+ q) -+ ((p -> r) _+ (p _+ q y

q l-

-)

There can be also obtained the following theorems: lT3 = (p n r + q) -> (p _+ ((p _+ r) _+ q))) l-74 = p -> ((p Ar -) q) -+ ((p _+ r) _+ q)) l- Z5 = (p -+ r) -) (p + ((p r,r _+ q) _+ q))

l-76

p -+ ((p

-->

r) -+ ((p nr

q)

))

t,

Propositional logic, MFCS -2010, Mihaiela Lupea

The properties

of

propositional logic are: compactness, soundness, completness,

coherence, noncontradictory and decidabiliry.

Theorem 5. (compactness 1) An infinite sef of propositional formulas has a model if and only if each of its subsefs has a finite model. Theorem 6.
Let

S:{[J1,U2,...,U.,...] b, an infinit set ofpropositionalformula. 1. S zs inconsistent if and only if !,t e N*, such that {UrU2,...,(Jk}

is inconsistent.

2. S is consistent if and only tf { Ur } zs consistent und trJt,LIz]t is consistent und {rJt,Uz,...,U rr} is consistent und
Remarks:'

An infinite set of propositional formulas is inconsistent if and only if has an

inconsistent finite subset. This can be proved in a finite number of steps.

. An infinite set of propositional formulas is consistent if and only if all its

subsets (an infinite number) are consistent. This can't be proved in a finite
number of steps.

Theorem 7. (compactness 2) A propositional formula y is a logical consequence of an infinite sef of propositional formulas S ( S l= V ) if and only if there is a finite subsef of S;
{Ut,tJz,...,U r) c S such that U1,(J2,...,(Jrl=
V.

Soundness theorem (syntactic validity implies semantic validity):

If
If

l- U then l:

U (A theorem is a tautology).
:

Co'mpletness theorem (semantic validity implies syntactic validity) l=U then l-

(A tautology is a theorem).

Theorem of soundness and completness for propositional logic: l- u if and only if 1:u .
Consequences of this theorem are the following properties: The propositional logic is noncontradictory: we can't have simultaneously

o o .

l-U
The

and
I

U.

propositional logic is coherenf: not every propositional formula is a theorem. The propositional logic is decidable: we can decide if apropositional formula is a theorem or nol The truth table method is a decision method.
I
L.t