• Keine Ergebnisse gefunden

Let F be a formula in monadic first-order logic containing npredicatesP1

N/A
N/A
Protected

Academic year: 2021

Aktie "Let F be a formula in monadic first-order logic containing npredicatesP1"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Dr. D. Frettl¨oh 17.12.2019

Formal Logic — Exercise Sheet 10

Exercise 37: (Undecidable problem II: Mortal Matrices)

Decide which of the following sets of matrices are sets of mortal matrices. Give either an example for a product yielding the zero matrix, or give a convincing reason why this is not possible.

(a)A1= 1 10 1

,A2= 1 01 1

,A3= 0 11 0 . (b) B1 = −2 21 −1

,B2 = 01 0−1

,B3 = 2 00 1 . (c) C1 = 1 21 2

,C2= 11 0−1

,C3 = 1 01 1 .

Exercise 38: (Undecidable problem III: Wang tiles)

For each of the two collections of four Wang tiles below, prove that they can tile the plane (according to the rules: squares are placed vertex-to-vertex, adjacent edges carry the same colour, tiles are not rotated or reflected), or show that there is no such tiling.

Exercise 39: (Decidable first-order logic)

Monadic first-order logic is first-order logic without function symbols, and where all predicates have only one input. Let F be a formula in monadic first-order logic containing npredicatesP1, . . . , Pn. (a) Show that if F is satisfiable, then there is a model A = (UA, IA) for F such that UA has 2n elements. (Hint: identify elements in UA with respect to their values inP1A, . . . , PnA.)

(b)Use (a) to show that the problem “is a given formula F in monadic first-order logic satisfiable” is decidable.

Exercise 40: (Violate the Peano axioms!)

Peano axioms refers here to the Peano axioms in the lecture notes on page 37.

(a)Find a structure satisfying all Peano axioms except number 1.

(b) Find a structure satisfying all Peano axioms except number 6.

(c) Find a structure satisfying all Peano axioms except number 2.

You may tweak anything, e.g. UA ={0,1,2,3} rather than UA =N0, or f(x, y) = 2x−y rather than x+y.

Hand in your solutions until 6.1.2020 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

Atomic formulas are obtained using the relation symbols on terms of the logic. a domain, a concrete interpretation for each constant and function/relation symbol) and an assignment

We say that a class C of finite τ -structures is definable in Datalog 1 if there exists a Datalog program Π with a distinguished predicate nullary goal such that Π derives goal on

To prove our results, we show that every class C in GSO whose complement is closed under homomorphisms is a finite union of constraint satisfaction problems (CSPs) of

In the presence of equality, we can show the undecidability of satisfiability of GFU (and hence of TGF ) by a reduction from the tiling problem for an infinite grid [7]..

To cope with the notorious problem of self-justifying cycles, we use tech- niques known from translations of normal logic programs to logical theories: cyclic fluent dependencies in

The main points are (a) a fully general application of Carnap’s method of extension and inten- sion, whereby each expression has an extension in each case, and an intension that is

A Proof System for Higher-Order Logic 4.1 Methods and Rules.. 4.2 Rewriting

We exploit that, in contrast to (ω, <), the weak MSO theory of the binary tree is simpler than its unrestricted MSO theory, and show, using decompositions of weak MSO formulas,