Logical Equivalence

we that two formulas Fund G logically

say
→
are

equivalent
F = G if f- FFG and G FF

→
Logical Equivalence is
↳ Reflexive F
F ≠
↳ symmetric
↳ Transitive if F _=G then G = F

;f F ≤ G and G _=H then F=_ H

Logical Equivalence in

•
Negations and Quantifiers
→ let P be a
predicate symbol ,
then

TE se P (a) = You PC a)

- it a Pln) = In TPC a)
•

Conjunctions and duantifiers

→ Let P and I be predicate symbols then ,

In ( Pln) NOM) ltnplanvndln) =

3- ( Pln) now) ≠ 3- Play a 3- now

a n
•
Disjunctions and duantifiers
In ( Pln) ✓ Qtr)) ≠ Vm Play ✓ it now

3- a ( Pln) ✓ Qtr)) = 3- xp / a) ✓ 3- now

Renaming variables

→
we can replace a
quantified variable with another
variable that does not appear in its scope by also
replacing all free occurrences the quantified
of
variable in the sub formula Fla) with the new variable
g
e.

In
-
( Pln
-
,
z ) → Fndcx) ) =
Ky ( Ply E) ,
→ 3- xD (a) )
- -

Prenex Normal Form ( PNF )

→ A formula is said to be in PNF if all of its
quantifiers appear at the front followed
by a

quantifier free formula

Q ,
X, dzsez - -
- -
In Nn F (R , ,
. _ _

,
Rn )

Quantifiers Quantifier - Free

where di 02 , ,
. -
-

s In C-
{ It 7
, } and M, - .
-

, %
c-
Vars
→
Every Predicate Formula F can be rewritten
as a
logically equivalent formula in PNF

Deduction Rules For Quantifiers

→ Universal Instantiation or t elimination rate

V-EE.SI CUI)

where a can be a previously used constant or

a fresh constant that we must mark as
arbitrary
→ Universal Generalisation or introduction rule

v.EE# ( UG )

where must be marked

a as
arbitrary
→ Existential Instantiation or t elimination rule

3-7=4%1 ( EI)

where a must be a fresh constant

symbol

→ Existential Generalisation or it introduction rule

zɥ ( EG )

be
any constant symbol
where a can

→
Identity Introduction
term t itself with no preconditions
every is equal b-
(I
¥
→
Identity Elimination

we can substitute identical terms

ᵗ=¥n%; ⇐
 Soundness
Ft G - F 1--6
semantics
Syntax - C truth)
[ Proof )
completeness
soundness detection tells us that we dont need to show
an infinite number of models but
just a single natural
,

deduction proof from the data .

Completeness delineation tells us that to show that

something is not provable ,
we
just need to show
a
single instance of when it is not
provable