Mathematical Logic
Mathematical Logic
Chapitre 1
Mathematical logic
2
1.1 De…nitions
De…nition 1 We call assertion or proposition (P; Q; R; :::) any mathe-
matical statement that can be judged as true (T ) or false (F ).
Example :
– (P1 ) : 2 N; ::::::(F )
– (P2 ) : 5 is a prime number.......(T )
– (P3 ) : x + 1 = 0 is not a proposition because it cannot be judged.
Negation of a proposition
Any Proposition P admits a negation noted P (not P ). If P is true, P is
false and if P is false P is true. Hence, the following table of truth :
P P
T F
F T
Examples :
1
1. P : 2 N:::(F ) ! P : 12 2
2
= N::::(T )
p p
2. Q : 16 = 4:::(T ) ! Q : 16 6= 4:::(F )
3
1.2.1 Logical connectives « and » and « or »
P Q P ^Q P Q P _Q
T T T T T T
T F F ; T F T
F T F F T T
F F F F F F
Example :
1- (5 is a prime number) ^ ( 52 = 3)::::(F )
2- (5 is a prime number) _ ( 25 = 3)::::(T )
P Q P =) Q P Q P () Q
T T T T T t
T F F ; T F F
F T T F T F
F F T F F t
4
Properties :
–P ,P
– P ^ (Q _ R) , (P ^ Q) _ (P ^ R)
– P _ (Q ^ R) , (P _ Q) ^ (P _ R)
–P ^Q,P _Q
–P _Q,P ^Q
–P )Q,P _Q,P ^Q,P ^Q
– (P ) Q) , (Q ) P )
1.3 Quanti…ers
We give a set E and P (x) a proposition dependent on a parameter x of
E. P (x) is called a predicate or open sentence and can be true or false
depending on the value of x.
Example :
P (x) : x 1; x2R
– If x 2 ] 1; 1] ; P (x) is True
– If x 2 ]1; +1[ ; P (x) is False
Example :
P (x; y) : x+y =2
– P (5; 3):::::(T )
– P (0; 1)::::(F )
Examples :
5
1.3.2 Existential Quanti…er
If there exists at least one element x of E such that the proposition
P (x) is true, then we write :
9x 2 E; P (x):
Examples :
– P (x) : 9x 2 R : x(x 4) = 0:::::(T )
– P (x) : 9x 2 Z : x + 12 = 0:::::::(F )
Remark if there is only one element x of E such that the proposition
P (x) is true, then it is written :
9!x 2 E; P (x):
Examples :
– P (x) : 9!x 2 R : x + 2 = 0:::::(T )
– P (x) : 9!x 2 R : x2 1 = 0:::::(F )