Scribd
Upload
48 views2 pages

TS3 Math Logic

Uploaded by

Mustapha Labarga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
48 views2 pages

TS3 Math Logic

Uploaded by

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

DJILLALI LIABES UNIVERSITY OF SIDI BEL ABBES

FACULTY OF EXACT SCIENCES


DEPARTMENT OF COMPUTER SCIENCE

Subject: Mathematical Logic TUTORIAL SERIES N O 3 L2 – 2024/2025

LOGICAL CONSEQUENCE, SYNTACTIC PROOF SYSTEMS AND ROBINSON


RESOLUTION PRINCIPLE

Exercise n°1: We consider the set of propositional formulas

F = { (p ∨ q ∨ r ), (p → q ), (q → r )}

1) Is F consistent? If so, identify its models.

2) Are the formulas ( q → p ) , p, and r logical consequences of F ?

Exercise n°2: Let two sets of WFFs

F1 = {(p → (q ∨ r)), ((¬q) → r)} and F2 = {(p → r), ((¬q) → r)}

Show that F 1 and F 2 are equivalent.

Exercise n°3: According to the Hilbert deduction system consisting of the following axioms:

(Ax1) ( X 1 → ( X 2 → X 1 )) ;

(Ax2) (( X 1 ∧ X 2 ) → X 1 ) or (( X 1 ∧ X 2 ) → X 2 ) ;

(Ax3) ((X1 → X2) → ((¬X2) → (¬X1))) or (((¬X1) → (¬X2)) → (X2 → X1));

Prove the following assertions:

1) (¬B) F-H (B → A)

2) (A → (B → C)), A, (¬C) F-H (¬B)

3) ( A → ( B → C )) , ( A ∧ B ) IH C

Exercise n°4: Prove the following propositions using Natural Deduction System:

1) A, ( A → B ) I N ( A ∧ B )

2) (( A ∧ B ) → C ) , ( B → A ) ,B I N C

3) ( A → B ) , ( B → C ) HN ( A → ( B ∧ C ))
4) ( A ∨ ( B ∧ C )) F N ( A ∨ B )

Page 1 of 2
Exercise n°5: Give the CNF (Conjunctive Normal Form) and DNF (Disjunctive Normal Form) of the
following WFFs:

1. ¬ ( ( ( ¬A ∨ B → C ∧ D
) ) ( ) )

2. ( ( ¬ A → B ( ) ) ∨ A ∧ B ( ) )

3. ( A ∨ B → A ∧ B )
( ) ( )

4. (A → B ∨ B → C )
( ) ( )

Exercise n°6: Determine, in the following cases, whether the formulas are valid by applying the refu -
tation algorithm:

1 ) ( ( ( A→B ∧ A∨C ) ( ) ) → B ∨C( ) )

2 ) ( ( ( A → B ∧ A → C ) ( ) ) → B ∧ C ( ) )

3 ) ( ( ( A→B ∧A →B ) ) )

Exercise n°7:

1 . Translate the following hypotheses ( H 1 ) , ( H 2 ) , ( H 3 ) and conclusion ( C ) into logical WFFS:

(H1)If there is a network failure, the servers generate error logs .


(H2)The IT team is alerted when error logs are generated and there is a network failure .
(H3)There is a network failure.
( C ) Therefore, the IT team is alerted.

2. Study the validity of this reasoning using the truth table and Robinson’s resolution principle.

Exercise n°8: Three students A, B and C are accused of introducing a virus in the school lab. During
the interrogation they make the following claims:

(H1) Ali says: “Bouchra did it and Sarah is innocent”.

(H2) Bouchra says: “If Ali is guilty then Sarah is guilty too”.

(H3) Sarah says: “I did not do it. Either Ali or Bouchra did it”.

Find the guilty amoung these three students based on this interogation using the truth table method
and Robinson’s resolution principle.

Page 2 of 2

You might also like