• Keine Ergebnisse gefunden

SS 2013 8. Mai 2013 In-class Exercises to the Lecture Logics Sheet 2 Jun.-Prof. Dr. Roland Meyer Discussion on 10. Mai 2013 Exercise 2.1 [Inconsistency] Show that Σ $

N/A
N/A
Protected

Academic year: 2021

Aktie "SS 2013 8. Mai 2013 In-class Exercises to the Lecture Logics Sheet 2 Jun.-Prof. Dr. Roland Meyer Discussion on 10. Mai 2013 Exercise 2.1 [Inconsistency] Show that Σ $"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

SS 2013 8. Mai 2013 In-class Exercises to the Lecture Logics

Sheet 2

Jun.-Prof. Dr. Roland Meyer Discussion on 10. Mai 2013 Exercise 2.1 [Inconsistency]

Show that Σ $ F

0

A if and only if Σ Yt A u is inconsistent. You can use the Deduction Theorem and the given theorems 1–11 from the old slides.

Exercise 2.2 [Derivations in F 0 ]

Present proofs in F 0 for the following formulae:

a) p A Ñ B q Ñ p B Ñ A q . You can use the Deduction Theorem and the given theorems 1–7 from the old slides.

b) B Ñ p C Ñ p B Ñ C qq . You can use the Deduction Theorem and the given theorems 1–8 from the old slides.

Exercise 2.3 [Completeness of F 0 ]

Prove Lemma 1.24 on the old slides: Let A A p p 1 , . . . , p n q P F , n ¡ 0, where p 1 , . . . , p n are the propositional variables occurring in A. Let ϕ be a valuation. If

P i :

#

p i , if ϕ p p i q 1,

p i , if ϕ p p i q 0, A 1 :

#

A, if ϕ p A q 1, A, if ϕ p A q 0,

for 1 ¤ i ¤ n, then P 1 , . . . , P n $ A 1 . You can use the Deduction Theorem, the given theorems 1–11 from the old slides, and Exercise 2.1.

Exercise 2.4 [Completeness of calculi]

Let K p Ax, R q be the calculus where R contains only Modus Ponens and Ax is given by just one axiom scheme, namely p A Ñ B q Ñ p B Ñ A q .

a) Show by induction on n that for each proof B 0 , . . . , B n and each i P t 0, . . . , n u , the following holds: The number of occurrences of each propositional variable p in B i is even.

b) Conclude that in K, not every tautology is derivable (even if it contains only and

Ñ as connectives).

Referenzen

ÄHNLICHE DOKUMENTE

A context-free grammar is called linear if in each rule, the right-hand side contains at most one occurrence of a nonterminal symbol.. Exercise

Note: Hence, you have shown that completeness means that the theory cannot be extended consistently in two ways that contradict

b) In Exercise 1.3 you saw that it is possible to construct an equivalent formula in DNF for any given formula. Explain why the following is not an efficient algorithm for

A set M is called recursively enumerable, if there is an algorithm that outputs a (possibly infinite) sequence in which each element occurs if and only if it is contained in M.

Mai 2012 In-class Exercises to the Lecture Logics.

[r]

Smullyan’s ball game is played by one player according to the following rules: There is a container that has capacity for an unlimited number of balls.. Furthermore, there is

[r]