Problem 1A
Let signature Σ={+,s,f,0} consist only of function symbols, and let + be binary, s and f unary, 0 constant. In the algebra A=⟨A,+A,sA,fA,0A⟩ the function fA is said to be periodic, if there existsk∈A, k≠0A such tha tfor every x∈A holds fA(x+k)=fA(x).
fA is standard periodic, if there exists k=sA(…sA(0A)…) such that for each x∈A holds fA(x+k)=fA(x).
For each of the following classes of structures determine, if it is
i) axiomatisable by a single sentence
ii) axiomatisable by a set of sentences, but not by a single sentence
iii) is not axiomatisable by any set of sentences
1. The class of structures A=⟨A,+A,sA,fA,0A⟩ over Σ, in which fA is periodic
2. The class of structures A=⟨A,+A,sA,fA,0A⟩ over Σ, in which fA is standard periodic
3. The class of structures A=⟨A,+A,sA,fA,0A⟩ over Σ, in which fA is not standard periodic
Problem 2A
We work with the class of directed graphs (self-loops are permitted). Give an example of two such graphs G1 and G2 such that:
1. For each graph H with at most 7 vertices, G1 contains an induced subgraph isomorphic to H if and only if G2 contains an induced subgraph isomorphic to H.
2. Player I has a winning strategy in the game G7(G1,G2).
Problem 3A
We consider the structure
P=⟨R3,BP⟩, where the relation BP is 3-ary and defined as follows:
BP(a,b,c) holds if and only if a,b,c are all different and collinear, and moreover b belongs to the line segment connecting a and c.
Write a first-order formula φ such that
(P,x1:a1,x2:a2,x3:a3,x4:a4)⊨φ if and only of the points a1,a2,a3,a4 lay on a common plane.