Scribd
Upload
20 views

Logic 0304

This exam contains 9 assignments testing logic concepts including propositional logic, predicate logic, natural deduction, semantic tableaux, and model theory. Students are provided an auxiliary sheet with important formulas and are instructed to show their work clearly in answers involving semantic tableaux or natural deduction derivations. Assignments include truth tables, semantic tableaux proofs, natural deduction proofs, translating between logical forms, writing sentences as logical formulas, and model-theoretic questions.

Uploaded by

apaleharold
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

Logic 0304

This exam contains 9 assignments testing logic concepts including propositional logic, predicate logic, natural deduction, semantic tableaux, and model theory. Students are provided an auxiliary sheet with important formulas and are instructed to show their work clearly in answers involving semantic tableaux or natural deduction derivations. Assignments include truth tables, semantic tableaux proofs, natural deduction proofs, translating between logical forms, writing sentences as logical formulas, and model-theoretic questions.

Uploaded by

apaleharold
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Universiteit Maastricht

Faculty of General Sciences


Knowledge Engineering

Exam

Logic
June 2004

This exam is NOT an open-book exam.


You will get an auxiliary sheet with the most important formulas.

Clarify all your answers sufficiently!


Indicate in semantic tableaux exactly which reduction rules you are using.
In the case of derivations, indicate exactly from which formula(’s) each formula is
derived and if the conditions are met (if applicable).

This exam contains 9 assignments. For each assignment will be indicated the
maximum amount of points that you can obtain for a right answer. The exam mark is
the number of points for all assignments together, divided by 10.

1. (10 points)
About the students Kees and Jan we know the following:
i. If Kees passes his Logic exam, Jan will also pass his Logic exam.
ii. If Jan passes his Logic exam, Kees will pass his Software Engineering exam.
iii. Kees will pass his Logic exam or his Software Engineering exam, but not both.

Will Jan pass his Logic exam?


Will Kees pass his Software Engineering exam?
Determine the answer to these questions (yes or no) with the aid of a truth table
(model elimination).

2. Semantic tableaux propositional logic. (12 points)


a. Explain the →R reduction rule.
b. Given is the consequence p ∧ (q ∨ r) / (p ∧ q) ∨ (p ∧ r) . Investigate the
validity of this consequence with the aid of a semantic tableau. If this
consequence is not valid, give all the counterexamples.
c. Investigate by means of a semantic tableau whether the formula
(p→ q) ∨ (q → p) is a tautology.

3. Prove by means of natural deduction (propositional logic) (12 points).


Prove by means of natural deduction:
a. (p ∧ q) → r, s → p, t → q ├─ (s ∧ t) → r
b. p ∨ q, p → r, r → s, q → t ├─ s ∨ t
c. r → ¬p ├─ ¬(p ∧ r)

4. (10 points)
Translate the following formula into an equivalent formula in prenex form:
((∃y R(x,y)) → (∀x S(x,y))) → ((∃x T(x,y)) ∨ (∀y U(x,y)))
5. (12 points)
Consider the domain of people, with the following predicates:
Oxy means that x is a parent of y, Vx means that x is a woman and Lxy means that
x loves y. The predicate = may also be used.
Also, j, a and m are constants that stand for Jan, Ans, and Marie.
Now write each of the following sentences as a formula of predicate logic:
a. Ans and Marie are women, but Jan is not.
b. Jan has precisely one sister.
c. Everyone who has precisely one sister, loves that sister.

6. Semantic tableaux predicate logic. (12 points)


a. Explain the ∀L reduction rule.
b. Prove by means of a semantic tableau that
∃x Ax, ∀x∀y (¬Ax ∨ Cy) ╞═ ∀x Cx
c. The following consequence is not valid: ∃x Ax, ∃x∀y (¬Ax ∨ Cy) / ∀x Cx.
Construct by means of a semantic tableau a counterexample for this consequence.

7. (12 points)
a. Explain the ∀I rule. Why is the condition essential?
Prove with the aid of natural deduction:
b. ∀x∀y (Ax ∨ By) , ∀x ( Ax → Cx) , ∀x ( Bx → Cx) ├─ ∀x Cx.
c. ∀x ∀y (Ax → Bxy), ∃x Ax ├─ ∃x ∀y Bxy.

8. (10 points)
Consider the collection of those formulas from the propositional logic which
contain only the connective ∧ (that is: ¬, ∨, → and ↔ do not occur). Let p be a
given proposition letter.
Prove with the aid of formula induction that for all these formulas ϕ holds:
if p occurs in ϕ then it holds that ϕ ├─ p.

9. (10 points)
a. Given the model M = (D,I) consisting of the structure D = 〈R, <, 0, 1,*, +〉 and
the interpretation function I, so that I(R) = <, I(a) = 0, I(b) = 1, I(f) = + and
I(g) = *.
i. Show that M ╞═ ∃x ∀y R(x, f(g(y,y),b)) .
ii Given the formula ϕ = ∀y R(x, f(g(y,y),b)). For which look-up table(s) is this
formula true in M?
b. The formula (∃x ϕ ∧ ∃x ψ) → ∃x (ϕ ∧ ψ) is not universally valid.
Give formulas ϕ, ψ, a model and (if necessary) a look-up table for which
VM,b((∃x ϕ ∧ ∃x ψ) → ∃x (ϕ ∧ ψ) ) = 0.

You might also like