• Keine Ergebnisse gefunden

∀x ¬Q(x)∨Q(f(x)) and apply the resolution calculus

N/A
N/A
Protected

Academic year: 2021

Aktie "∀x ¬Q(x)∨Q(f(x)) and apply the resolution calculus"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Dr. D. Frettl¨oh 3.12.2019

Formal Logic — Exercise Sheet 8

Exercise 29: (Drinker paradox)

In each (nonempty) pub there is someone such that, if this person is drinking, then everyone in the pub is drinking.

Translate the statement above into a formulaF in first-order logic. Prove that it is valid by showing that¬F is unsatisfiable. That is, establish the Skolem normal form of¬F and apply the resolution calculus to it.

(Hence this is not really a paradox, it only sounds like one.)

Exercise 30: (I can’t get no satisfaction) Establish the Skolem normal form of

F =∀x P(x)∨Q(x)

∧ ∀x ¬Q(x)∨Q(f(x))

and apply the resolution calculus. IsF satisfiable?

Exercise 30: (Barber paradox)

In a remote small town there are two strict rules for barbers:

1. Each barber shaves all those who do not shave themselves.

2. No barber shaves someone who shaves himself.

Show that there is no barber in this town, by translating 1. and 2. and “there is a barber”

into formulasF,Gand H in first-order logic and use the resolution calculus in order to show that F∧G∧H is unsatisfiable. (Hint: use one predicate for “x is barber” and another one for “x shaves y”. This one is indeed a paradox.)

Exercise 32: (Infinite models)

Prove that there are formulas having infinite models only. That is:

(a)Show that F =∀x P(x, f(x))∧ ∀y ¬P(y, y)∧ ∀x∀y ∀z (P(x, y)∧P(y, z)⇒P(x, z) is satisfiable by finding a model forF.

(b)Show that F is not satisfiable for anyA= (UA, IA) whereUA is finite.

Hand in your solutions until 9.12.2019 at 11:00 in post box 2183 in V3, or via email to your tutor.

Tutors: Oliver Tautz otautz@techfak.uni-bielefeld.de Wed 8-10 Jonas Kalinski jkalinski@techfak.uni-bielefeld.de Tue 16-18

Referenzen

ÄHNLICHE DOKUMENTE

Betrachte Beispiel 3.12 von Folie 169, die Arithmetik der

Die Aussage des Taylorschen Satzes ist, dass sich fast jede elementare Funktion in der Umgebung eines Punktes x 0 durch Polynome beliebig genau ann¨ ahern l¨ asst.. Neben der

[r]

Numerical Algorithms for Visual Computing III 2011 Example Solutions for Assignment 51. Problem 1 (The

Rate eine Nullstelle x 1 als Faktor des

1 Entscheide, ob die Aussagen für Figur und Bildfigur einer zentrischen Streckung wahr oder falsch sind.. Aussage Wahr

[r]

b) Realisieren Sie die Funktion unter ausschließlicher Verwendung von 1-aus-2-Multiplexern, und zwar so, dass die Eingänge ausschließlich mit den Konstanten 0 und 1 beschaltet sind..