Scribd
Upload
24 views6 pages

Mathematical Logic

Uploaded by

amina.rahil.123
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views6 pages

Mathematical Logic

Uploaded by

amina.rahil.123
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

1

Chapitre 1

Mathematical logic

For more details, please see the following links :


– http ://blparc.fr/lib/exe/fetch.php ?media=mat813 :cours :14hk_01_logique.pdf
– https ://www.siue.edu/~jloreau/courses/math-223/notes/intro-proofs-
book.pdf
– https ://math.unice.fr/~frapetti/analyse/Logique.pdf
– http ://exo7.emath.fr/cours/ch_logique.pdf
– https ://www.univ-usto.dz/images/coursenligne/AL_MS.pdf
– https ://fr.wikipedia.org/wiki/Logique_et_raisonnement_math%C3%A9matique
– https ://www.youtube.com/watch ?v=aWSe1fjJHEM
– https ://www.youtube.com/watch ?v=B-I5yZd0Wbk

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.

1.1.1 De…nition of "The logic"


Mathematical Logic :
1. Is interested in studying “true”or “false”propositions using symbols.
2. Gives methods for proving a mathematical proposition.
3. Justi…es the steps and logical sequence during the demonstration.
4. Distinguishes between the data of a mathematical problem and what
is asked to be proved.

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 )

1.2 Logic Connectors


Mathematical statementes are constructed by combining two or more
propositions using logical connectives.

3
1.2.1 Logical connectives « and » and « or »

Let P and Q be two propositions. We de…ne :


1. The Conjunction : it is the proposition "P and Q" that we denote
P ^ Q : It is true if P and Q are both true.
2. The Disjunction : it is the proposition "P or Q" that we denote P _Q :
It is false if P and Q are both false.
Hence the following tables of truth :

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 )

1.2.2 Implication and logical Equivalence


Let P and Q be two propositions. We de…ne :
1. Implication : it is the "P _ Q" proposition that is noted (P =) Q).
It is false if P is true and Q is false.
2. Equivalence : it is the "P =) Q^Q =) P " proposition that is noted
(P () Q):It is true if P and Q are both true or both false.
Hence the following tables of truth :

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

Remark "() " means if and only if (i¤ ).

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

Remark A predicate can be written according on multiple variables :


P (x; y); P (x; y; z)::::

Example :

P (x; y) : x+y =2
– P (5; 3):::::(T )
– P (0; 1)::::(F )

1.3.1 Universal Quanti…er


If for every x of E, the proposition P (x) is true, then we write :
8x 2 E; P (x):

Examples :

– P (x) : 8x 2 R : x2 + 1 > 0::::(T )


– P (x) : 8x 2 Z : x 5 0::::::(F )

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 )

1.3.3 Quanti…er negation


– (9x 2 E; P (x)) () (8x 2 E; P (x))
– (8x 2 E; P (x)) () (9x 2 E; P (x))
Examples :
–
P (x) : 9x 2 R : x(x 4) = 0:::(T )
, P (x) : 8x 2 R : x(x 4) 6= 0:::(F )
–
P (x) : 8x 2 Z : x 5 0:::(F )
, P (x) : 9x 2 Z : x 5 > 0:::(T )

1.3.4 Quanti…ers with two variables


If P (x; y) is a proposition that depends on two parameters x and y, then
we can swap two quanti…ers of the same nature, but we can never swap two
quanti…ers that are not of the same nature.
Examples :
1. (8x 2 R;8y 2 R : x2 + y 2 0) ,(8y 2 R;8x 2 R : x2 + y 2 0)

2. (8x 2 R;9y 2 R : y = ex ):::(T ) but (9y 2 R; 8x 2 R : y = ex ):::(F )

You might also like