Part II

Part II. Mathematical Logic

[425/81%]
Show
LaTeX
Problem II.1.1

Determine whether the given sequence is a formula:

?
(a)

(P0&P1)P2¬P3(P_{0} \& P_{1}) P_{2} \neg P_{3};

(b)

(P0&P1)⊃P2(P_{0} \& P_{1}) \supset P_{2};

(c)

((P3⊃P0)&¬P0)((P_{3} \supset P_{0}) \& \neg P_{0});

(d)

(((¬P0)⊃P1)⊃¬(P2∨P3))(((\neg P_{0}) \supset P_{1}) \supset \neg (P_{2} \vee P_{3})).

Problem II.1.2

In how many ways can parentheses be inserted into the following sequence so as to obtain a formula:

?
(a)

P0⊃¬P1∨P2&P0P_{0} \supset \neg P_{1} \vee P_{2} \& P_{0};

(b)

P1⊃P2⊃P3⊃¬P1⊃¬P2P_{1} \supset P_{2} \supset P_{3} \supset \neg P_{1} \supset \neg P_{2}?

Problem II.1.3

Write out all subformulas of the formula:

?
(a)

(((P0⊃P1)&(P2⊃P3))⊃(¬P1∨P3))(((P_{0} \supset P_{1}) \& (P_{2} \supset P_{3})) \supset (\neg P_{1} \vee P_{3}));

(b)

((P0⊃P1)⊃((P0⊃¬P1)⊃¬P1))((P_{0} \supset P_{1}) \supset ((P_{0} \supset \neg P_{1}) \supset \neg P_{1})).

Problem II.1.4

Prove that every formula CC that is not a propositional variable can be represented in one of the following forms: ¬A\neg A, (A&B)(A \& B), (A∨B)(A \vee B), (A⊃B)(A \supset B) for some formulas AA and BB.

?
Problem II.1.5

Prove that the result of replacing a given occurrence of the formula CC in the formula AA, in place of a subformula BB, is again a formula.

?
Problem II.1.6

Prove that the result of the substitution A(P\B)A(P \backslash B) of the formula BB for the propositional variable PP in the formula AA is again a formula.

?
Problem II.1.7

Construct the truth tables for the following formulas:

?
(a)

((P⊃Q)∨(P⊃(Q&P)))((P \supset Q) \vee (P \supset (Q \& P)));

(b)

(¬(P⊃¬(Q&P))⊃(P∨R))(\neg (P \supset \neg (Q \& P)) \supset (P \vee R));

(c)

((P&(Q⊃P))⊃¬P)((P \& (Q \supset P)) \supset \neg P);

(d)

(((P&¬Q)⊃Q)⊃(P⊃Q))(((P \& \neg Q) \supset Q) \supset (P \supset Q));

(e)

((P⊃(Q⊃R))⊃((P⊃Q)⊃(P⊃R)))((P \supset (Q \supset R)) \supset ((P \supset Q) \supset (P \supset R)));

(f)

((P&(Q∨¬P))&((¬Q⊃P)∨Q))((P \& (Q \vee \neg P)) \& ((\neg Q \supset P) \vee Q)).

Problem II.1.8

Prove the satisfiability of the formulas:

?
(a)

¬(P⊃¬P)\neg (P \supset \neg P);

(b)

((P⊃Q)⊃(Q⊃P))((P \supset Q) \supset (Q \supset P));

(c)

((Q⊃(P&R))&¬((P∨R)⊃Q))((Q \supset (P \& R)) \& \neg ((P \vee R) \supset Q)).

Problem II.1.9
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)
(l)
(m)
(n)
(o)
(p)
(q)
(r)
(s)
(t)
(u)
Problem II.1.10

For which values of the variables X,Y,Z,U,V,WX, Y, Z, U, V, W are the following formulas false:

?
(a)

(((X⊃(Y&Z))⊃(¬Y⊃¬X))⊃¬Y)(((X \supset (Y \& Z)) \supset (\neg Y \supset \neg X)) \supset \neg Y);

(b)

((X&Y)∨(X&Z)∨(Y&Z)∨(U&V)∨(U&W)∨(V&W)∨(¬X&¬U))((X \& Y) \vee (X \& Z) \vee (Y \& Z) \vee (U \& V) \vee (U \& W) \vee (V \& W) \vee (\neg X \& \neg U));

(c)

(((X∨Y)∨Z)⊃((X∨Y)&(X∨Z)))(((X \vee Y) \vee Z) \supset ((X \vee Y) \& (X \vee Z)));

(d)

(((X∨Y)&((Y∨Z)&(Z∨X)))⊃((X&Y)&Z))(((X \vee Y) \& ((Y \vee Z) \& (Z \vee X))) \supset ((X \& Y) \& Z));

(e)

((X∨Y)⊃((¬X&Y)∨(X&¬Y)))((X \vee Y) \supset ((\neg X \& Y) \vee (X \& \neg Y)))?

Problem II.1.11

Prove that if the formula AA is identically true, then the formula A(P\B)A(P \backslash B) is identically true. (Here PP is a propositional variable, and BB is a formula.)

?
Problem II.1.12

Prove that if the formulas AA and (A⊃B)(A \supset B) are identically true, then the formula BB is identically true.

?
Problem II.1.13

Prove that:

?
(a)

if the formulas (A∨B)(A \vee B) and (¬A∨C)(\neg A \vee C) are identically true, then the formula (B∨C)(B \vee C) is identically true;

(b)

if the formulas (A∨B)(A \vee B), (A⊃C)(A \supset C), (B⊃D)(B \supset D) are identically true, then the formula (C∨D)(C \vee D) is identically true;

(c)

if the formulas (¬A∨B)(\neg A \vee B), (¬C∨¬B)(\neg C \vee \neg B) are identically true, then the formula (A⊃¬B)(A \supset \neg B) is identically true.

Problem II.1.14

Prove that A∼BA \sim B if and only if A≡BA \equiv B is identically true.

?
Problem II.1.15

Prove that:

?
(a)

A∼AA \sim A;

(b)

A∼B⇒B∼AA \sim B \Rightarrow B \sim A;

(c)

(A∼BA \sim B and B∼CB \sim C) ⇒A∼C\Rightarrow A \sim C.

Problem II.1.16

Prove that A1∼A2A_{1} \sim A_{2} and B1∼B2B_{1} \sim B_{2} imply:

?
(a)

¬A1∼¬A2\neg A_{1} \sim \neg A_{2};

(b)

(A1&B1)∼(A2&B2)(A_{1} \& B_{1}) \sim (A_{2} \& B_{2});

(c)

(A1∨B1)∼(A2∨B2)(A_{1} \vee B_{1}) \sim (A_{2} \vee B_{2});

(d)

(A1⊃B1)∼(A2⊃B2)(A_{1} \supset B_{1}) \sim (A_{2} \supset B_{2}).

Problem II.1.17

Prove that if A∼BA \sim B, then A(P\C)∼B(P\C)A(P \backslash C) \sim B(P \backslash C) for any formulas A,B,CA, B, C and variable PP.

?
Problem II.1.18

Prove that if B∼B1B \sim B_{1} and A1A_{1} is the result of replacing some occurrence of the subformula BB in the formula AA by the formula B1B_{1}, then A∼A1A \sim A_{1}.

?
Problem II.1.19
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
Problem II.1.20
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)
(l)
(m)
(n)
(o)
(p)
Problem II.1.21

Prove that:

?
(a)

(A≡A)∼(B≡B)(A \equiv A) \sim (B \equiv B);

(b)

(A≡(B≡C))∼((A≡B)≡C)(A \equiv (B \equiv C)) \sim ((A \equiv B) \equiv C);

(c)

(A≡B)∼(B≡A)(A \equiv B) \sim (B \equiv A).

Problem II.1.22

Prove that for every formula there exists an equivalent formula with tight negations, i.e., a formula in which the symbol ⊃\supset does not occur and negations apply only to propositional variables.

?
Problem II.1.23

Prove that for every formula there exists an equivalent:

?
(a)

conjunctive normal form;

(b)

disjunctive normal form.

Problem II.1.24

Reduce to disjunctive and conjunctive normal form:

?
(a)

(((P⊃Q)⊃(R⊃¬P))⊃(¬Q⊃¬R))(((P \supset Q) \supset (R \supset \neg P)) \supset (\neg Q \supset \neg R));

(b)

(((((P⊃Q)⊃¬P)⊃¬Q)⊃¬R)⊃R)(((((P \supset Q) \supset \neg P) \supset \neg Q) \supset \neg R) \supset R);

(c)

((P⊃(Q⊃R))⊃((P⊃¬R)⊃(P⊃¬Q)))((P \supset (Q \supset R)) \supset ((P \supset \neg R) \supset (P \supset \neg Q))).

Problem II.1.25

Prove that if AA is an identically true CNF, then for every disjunct of the formula AA there is a variable PP such that PP and ¬P\neg P both occur in this disjunct.

?
Problem II.1.26

Prove that if AA is an identically false DNF, then for every conjunct of the formula AA there is a variable PP such that PP and ¬P\neg P both occur in this conjunct.

?
Problem II.1.27

Let AA be a formula with tight negations (see Problem II.1.22), and let A1A_{1} be obtained from AA by replacing by ∨\vee, ∨\vee by , and the variables AiA_{i} by ¬Ai\neg A_{i}. Prove that A1∼¬AA_{1} \sim \neg A.

?
Problem II.1.28

Let AA and BB be formulas with tight negations (see Problem II.1.22), and let A∗A^{*}, B∗B^{*} be the formulas dual to AA and BB respectively (A∗A^{*} is obtained from AA by replacing by ∨\vee, ∨\vee by ). Prove that A∼BA \sim B implies A∗∼B∗A^{*} \sim B^{*} (the duality law).

?
Problem II.1.29

Given a set of values of the variables, construct a conjunct that is true only for this set of values of the variables. (Call such a formula the conjunct corresponding to the given set of values of the variables.)

?
Problem II.1.30

Prove that every formula AA is equivalent to the disjunction of the conjuncts corresponding to those sets of values of the variables for which the given formula is true (see Problem II.1.29).

?
Problem II.1.31
?
(a)

Prove that for every satisfiable formula there exists an equivalent p.d.n.f.

(b)

Prove that for an identically false formula there is no equivalent p.d.n.f.

Problem II.1.32

Given a set of values of the variables, construct a disjunct that is false only for this set of values of the variables. (Call such a formula the disjunct corresponding to the given set of values of the variables.)

?
Problem II.1.33

Prove that every formula AA is equivalent to the conjunction of the disjuncts corresponding to those sets of values of the variables for which the given formula is false (see Problem II.1.32).

?
Problem II.1.34
?
(a)

Prove that for every falsifiable formula there exists an equivalent p.c.n.f.

(b)

Prove that for an identically true formula there is no equivalent p.c.n.f.

Problem II.1.35

Reduce to perfect disjunctive normal form, i.e., find a p.d.n.f. equivalent to the given formula:

?
(a)

((¬P⊃¬Q)⊃((Q&R)⊃(P&R)))((\neg P \supset \neg Q) \supset ((Q \& R) \supset (P \& R)));

(b)

(((P⊃Q)⊃¬P)⊃(P⊃(Q&P)))(((P \supset Q) \supset \neg P) \supset (P \supset (Q \& P)));

(c)

(¬((P&Q)⊃¬P)&¬((P&Q)⊃¬Q))(\neg ((P \& Q) \supset \neg P) \& \neg ((P \& Q) \supset \neg Q)).

Problem II.1.36

Reduce to perfect conjunctive normal form, i.e., find a p.c.n.f. equivalent to the given formula:

?
(a)

((R⊃P)⊃(¬(Q∨R)⊃P))((R \supset P) \supset (\neg (Q \vee R) \supset P));

(b)

(¬((P&Q)⊃P)∨(P&(Q∨R)))(\neg ((P \& Q) \supset P) \vee (P \& (Q \vee R)));

(c)

(¬(P&(Q∨R))⊃((P&Q)∨R))(\neg (P \& (Q \vee R)) \supset ((P \& Q) \vee R)).

Problem II.1.37

Construct a formula AA such that the given formula is identically true:

?
(a)

(((A&Q)⊃¬P)⊃((P⊃¬Q)⊃A))(((A \& Q) \supset \neg P) \supset ((P \supset \neg Q) \supset A));

(b)

(((R⊃(¬Q&P))⊃A)⊃(A&(P⊃Q)&R))(((R \supset (\neg Q \& P)) \supset A) \supset (A \& (P \supset Q) \& R)).

Problem II.1.38

Construct a formula in three variables that is true if and only if exactly two of the variables are false.

?
Problem II.1.39

Construct a formula in three variables that takes the same value as the majority (minority) of the variables.

?
Problem II.1.40

Construct a formula AA in the variables P,Q,RP, Q, R such that:

?
(a)

(P&A)∼(P&Q)(P \& A) \sim (P \& Q) and (P∨A)∼(P∨R)(P \vee A) \sim (P \vee R);

(b)

(R⊃A)∼(R⊃(P&Q))(R \supset A) \sim (R \supset (P \& Q)) and (A⊃R)∼(¬(P∨Q)⊃R)(A \supset R) \sim (\neg (P \vee Q) \supset R);

(c)

(P⊃A)∼(Q⊃(¬P∨R))(P \supset A) \sim (Q \supset (\neg P \vee R)) and ((R⊃Q)⊃P)∼(¬P⊃¬A)((R \supset Q) \supset P) \sim (\neg P \supset \neg A).

Problem II.1.41

Prove that a formula in nn variables is identically true (identically false) if and only if its p.d.n.f. (p.c.n.f.) contains 2n2^{n} pairwise non-equivalent conjuncts (disjuncts).

?
Problem II.1.42

Let the formula AA be written in p.c.n.f. We construct a formula BB as follows:

  1. we write out the conjunction of the disjuncts not occurring in AA;

  2. we change to ∨\vee, ∨\vee to , PiP_{i} to ¬Pi\neg P_{i}, ¬Pi\neg P_{i} to PiP_{i}. Prove that the formula BB is a p.d.n.f. of the formula AA.

?
Problem II.1.43

From the p.c.n.f. of a formula AA, construct:

?
(a)

the p.d.n.f. A∗A^{*}, where A∗A^{*} is dual to AA (see Problem II.1.28);

(b)

the p.c.n.f. of the formula ¬A\neg A;

(c)

the p.d.n.f. of the formula ¬A\neg A.

Problem II.1.44

From the p.d.n.f. of a formula AA and the p.d.n.f. of a formula BB, construct:

?
(a)

the p.c.n.f. and p.d.n.f. of the formula (A∨B)(A \vee B);

(b)

the p.c.n.f. and p.d.n.f. of the formula (A&B)(A \& B);

(c)

the p.c.n.f. and p.d.n.f. of the formula (A⊃B)(A \supset B).

Problem II.1.45

Prove that a formula AA in the variables P1,…,PkP_{1}, \ldots , P_{k} is equivalent to some formula containing only , ∨\vee, ⊃\supset and not containing ¬\neg, if and only if its p.c.n.f. lacks the disjunct (¬P1∨…∨¬Pk)(\neg P_{1} \vee \ldots \vee \neg P_{k}).

?
Problem II.1.46

Let the formula AA contain no connectives other than ≡\equiv. Prove that AA is identically true if and only if every variable occurs in AA an even number of times.

?
Problem II.1.47

Let the formula AA contain no connectives other than ≡\equiv and ¬\neg. Prove that AA is identically true if and only if every variable and the negation sign occur in AA an even number of times.

?
Problem II.2.1

Show that to each formula AA of the algebra of propositions one can assign a function φ(A)\varphi (A) of the algebra of logic such that

A1∼A2⇔φ(A1)=φ(A2). A_{1} \sim A_{2} \Leftrightarrow \varphi (A_{1}) = \varphi (A_{2}).
?
Problem II.2.2

How many functions of the algebra of logic in nn variables are there?

?
Problem II.2.3

Find all essential variables of the following functions:

?
(a)

(y&x)∨(¬y&z)(y \& x) \vee (\neg y \& z);

(b)

(x&y)∨¬x(x \& y) \vee \neg x;

(c)

(x⊃(y⊃z))⊃((x⊃y)⊃(x⊃z))(x \supset (y \supset z)) \supset ((x \supset y) \supset (x \supset z)).

Problem II.2.4

Express by means of superpositions:

?
(a)

and ⊃\supset in terms of ∨\vee and ¬\neg;

(b)

∨\vee and ⊃\supset in terms of and ¬\neg;

(c)

and ∨\vee in terms of ⊃\supset and ¬\neg;

(d)

, ∨\vee, ⊃\supset, ¬\neg in terms of ∣\mid;

(e)

¬\neg in terms of ⊃\supset and 0;

(f)

¬\neg in terms of ++ and 1;

(g)

∨\vee in terms of ⊃\supset.

Problem II.2.5

Prove that C1,C0,L,DC_{1}, C_{0}, L, D and MM are distinct closed classes, different from CC.

?
Problem II.2.6

Prove that it is impossible to express by means of superpositions:

?
(a)

¬\neg in terms of , ∨\vee, ⊃\supset and ≡\equiv;

(b)

⊃\supset in terms of , ∨\vee;

(c)

in terms of ∨\vee, ⊃\supset.

Problem II.2.7
?
(a)

Prove that for every function f(x,x1,…,xn)f(x, x_{1}, \ldots , x_{n}) the equality holds:

f(x,x1,…,xn)=(x⋅f(1,x1,…,xn))∨(¬x⋅f(0,x1,…,xn)). f(x, x_{1}, \ldots , x_{n}) = (x \cdot f(1, x_{1}, \ldots , x_{n})) \vee (\neg x \cdot f(0, x_{1}, \ldots , x_{n})).
(b)

Let n≥i≥1n \geq i \geq 1. Prove that every function f(x1,…,xn)f(x_{1}, \ldots , x_{n}) of the algebra of logic can be represented in the form

f(x1,…,xi,xi+1,…,xn)=⋁ε1,…,εi(x1ε1⋅…⋅xiεi)⋅f(ε1,…,εi,xi+1,…,xn), f(x_{1}, \ldots , x_{i}, x_{i + 1}, \ldots , x_{n}) = \bigvee _{\varepsilon _{1}, \ldots , \varepsilon _{i}} (x_{1}^{\varepsilon _{1}} \cdot \ldots \cdot x_{i}^{\varepsilon _{i}}) \cdot f(\varepsilon _{1}, \ldots , \varepsilon _{i}, x_{i + 1}, \ldots , x_{n}),

where εj∈{0,1}\varepsilon_{j} \in \left\{ 0, 1\right\}, xj0=¬xjx_{j}^{0} = \neg x_{j}, xj1=xjx_{j}^{1} = x_{j}.

Problem II.2.8

Prove the completeness of the systems of functions:

?
(a)

{&,∨,¬}\left\{ \& , \vee , \neg \right\};

(b)

{∨,¬}\left\{ \vee , \neg \right\};

(c)

{&,¬}\left\{ \& , \neg \right\};

(d)

{⊃,¬}\left\{ \supset , \neg \right\}.

Problem II.2.9

Prove the incompleteness of the systems of functions:

?
(a)

{&,∨,⊃}\left\{ \& , \vee , \supset \right\};

(b)

{¬}\left\{ \neg \right\}.

Problem II.2.10

Prove the completeness of the systems of functions:

?
(a)

{∣}\left\{ \mid \right\};

(b)

{↓}\left\{ \downarrow \right\} (here ↓=¬(x∨y)\downarrow = \neg (x \vee y));

(c)

{⊃,0}\left\{ \supset , 0\right\};

(d)

{+,∨,1}\left\{ +, \vee , 1\right\}.

Problem II.2.11

Prove that:

?
(a)

{+,⋅,1}\left\{ +, \cdot , 1\right\} is a complete system of functions;

(b)

every function f(x1,…,xn)f(x_{1}, \ldots , x_{n}) is uniquely representable by a Zhegalkin polynomial, i.e., in the form:

ε0+∑k≥1∑1≤i1<…<ik≤nεi1…ikxi1⋅…⋅xik, \varepsilon _{0} + \sum _{k \geq 1} \sum _{1 \leq i_{1} < \ldots < i_{k} \leq n} \varepsilon _{i_{1} \ldots i_{k}} x_{i_{1}} \cdot \ldots \cdot x_{i_{k}},

where ε0,εi1…ik∈{0,1}\varepsilon_{0}, \varepsilon_{i_{1} \ldots i_{k}} \in \left\{ 0, 1\right\}.

Problem II.2.12

Show that the following systems of functions are independent:

?
(a)

{¬,≡}\left\{ \neg , \equiv \right\};

(b)

{¬,+}\left\{ \neg , +\right\};

(c)

{≡,+}\left\{ \equiv , +\right\};

(d)

{≡,∨}\left\{ \equiv , \vee \right\}.

Problem II.2.13

Show the completeness and independence of the following systems of functions:

?
(a)

{⊃,/}\left\{ \supset , /\right\}, where x/y=¬(y⊃x)x / y = \neg (y \supset x);

(b)

{0,1,[⋅,⋅,⋅]}\left\{ 0, 1, [\cdot , \cdot , \cdot ]\right\}, where [x,y,z]=(y&x)∨(¬y&z)[x, y, z] = (y \& x) \vee (\neg y \& z);

(c)

{≡,∨,0}\left\{ \equiv , \vee , 0\right\}.

Problem II.2.14

Show that ≡,+\equiv , + do not form a complete system of functions. Determine all possible ways of making this system a complete system of independent functions by adding one function of at most 2 arguments.

?
Problem II.2.15

Which system consisting of a single 2-ary function is complete? Find all such systems.

?
Problem II.2.16

Give an example of a complete system of functions:

?
(a)

consisting of a single 3-ary function;

(b)

consisting of a single nn-ary function (n≥2n \geq 2).

Problem II.2.17

Prove that a finite complete subsystem can be extracted from every complete system of functions.

?
Problem II.2.18

Prove that:

?
(a)

{&,⊃}\left\{ \& , \supset \right\} is a basis for C1C_{1};

(b)

{&,+}\left\{ \& , +\right\} is a basis for C0C_{0};

(c)

{∨,&,0,1}\left\{ \vee , \& , 0, 1\right\} is a basis for MM;

(d)

{0,≡}\left\{ 0, \equiv \right\} is a basis for LL;

(e)

{¬,xy+xz+yz}\left\{ \neg , xy + xz + yz\right\} is a basis for DD.

Problem II.2.19

Prove that the classes C1,C0C_{1}, C_{0} are precomplete classes.

?
Problem II.2.20

Prove that:

?
(a)

from any nonmonotone function together with the functions 0 and 1, one can obtain the function ¬\neg by superpositions;

(b)

the class MM is a precomplete class.

Problem II.2.21

Prove that:

?
(a)

from any non-self-dual function together with the function ¬\neg, one can obtain the functions 0 and 1 by superpositions;

(b)

the class DD is a precomplete class.

Problem II.2.22

Prove that:

?
(a)

from any nonlinear function together with the functions 0, 1, ¬\neg, one can obtain the function by superpositions;

(b)

the class LL is a precomplete class.

Problem II.2.23

Prove that every closed class K≠CK \neq C is contained in some precomplete class.

?
Problem II.2.24

Prove that a system of functions is complete if and only if it is not contained in any of the precomplete classes.

?
Problem II.2.25

Prove that there are no precomplete classes other than C1,C0,L,DC_{1}, C_{0}, L, D and MM (E.Post's theorem).

?
Problem II.2.26

Prove that every basis of CC contains at most four functions.

?
Problem II.2.27

Let TT and T1T_{1} be terms representing some functions of the algebra of logic, and let ε(T,x)\varepsilon (T, x) be the formula of set theory defined at the end of the introductory part of the section. Prove that:

?
(a)

ε((T∨T1),x)⇔(ε(T,x)∨ε(T1,x))\varepsilon ((T \vee T_{1}), x) \Leftrightarrow (\varepsilon (T, x) \vee \varepsilon (T_{1}, x));

(b)

ε((T&T1),x)⇔(ε(T,x)&ε(T1,x))\varepsilon ((T \& T_{1}), x) \Leftrightarrow (\varepsilon (T, x) \& \varepsilon (T_{1}, x));

(c)

ε(¬T,x)⇔¬ε(T,x)\varepsilon (\neg T, x) \Leftrightarrow \neg \varepsilon (T, x).

Problem II.2.28

Prove that in set theory:

?
(a)

Z(¬T)=−Z(T)Z(\neg T) = -Z(T), where −Z=U\Z-Z = U \backslash Z;

(b)

Z(T∨T1)=Z(T)∪Z(T1)Z(T \vee T_{1}) = Z(T) \cup Z(T_{1});

(c)

Z(T&T1)=Z(T)∩Z(T1)Z(T \& T_{1}) = Z(T) \cap Z(T_{1}).

Problem II.2.29

Prove that in set theory

ε(T,x)⇔x∈Z(T). \varepsilon (T, x) \Leftrightarrow x \in Z(T).
?
Problem II.2.30

Suppose the function ff is representable by the term TT, and gg by the term T1T_{1}. Prove that:

?
(a)

if f(a1,…,ak)=g(a1,…,ak)f(a_{1}, \ldots , a_{k}) = g(a_{1}, \ldots , a_{k}) for all a1,…,aka_{1}, \ldots , a_{k}, then in set theory the identity Z(T)=Z(T1)Z(T) = Z(T_{1}) holds;

(b)

if (f(a1,…,ak)⊃g(a1,…,ak))=1(f(a_{1}, \ldots , a_{k}) \supset g(a_{1}, \ldots , a_{k})) = 1 for all a1,…,aka_{1}, \ldots , a_{k}, then in set theory the relation Z(T)⊆Z(T1)Z(T) \subseteq Z(T_{1}) holds;

(c)

if f(a1,…,ak)=1f(a_{1}, \ldots , a_{k}) = 1 for all a1,…,aka_{1}, \ldots , a_{k}, then in set theory the identity Z(T)=UZ(T) = U holds;

(d)

if f(a1,…,ak)=0f(a_{1}, \ldots , a_{k}) = 0 for all a1,…,aka_{1}, \ldots , a_{k}, then in set theory the identity Z(T)=∅Z(T) = \emptyset holds.

Problem II.2.31

Prove that if the function f(a1,…,ak)f(a_{1}, \ldots , a_{k}) is representable by the term TT and Z(T)=UZ(T) = U for all arbitrary Z1,…,Zk⊆UZ_{1}, \ldots , Z_{k} \subseteq U, then f(a1,…,ak)=1f(a_{1}, \ldots , a_{k}) = 1 for all a1,…,aka_{1}, \ldots , a_{k}.

?
Problem II.2.32

On the basis of which identities of the algebra of logic can the following theorems of set theory be obtained:

?
(a)

(X∪Y)∪Z=X∪(Y∪Z)(X \cup Y) \cup Z = X \cup (Y \cup Z);

(b)

X∩Y=Y∩XX \cap Y = Y \cap X;

(c)

−(X∩Y)=−X∪−Y-(X \cap Y) = -X \cup -Y;

(d)

−(−X)=X-(-X) = X?

Problem II.2.33
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)
(l)
(m)
Problem II.3.1

Construct derivations of the following sequents in SC:

?
(a)

⊢(A⊃A)\vdash (A \supset A);

(b)

(A⊃B),(B⊃C)⊢(A⊃C)(A \supset B), (B \supset C) \vdash (A \supset C);

(c)

⊢(¬¬A≡A)\vdash (\neg \neg A \equiv A);

(d)

(A⊃(B⊃C)),(A⊃B),A⊢C(A \supset (B \supset C)), (A \supset B), A \vdash C;

(e)

(A⊃B),¬B⊢¬A(A \supset B), \neg B \vdash \neg A;

(f)

A,¬B⊢¬(A⊃B)A, \neg B \vdash \neg (A \supset B).

Problem II.3.2

Prove the substitution rule for SC: if the sequent A1,…,An⊢BA_{1}, \ldots , A_{n} \vdash B is derivable, PP is a variable and CC is any formula, then the sequent A1(P\C),…,An(P\C)⊢B(P\C)A_{1}(P \backslash C), \ldots , A_{n}(P \backslash C) \vdash B(P \backslash C) is derivable.

?
Problem II.3.3

Prove that the following rules are admissible in SC:

?
(a)

Γ1⊢A; Γ2,A⊢BΓ1,Γ2⊢B\dfrac {\Gamma_{1} \vdash A; \ \Gamma_{2}, A \vdash B}{\Gamma_{1}, \Gamma_{2} \vdash B} (cut);

(b)

Γ,A,B⊢CΓ,(A&B)⊢C\dfrac {\Gamma , A, B \vdash C}{\Gamma , (A \& B) \vdash C} (combining premises);

(c)

Γ,(A&B)⊢CΓ,A,B⊢C\dfrac {\Gamma , (A \& B) \vdash C}{\Gamma , A, B \vdash C} (splitting premises);

(d)

Γ,A⊢C; Γ,B⊢CΓ,(A∨B)⊢C\dfrac {\Gamma , A \vdash C; \ \Gamma , B \vdash C}{\Gamma , (A \vee B) \vdash C} (case analysis);

(e)

Γ,A⊢BΓ,¬B⊢¬A\dfrac {\Gamma , A \vdash B}{\Gamma , \neg B \vdash \neg A} (contraposition);

(f)

Γ,¬B⊢¬AΓ,A⊢B\dfrac {\Gamma , \neg B \vdash \neg A}{\Gamma , A \vdash B} (proof by contradiction);

(g)

A1,…,An⊢B⊢((A1&…&An)⊃B)\dfrac {A_{1}, \ldots , A_{n} \vdash B}{\vdash ((A_{1} \& \ldots \& A_{n}) \supset B)} (introduction of and ⊃\supset);

(h)

⊢((A1&…&An)⊃B)A1,…,An⊢B\dfrac {\vdash ((A_{1} \& \ldots \& A_{n}) \supset B)}{A_{1}, \ldots , A_{n} \vdash B} (elimination of and ¬\neg).

Problem II.3.4

Prove that if the rule Γ1⊢AΓ2⊢A\dfrac {\Gamma_{1} \vdash A}{\Gamma_{2} \vdash A} is admissible in SC for every formula AA, then the rule Γ1⊢Γ2⊢\dfrac {\Gamma_{1} \vdash }{\Gamma_{2} \vdash } is admissible in SC.

?
Problem II.3.5
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)
(l)
(m)
(n)
(o)
(p)
(q)
Problem II.3.6

Prove that the following rules are admissible in SC:

?
(a)

Γ,A⊢B; Γ,B⊢AΓ⊢(A≡B)\dfrac {\Gamma , A \vdash B; \ \Gamma , B \vdash A}{\Gamma \vdash (A \equiv B)};

(b)

Γ⊢(A≡B)Γ,A⊢B\dfrac {\Gamma \vdash (A \equiv B)}{\Gamma , A \vdash B};

(c)

Γ⊢(A≡B)Γ,B⊢A\dfrac {\Gamma \vdash (A \equiv B)}{\Gamma , B \vdash A}.

Problem II.3.7
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)
(l)
(m)
(n)
Problem II.3.8

Let AA be a formula, BB a subformula of the formula AA, and A1A_{1} the result of replacing some occurrence of BB in AA by the formula B1B_{1}. Prove the derivability in SC of the sequent (B≡B1)⊢(A≡A1)(B \equiv B_{1}) \vdash (A \equiv A_{1}) (the replacement theorem for SC).

?
Problem II.3.9
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)
Problem II.3.10

Let AA be a formula and A1A_{1} its CNF (see 1). Prove the derivability in SC of the sequent ⊢(A≡A1)\vdash (A \equiv A_{1}).

?
Problem II.3.11

Prove that for every identically true CNF AA the sequent ⊢A\vdash A is derivable in SC.

?
Problem II.3.12

Prove that:

?
(a)

if the sequent A1,…,An⊢BA_{1}, \ldots , A_{n} \vdash B is derivable in SC, then the formula ((A1&…&An)⊃B)((A_{1} \& \ldots \& A_{n}) \supset B) is identically true;

(b)

if the sequent ⊢B\vdash B is derivable in SC, then the formula BB is identically true;

(c)

if the sequent A1,…,An⊢A_{1}, \ldots , A_{n} \vdash is derivable in SC, then the formula ¬(A1&…&An)\neg (A_{1} \& \ldots \& A_{n}) is identically true.

Problem II.3.13

Prove that the sequent ⊢A\vdash A is derivable in SC if and only if AA is identically true (the completeness theorem for SC).

?
Problem II.3.14

Are the following sequents derivable in SC:

?
(a)

⊢((P∨Q)⊃(P&R))\vdash ((P \vee Q) \supset (P \& R));

(b)

⊢(((P⊃Q)⊃Q)⊃P)\vdash (((P \supset Q) \supset Q) \supset P);

(c)

⊢(((P⊃Q)⊃Q)⊃Q)\vdash (((P \supset Q) \supset Q) \supset Q);

(d)

⊢(¬(P∨¬P)⊃(P∨¬P))\vdash (\neg (P \vee \neg P) \supset (P \vee \neg P));

(e)

P⊢¬(P⊃¬P)P \vdash \neg (P \supset \neg P);

(f)

(P⊃Q)⊢(Q⊃P)(P \supset Q) \vdash (Q \supset P)?

Problem II.3.15

Prove the interpolation theorem for SC: if the sequent A⊢BA \vdash B is provable and the sequents A⊢A \vdash and ⊢B\vdash B are not provable, then there exists a formula CC, all of whose variables occur both in AA and in BB, such that the sequents A⊢CA \vdash C and C⊢BC \vdash B are provable (such a formula CC is called an interpolant).

?
Problem II.3.16

Construct interpolants (see Problem II.3.15) for the following sequents:

?
(a)

¬(¬Q∨R)⊢(P⊃Q)\neg (\neg Q \vee R) \vdash (P \supset Q);

(b)

¬(P⊃¬(Q&S))⊢((S⊃(P⊃R))⊃R)\neg (P \supset \neg (Q \& S)) \vdash ((S \supset (P \supset R)) \supset R).

Problem II.3.17

Are the following sequences of formulas derivations in PC:

?
(a)

(P⊃(P∨Q))(P \supset (P \vee Q));

(b)

(P⊃(P∨Q))(P \supset (P \vee Q)), ((P⊃(P∨Q))⊃(P⊃(P⊃(P∨Q))))((P \supset (P \vee Q)) \supset (P \supset (P \supset (P \vee Q)))), (P⊃(P⊃(P∨Q)))(P \supset (P \supset (P \vee Q)));

(c)

(P⊃(Q⊃P))(P \supset (Q \supset P)), ((P⊃(P∨Q))⊃Q)((P \supset (P \vee Q)) \supset Q), QQ?

Problem II.3.18

Construct derivations of the following formulas in PC:

?
(a)

(P⊃P)(P \supset P);

(b)

((P∨P)⊃P)((P \vee P) \supset P);

(c)

(P⊃¬¬P)(P \supset \neg \neg P).

Problem II.3.19

Prove that if AA is derivable in PC, then A(P\B)A(P \backslash B) is derivable in PC for any variable PP and formula BB (the substitution rule).

?
Problem II.3.20

Find the minimal set Γ\Gamma such that the following sequence is a derivation in PC from Γ\Gamma:

?
(a)

(P⊃(Q⊃R))(P \supset (Q \supset R)), PP, (Q⊃R)(Q \supset R), QQ, RR;

(b)

((P⊃¬¬Q)⊃(¬Q⊃¬P))((P \supset \neg \neg Q) \supset (\neg Q \supset \neg P)), (P⊃¬¬Q)(P \supset \neg \neg Q), (¬Q⊃¬P)(\neg Q \supset \neg P), ¬Q\neg Q, ¬P\neg P.

Problem II.3.21

Prove that A⊢AA \vdash A in PC.

?
Problem II.3.22

Prove that the following rules are admissible in PC:

?
(a)

Γ⊢AB,Γ⊢A\dfrac {\Gamma \vdash A}{B, \Gamma \vdash A};

(b)

B,B,Γ⊢AB,Γ⊢A\dfrac {B, B, \Gamma \vdash A}{B, \Gamma \vdash A};

(c)

Γ,A,B,Γ1⊢CΓ,B,A,Γ1⊢C\dfrac {\Gamma , A, B, \Gamma_{1} \vdash C}{\Gamma , B, A, \Gamma_{1} \vdash C};

(d)

Γ⊢A; A,Γ1⊢BΓ,Γ1⊢B\dfrac {\Gamma \vdash A; \ A, \Gamma_{1} \vdash B}{\Gamma , \Gamma_{1} \vdash B};

(e)

A1,…,An⊢BA1(P\C),…,An(P\C)⊢B(P\C)\dfrac {A_{1}, \ldots , A_{n} \vdash B}{A_{1}(P \backslash C), \ldots , A_{n}(P \backslash C) \vdash B(P \backslash C)}.

Problem II.3.23

Prove the deduction theorem for PC: if Γ,A⊢B\Gamma , A \vdash B, then Γ⊢(A⊃B)\Gamma \vdash (A \supset B).

?
Problem II.3.24

Prove for PC:

?
(a)

Γ,A,B⊢(A&B)\Gamma , A, B \vdash (A \& B) (introduction of );

(b)

Γ,A⊢(A∨B)\Gamma , A \vdash (A \vee B) (introduction of ∨\vee);

(c)

Γ,B⊢(A∨B)\Gamma , B \vdash (A \vee B) (introduction of ∨\vee);

(d)

Γ,A⊢B; Γ,A⊢¬BΓ⊢¬A\dfrac {\Gamma , A \vdash B; \ \Gamma , A \vdash \neg B}{\Gamma \vdash \neg A} (introduction of ¬\neg);

(e)

Γ,(A&B)⊢A\Gamma , (A \& B) \vdash A (elimination of );

(f)

Γ,(A&B)⊢B\Gamma , (A \& B) \vdash B (elimination of );

(g)

Γ,A⊢C; Γ,B⊢CΓ,(A∨B)⊢C\dfrac {\Gamma , A \vdash C; \ \Gamma , B \vdash C}{\Gamma , (A \vee B) \vdash C} (elimination of ∨\vee);

(h)

Γ,¬¬A⊢A\Gamma , \neg \neg A \vdash A (elimination of ¬\neg).

Problem II.3.25

Prove that a set Γ\Gamma is consistent if and only if there exists a formula that is not derivable in PC from Γ\Gamma.

?
Problem II.3.26
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
Problem II.3.27

Let AA be a formula, BB a subformula of the formula AA, and A1A_{1} the result of replacing some occurrence of BB in AA by the formula B1B_{1}. Prove the replacement theorem for PC:

(B≡B1)⊢(A≡A1). (B \equiv B_{1}) \vdash (A \equiv A_{1}).
?
Problem II.3.28
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)
(l)
(m)
(n)
(o)
(p)
(q)
(r)
(s)
(t)
(u)
(v)
Problem II.3.29

Prove that if the formula AA is derivable in PC, then the sequent ⊢A\vdash A is derivable in SC.

?
Problem II.3.30

Prove that:

?
(a)

if the sequent A1,…,An⊢BA_{1}, \ldots , A_{n} \vdash B is derivable in SC, then A1,…,An⊢BA_{1}, \ldots , A_{n} \vdash B in PC;

(b)

if the sequent A1,…,An⊢A_{1}, \ldots , A_{n} \vdash is derivable in SC, then A1,…,An⊢(B&¬B)A_{1}, \ldots , A_{n} \vdash (B \& \neg B) in PC;

(c)

if the sequent ⊢B\vdash B is derivable in SC, then the formula BB is derivable in PC.

Problem II.3.31

Prove that:

?
(a)

all axioms of PC are identically true;

(b)

all formulas derivable in PC are identically true.

Problem II.3.32

Prove the completeness theorem for PC: every identically true formula is derivable in PC.

?
Problem II.3.33

Find formulas AA and BB such that the derivability in PC of AA implies the derivability of BB, but it is not true that A⊢BA \vdash B.

?
Problem II.3.34

Let AA be a formula and P1,…,PnP_{1}, \ldots , P_{n} all of its variables. Prove that if AA is not derivable in PC, then there exist formulas B1,…,BnB_{1}, \ldots , B_{n} such that the formula ¬A(P1\B1,…,Pn\Bn)\neg A(P_{1} \backslash B_{1}, \ldots , P_{n} \backslash B_{n}) is derivable in PC.

?
Problem II.3.35

Let AA and BB be formulas. Set

A≈B⇌⊢(A≡B) in PC;∥A∥⇌{B∣A≈B}. A \approx B \rightleftharpoons \vdash (A \equiv B) \text{ in PC}; \qquad \left\| A\right\| \rightleftharpoons \left\{ B \mid A \approx B\right\} .

Prove that:

?
(a)

≈\approx is an equivalence relation on the set FF of all formulas;

(b)

the quotient set F/≈⇌{∥A∥∣A∈F}F / {\approx } \rightleftharpoons \left\{ \left\| A\right\| \mid A \in F\right\} is a Boolean algebra, where ∥A∥≤∥B∥⇔⊢(A⊃B)\left\| A\right\| \leq \left\| B\right\| \Leftrightarrow \vdash (A \supset B) in PC (this algebra is called the Lindenbaum algebra for PC);

(c)

AA is derivable in PC if and only if ∥A∥\left\| A\right\| is the greatest element 1 of the algebra F/≈F / {\approx }.

Problem II.3.36

Let B\mathfrak {B} be a Boolean algebra. Assign to it the logical matrix ⟨B;{1},&,∨,⊃,¬⟩\langle \mathfrak {B}; \left\{ 1\right\} , \& , \vee , \supset , \neg \rangle, where x&y=x∩yx \& y = x \cap y, x∨y=x∪yx \vee y = x \cup y, x⊃y=−x∪yx \supset y = -x \cup y, ¬x=−x\neg x = -x. Prove that AA is derivable in PC if and only if AA is generally valid in all logical matrices corresponding to Boolean algebras.

?
Problem II.3.37
?
(a)

Let TT be an ultrafilter on the Lindenbaum algebra F/≈F / {\approx } (see Problem II.3.35). For an arbitrary variable PP, set the value of PP equal to T\text{T} if ∥P∥∈T\left\| P\right\| \in T, and F\text{F} otherwise. Prove that for every formula AA

A∈T⇔A is true at these values of the variables. A \in T \Leftrightarrow A \text{ is true at these values of the variables}.
(b)

Deduce from (a) the completeness theorem for the calculus PC (see Problem II.3.32).

Problem II.3.38

Let AA be a formula, Δ\Delta a system of formulas, and MM a logical matrix. Prove that if all formulas of Δ\Delta are generally valid in MM, and a direct consequence of formulas generally valid in MM is a formula generally valid in MM, while the formula AA is not generally valid in MM, then AA is independent of Δ\Delta.

?
Problem II.3.39

Let M={0,1,2}M = \left\{ 0, 1, 2\right\}, D={0}D = \left\{ 0\right\}, x&y=max⁡{x,y}x \& y = \max \left\{ x, y\right\}, x∨y=min⁡{x,y}x \vee y = \min \left\{ x, y\right\}, x⊃y=max⁡{0,y−x}x \supset y = \max \left\{ 0, y - x\right\}, ¬x=2−x\neg x = 2 - x. Prove that the formula

A=((P⊃(Q⊃R))⊃((P⊃Q)⊃(P⊃R))) A = ((P \supset (Q \supset R)) \supset ((P \supset Q) \supset (P \supset R)))

is independent of Δ\Delta, where Δ={(P⊃(Q⊃P)),((¬P⊃¬Q)⊃(Q⊃P))}\Delta = \left\{ (P \supset (Q \supset P)), ((\neg P \supset \neg Q) \supset (Q \supset P))\right\}, using the logical matrix ⟨M;D,&,∨,⊃,¬⟩\langle M; D, \& , \vee , \supset , \neg \rangle.

?
Problem II.3.40

Prove the independence of the axiom schemes of the calculus PC.

?
Problem II.3.41

Let LL be the propositional calculus with axiom schemes:

L1. (A⊃(B⊃A))(A \supset (B \supset A)),

L2. ((A⊃B)⊃((A⊃(B⊃C))⊃(A⊃C)))((A \supset B) \supset ((A \supset (B \supset C)) \supset (A \supset C))),

L3. ((¬A⊃¬B)⊃(B⊃A))((\neg A \supset \neg B) \supset (B \supset A))

and rule of inference A; (A⊃B)B\dfrac {A; \ (A \supset B)}{B}.

?
(a)

Prove that every formula derivable in LL is also derivable in PC.

(b)

Prove the deduction theorem for LL.

(c)

Set (A&B)=¬(A⊃¬B)(A \& B) = \neg (A \supset \neg B), (A∨B)=(¬A⊃B)(A \vee B) = (\neg A \supset B). Prove that every formula derivable in PC is derivable in LL.

Problem II.3.42

Prove that:

?
(a)

every formula derivable in IPC is derivable in PC;

(b)

(¬¬P⊃P)(\neg \neg P \supset P), (P∨¬P)(P \vee \neg P) are not derivable in IPC.

Problem II.3.43

For the calculus IPC, prove the deduction theorem: if Γ,A⊢IB\Gamma , A \vdash_{\text{I}} B, then Γ⊢I(A⊃B)\Gamma \vdash_{\text{I}} (A \supset B).

?
Problem II.3.44

Let ISC be the sequent calculus that differs from SC by the absence of rule 11. Prove that:

?
(a)

if the formula AA is derivable in IPC, then the sequent ⊢A\vdash A is derivable in ISC;

(b)

if the sequent A1,…,An⊢BA_{1}, \ldots , A_{n} \vdash B is derivable in ISC, then A1,…,An⊢IBA_{1}, \ldots , A_{n} \vdash_{\text{I}} B;

(c)

if the sequent A1,…,An⊢A_{1}, \ldots , A_{n} \vdash is derivable in ISC, then A1,…,An⊢I(B&¬B)A_{1}, \ldots , A_{n} \vdash_{\text{I}} (B \& \neg B);

(d)

if the sequent ⊢B\vdash B is derivable in ISC, then the formula BB is derivable in IPC.

Problem II.3.45

Prove that:

?
(a)

⊢I(A⊃¬¬A)\vdash_{\text{I}} (A \supset \neg \neg A);

(b)

⊢I¬¬(¬¬A⊃A)\vdash_{\text{I}} \neg \neg (\neg \neg A \supset A);

(c)

¬¬A,¬¬(A⊃B)⊢I¬¬B\neg \neg A, \neg \neg (A \supset B) \vdash_{\text{I}} \neg \neg B.

Problem II.3.46

Prove that if the formula AA is derivable in PC, then the formula ¬¬A\neg \neg A is derivable in IPC.

?
Problem II.3.47

Let Mn={0,1,…,n}M_{n} = \left\{ 0, 1, \ldots , n\right\}, D={0}D = \left\{ 0\right\}, x&y=max⁡(x,y)x \& y = \max (x, y), x∨y=min⁡(x,y)x \vee y = \min (x, y),

x⊃y={0,if x≥y,y,if x<y,¬x={0,if x=n,n,if x<n. x \supset y = \begin{cases} 0, & \text{if } x \geq y, \\ y, & \text{if } x < y, \end{cases} \qquad \neg x = \begin{cases} 0, & \text{if } x = n, \\ n, & \text{if } x < n. \end{cases}

Prove that:

?
(a)

every formula derivable in IPC is generally valid in Mn=⟨M;D,&,∨,⊃,¬⟩M_{n} = \langle M; D, \& , \vee , \supset , \neg \rangle (n=1,2,…n = 1, 2, \ldots).

(b)

the formulas

An=((P1≡P2)∨…∨(P1≡Pn+1)∨…∨(Pn≡Pn+1)) A_{n} = ((P_{1} \equiv P_{2}) \vee \ldots \vee (P_{1} \equiv P_{n + 1}) \vee \ldots \vee (P_{n} \equiv P_{n + 1}))

are not derivable in IPC (n=1,2,…n = 1, 2, \ldots).

Problem II.3.48

Let M=⟨M;D,&,∨,⊃,¬⟩M = \langle M; D, \& , \vee , \supset , \neg \rangle be a logical matrix such that the set of formulas generally valid in MM coincides with the set of formulas derivable in IPC. Prove that the set MM is infinite.

?
Problem II.4.1

Let f1f^{1} be a 1-ary, g2g^{2} a 2-ary, and h3h^{3} a 3-ary function symbol. Are the following words terms:

?
(a)

f1(g2(ν0,ν1))f^{1}(g^{2}(\nu_{0}, \nu_{1}));

(b)

g2(f1(ν2),h3(ν0,ν1,ν2))g^{2}(f^{1}(\nu_{2}), h^{3}(\nu_{0}, \nu_{1}, \nu_{2}));

(c)

f1(g2(ν0),h3(ν0,ν1,ν2))f^{1}(g^{2}(\nu_{0}), h^{3}(\nu_{0}, \nu_{1}, \nu_{2}))?

Problem II.4.2

Let f1,g2,h3f^{1}, g^{2}, h^{3} be as in the previous problem, P1P^{1} a 1-ary and Q3Q^{3} a 3-ary predicate symbol. Are the following words formulas:

?
(a)

Q3(ν0,f1(ν1),h3(ν1,ν2,ν2))Q^{3}(\nu_{0}, f^{1}(\nu_{1}), h^{3}(\nu_{1}, \nu_{2}, \nu_{2}));

(b)

(P1(ν0)⊃∀ν1(Q3(ν0,ν1,ν2)&P1(g2(ν0,ν1))))(P^{1}(\nu_{0}) \supset \forall \nu_{1}(Q^{3}(\nu_{0}, \nu_{1}, \nu_{2}) \& P^{1}(g^{2}(\nu_{0}, \nu_{1}))));

(c)

Q3(P1(ν0),f1(ν1),f1(ν2))Q^{3}(P^{1}(\nu_{0}), f^{1}(\nu_{1}), f^{1}(\nu_{2}));

(d)

f1(h3(ν0,ν1,ν2))f^{1}(h^{3}(\nu_{0}, \nu_{1}, \nu_{2}))?

Problem II.4.3

Show that the expression

∃ν0∀ν1…∀νν0(P(ν1)&…&P(νν0)), \exists \nu _{0} \forall \nu _{1} \ldots \forall \nu _{\nu _{0}} (P(\nu _{1}) \& \ldots \& P(\nu _{\nu _{0}})),

where PP is a 1-ary predicate symbol, is not a formula.

?
Problem II.4.4

Write out all subformulas of the formula:

?
(a)

Q2(f1(ν0),g2(ν0,ν1))Q^{2}(f^{1}(\nu_{0}), g^{2}(\nu_{0}, \nu_{1}));

(b)

(∃ν0Q2(ν0,ν1)⊃¬(P1(g2(ν0,ν1))&∀ν2P1(ν2)))(\exists \nu_{0} Q^{2}(\nu_{0}, \nu_{1}) \supset \neg (P^{1}(g^{2}(\nu_{0}, \nu_{1})) \& \forall \nu_{2} P^{1}(\nu_{2}))).

Problem II.4.5

Describe the set of terms in one variable ν0\nu_{0}:

?
(a)

and function symbol f1f^{1};

(b)

and function symbol g2g^{2}.

Problem II.4.6

Which occurrences of variables are free and which are bound in the formulas:

?
(a)

∀ν0(P(ν0,ν1)⊃∀ν1Q(ν1))\forall \nu_{0}(P(\nu_{0}, \nu_{1}) \supset \forall \nu_{1} Q(\nu_{1}));

(b)

(∀ν0P(ν0,ν1)⊃∀ν1R(ν0,ν1))(\forall \nu_{0} P(\nu_{0}, \nu_{1}) \supset \forall \nu_{1} R(\nu_{0}, \nu_{1}));

(c)

(¬∃ν2Q(ν2,ν2)&R(f(ν1,ν2)))(\neg \exists \nu_{2} Q(\nu_{2}, \nu_{2}) \& R(f(\nu_{1}, \nu_{2})))?

Problem II.4.7

Is the term tt free for xx in AA:

?
(a)

t=f(ν0,ν3)t = f(\nu_{0}, \nu_{3}), x=ν1x = \nu_{1}, A=∀ν0P(ν0,ν1)A = \forall \nu_{0} P(\nu_{0}, \nu_{1});

(b)

t=f(ν1,ν2)t = f(\nu_{1}, \nu_{2}), x=ν1x = \nu_{1}, A=(P(ν1,ν2)⊃∃ν2Q(ν2))A = (P(\nu_{1}, \nu_{2}) \supset \exists \nu_{2} Q(\nu_{2}))?

Problem II.4.8

Prove that:

?
(a)

a term containing no variables is free for any variable in any formula;

(b)

the variable xx is free for xx in any formula;

(c)

if AA contains no free occurrences of xx, then any term is free for xx in AA.

Problem II.4.9

Let M=⟨N;S3,P3⟩\mathfrak {M} = \langle \mathbb {N}; S^{3}, P^{3} \rangle, where

S3(x,y,z)=T⇔x+y=z,P3(x,y,z)=T⇔x⋅y=z. S^{3}(x, y, z) = \text{T} \Leftrightarrow x + y = z, \qquad P^{3}(x, y, z) = \text{T} \Leftrightarrow x \cdot y = z.

Write a formula with one free variable xx, true in M\mathfrak {M} if and only if:

?
(a)

x=0x = 0;

(b)

x=1x = 1;

(c)

x=2x = 2;

(d)

xx is even;

(e)

xx is odd;

(f)

xx is a prime number.

Problem II.4.10

Write a formula with two free variables xx and yy, true in M\mathfrak {M} from Problem II.4.9 if and only if:

?
(a)

x=yx = y;

(b)

x≤yx \leq y;

(c)

x<yx < y;

(d)

xx divides yy;

(e)

xx and yy are twin primes.

Problem II.4.11

Write a formula with three free variables x,y,zx, y, z, true in M\mathfrak {M} from Problem II.4.9 if and only if:

?
(a)

zz is the least common multiple of xx and yy.

(b)

zz is the greatest common divisor of xx and yy.

Problem II.4.12

Write a sentence expressing, in the model M\mathfrak {M} from Problem II.4.9:

?
(a)

commutativity of addition;

(b)

associativity of addition;

(c)

commutativity of multiplication;

(d)

associativity of multiplication;

(e)

distributivity of addition with respect to multiplication;

(f)

the infinitude of the set of prime numbers;

(g)

every number is a sum of four squares;

(h)

the existence of the l.c.m.and g.c.d.for nonzero numbers.

Problem II.4.13

Write a sentence expressing, in the model M\mathfrak {M} from Problem II.4.9:

?
(a)

the nonexistence of a unit;

(b)

there are finitely many primes;

(c)

every number can be represented as a sum of two squares;

(d)

for every number there exists a strictly smaller number;

(e)

the existence of a greatest natural number.

Are these sentences true in the model M\mathfrak {M}?

Problem II.4.14

Write a sentence expressing, in the model M\mathfrak {M} from Problem II.4.9:

?
(a)

there are infinitely many twin primes;

(b)

every even number greater than 2 is a sum of two primes.

Problem II.4.15

Write a sentence expressing, in the model M\mathfrak {M} from Problem II.4.9, that the equation 3x2+2x+1=03x^{2} + 2x + 1 = 0 has exactly two distinct roots.

?
Problem II.4.16

Write a sentence expressing, in the model M\mathfrak {M} from Problem II.4.9, that the system of equations

{3x−y=0,x+y=1 \begin{cases} 3x - y = 0, \\ x + y = 1 \end{cases}

has no solution.

?
Problem II.4.17

Let MM be the set of points, lines, and planes of 3-dimensional Euclidean space, with the following predicates:

T(x)=T⇔x is a point; T(x) = \text{T} \Leftrightarrow x \text{ is a point}; L(x)=T⇔x is a line; L(x) = \text{T} \Leftrightarrow x \text{ is a line}; Pl(x)=T⇔x is a plane; Pl(x) = \text{T} \Leftrightarrow x \text{ is a plane}; On(x,y)=T⇔x lies on y. On(x, y) = \text{T} \Leftrightarrow x \text{ lies on } y.

Write the following formulas:

?
(a)

through every two points a line can be drawn; if these points are distinct, such a line is unique;

(b)

through every three points not lying on one line a unique plane can be drawn;

(c)

the definition of parallel lines;

(d)

the definition of parallel planes.

Problem II.4.18

In the model from Problem II.4.17, write:

?
(a)

Euclid's axiom on parallel lines;

(b)

Lobachevsky's axiom on parallel lines.

Problem II.4.19

Choose predicates and write:

?
(a)

Hilbert's axioms for Euclidean geometry;

(b)

the axioms for Lobachevsky geometry;

(c)

the axioms for Riemannian geometry.

Problem II.4.20

Consider models with a single 2-ary predicate R(x,y)R(x, y). Write that the given predicate R(x,y)R(x, y):

?
(a)

is reflexive;

(b)

is symmetric;

(c)

is transitive;

(d)

is an equivalence relation.

Problem II.4.21

In the signature τ=⟨≤,=⟩\tau = \langle \leq , {=} \rangle, where ≤\leq and == are 2-ary predicates, write the axioms:

?
(a)

of a partially ordered set;

(b)

of a linearly ordered set.

Problem II.4.22

Let MM be a partially ordered set and

Q2(x,y)=T⇔x≤y. Q^{2}(x, y) = \text{T} \Leftrightarrow x \leq y.

Write that:

?
(a)

xx is the least element;

(b)

xx is a minimal element;

(c)

xx lies between yy and zz;

(d)

the set is densely ordered;

(e)

every maximal element is minimal.

Problem II.4.23

Let M=P(A)M = \mathcal{P}(A), where AA is some set, and

Q2(x,y)=T⇔x⊆y. Q^{2}(x, y) = \text{T} \Leftrightarrow x \subseteq y.

Write that:

?
(a)

xx is the intersection of yy and zz;

(b)

xx is the union of yy and zz;

(c)

x=∅x = \emptyset;

(d)

x=Ax = A;

(e)

xx is the complement of yy.

Problem II.4.24

Consider M=⟨P(A);=,f2,g2⟩\mathfrak {M} = \langle \mathcal{P}(A); {=}, f^{2}, g^{2} \rangle, where f2(x,y)=x∩yf^{2}(x, y) = x \cap y, g2(x,y)=x∪yg^{2}(x, y) = x \cup y, and == is the predicate of set equality. Write that:

?
(a)

x⊆yx \subseteq y;

(b)

xx is a singleton set.

Problem II.4.25

In the signature τ=⟨≤,=⟩\tau = \langle \leq , {=} \rangle, write the axioms:

?
(a)

of an ordered set with a greatest and a least element;

(b)

of a discretely ordered set;

(c)

of a lattice;

(d)

of a distributive lattice;

(e)

of a Dedekind lattice;

(f)

of a relatively complemented distributive lattice;

(g)

of a Boolean algebra;

(h)

of an atomic Boolean algebra.

Problem II.4.26

In a suitable signature, write the axioms:

?
(a)

of a quasigroup;

(b)

of a loop;

(c)

of a semigroup;

(d)

of a commutative semigroup;

(e)

of a commutative cancellative semigroup.

Problem II.4.27

In a suitable signature, write the axioms:

?
(a)

of a group;

(b)

of an abelian group;

(c)

of an ordered abelian group;

(d)

of a divisible group.

Problem II.4.28

In a suitable signature, write the axioms:

?
(a)

of a ring;

(b)

of an associative, commutative ring;

(c)

of a Lie ring;

(d)

of an integral domain;

(e)

of a skew field;

(f)

of a field;

(g)

of an algebraically closed field;

(h)

of a real closed field.

Problem II.4.29

Let M=⟨N;P1,g1,0⟩\mathfrak {M} = \langle \mathbb {N}; P^{1}, g^{1}, 0 \rangle, where g1(x)=x+1g^{1}(x) = x + 1, P1P^{1} is an arbitrary 1-ary predicate, and 00 is zero. Write the induction axiom for P1P^{1}.

?
Problem II.4.30

Let M=⟨M;Q2,P1⟩\mathfrak {M} = \langle M; Q^{2}, P^{1} \rangle, where MM is a well-ordered set, Q2(x,y)⇔x≤yQ^{2}(x, y) \Leftrightarrow x \leq y, and P1P^{1} is an arbitrary 1-ary predicate. Write the transfinite induction axiom for P1P^{1}.

?
Problem II.5.1

Prove that a formula AA of signature σ\sigma is satisfiable in the algebraic system M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle if and only if AA is satisfiable in every enrichment M′=⟨M;σ′⟩\mathfrak {M}' = \langle M; \sigma ' \rangle.

?
Problem II.5.2

Prove that for every sentence AA of signature σ\sigma relative to the algebraic system M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle, we have M⊨A\mathfrak {M} \vDash A or M⊨¬A\mathfrak {M} \vDash \neg A.

?
Problem II.5.3

Prove that:

?
(a)

AA is satisfiable if and only if ¬A\neg A is not identically true;

(b)

AA is identically true if and only if ¬A\neg A is not satisfiable.

Problem II.5.4

Prove that a quantifier-free formula is identically true if and only if it can be obtained by substitution from some identically true formula of the propositional calculus.

?
Problem II.5.5
?
(a)

Prove that if a closed ∀\forall-formula is true in an algebraic system, then it is true in every subsystem of it.

(b)

Prove that if a closed ∀\forall-formula is true in an algebraic system, then it is true in every extension of it.

(c)

Give an example of a formula AA and an algebraic system M\mathfrak {M} such that M⊨A\mathfrak {M} \vDash A and AA is false in some extension and some subsystem of the system M\mathfrak {M}.

Problem II.5.6

Let M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle be a subsystem of the system M1=⟨M1;σ⟩\mathfrak {M}_{1} = \langle M_{1}; \sigma \rangle. Prove that for every sentence AA of signature σ\sigma relative to the algebraic system M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle, M⊨A\mathfrak {M} \vDash A if and only if M2⊨ρP(A)\mathfrak {M}_{2} \vDash \rho_{P}(A), where M2=⟨M1;σ,P⟩\mathfrak {M}_{2} = \langle M_{1}; \sigma , P \rangle is an enrichment of M1\mathfrak {M}_{1} and ρP(A)\rho_{P}(A) is the relativization of the formula AA, with, for every a∈M1a \in M_{1},

M2⊨P(a)⇔a∈M. \mathfrak {M}_{2} \vDash P(a) \Leftrightarrow a \in M.
?
Problem II.5.7

Are the formulas satisfiable:

?
(a)

∃x P(x)\exists x \, P(x);

(b)

∀x P(x)\forall x \, P(x);

(c)

∃x∀y(Q(x,x)&¬Q(x,y))\exists x \forall y (Q(x, x) \& \neg Q(x, y));

(d)

∃x∃y(P(x)&¬P(y))\exists x \exists y (P(x) \& \neg P(y));

(e)

∃x∀y(Q(x,y)⊃∀z R(x,y,z))\exists x \forall y (Q(x, y) \supset \forall z \, R(x, y, z));

(f)

(P(x)⊃∀y(P(y)))(P(x) \supset \forall y (P(y)))?

Problem II.5.8

Are the formulas identically true:

?
(a)

(∃x P(x)⊃∀x P(x))(\exists x \, P(x) \supset \forall x \, P(x));

(b)

¬(∃x P(x)⊃∀x P(x))\neg (\exists x \, P(x) \supset \forall x \, P(x));

(c)

(∃x∀y Q(x,y)⊃∀y∃x Q(x,y))(\exists x \forall y \, Q(x, y) \supset \forall y \exists x \, Q(x, y));

(d)

(∀x∃y Q(x,y)⊃∃y∀x Q(x,y))(\forall x \exists y \, Q(x, y) \supset \exists y \forall x \, Q(x, y))?

Problem II.5.9

Let A(t)A(t) be obtained from A(x)A(x) by replacing all free occurrences of the variable xx by the term tt. Prove the identical truth of the following formulas, if the term tt is free for xx in A(x)A(x):

?
(a)

∀x A(x)⊃A(t)\forall x \, A(x) \supset A(t);

(b)

A(t)⊃∃x A(x)A(t) \supset \exists x \, A(x).

Problem II.5.10

Give examples of formulas A(x)A(x) and terms tt such that formulas (a) and (b) of the preceding problem are not identically true.

?
(a)
(b)
Problem II.5.11

Prove that the formula

(∀x∃y P(x,y) & ∀x∀y(P(x,y)⊃¬P(y,x)) & ∀x∀y∀z(P(x,y)⊃(P(y,z)⊃P(x,z)))) (\forall x \exists y \, P(x, y) \, \& \, \forall x \forall y (P(x, y) \supset \neg P(y, x)) \, \& \, \forall x \forall y \forall z (P(x, y) \supset (P(y, z) \supset P(x, z))))

is satisfiable in some infinite model and false in all finite ones.

?
Problem II.5.12

Prove that the formula

∃x∀y(F(x,y)⊃(¬F(y,x)⊃(F(x,x)≡F(y,y)))) \exists x \forall y (F(x, y) \supset (\neg F(y, x) \supset (F(x, x) \equiv F(y, y))))

is true in every model containing at most three elements.

?
Problem II.5.13

Prove that the following formulas are true in every finite model, but not identically true:

?
(a)

∃x∀y∃z((F(y,z)⊃F(x,z))⊃(F(x,x)⊃F(y,x)))\exists x \forall y \exists z ((F(y, z) \supset F(x, z)) \supset (F(x, x) \supset F(y, x)));

(b)

(∀x1∀x2∀x3(F(x1,x1)&(F(x1,x3)⊃(F(x1,x2)∨F(x2,x3))))⊃∃y∀z F(y,z))(\forall x_{1} \forall x_{2} \forall x_{3} (F(x_{1}, x_{1}) \& (F(x_{1}, x_{3}) \supset (F(x_{1}, x_{2}) \vee F(x_{2}, x_{3})))) \supset \exists y \forall z \, F(y, z)).

Problem II.5.14

Write a formula with 1-ary predicates, satisfiable only in models containing at least five elements.

?
Problem II.5.15

Prove the identical truth of the following formulas:

?
(a)

(¬∃x A(x)⊃¬∀x A(x))(\neg \exists x \, A(x) \supset \neg \forall x \, A(x));

(b)

(∃x(A(x)&(B⊃C(x)))⊃(∀x(A(x)⊃¬C(x))⊃¬B))(\exists x (A(x) \& (B \supset C(x))) \supset (\forall x (A(x) \supset \neg C(x)) \supset \neg B)), where xx is not free in BB;

(c)

(∀x(A(x)⊃¬B(x))⊃¬(∃x A(x)&∀x B(x)))(\forall x (A(x) \supset \neg B(x)) \supset \neg (\exists x \, A(x) \& \forall x \, B(x)));

(d)

(∀x(A(x)⊃¬B(x))⊃¬(∀x A(x)&∃x B(x)))(\forall x (A(x) \supset \neg B(x)) \supset \neg (\forall x \, A(x) \& \exists x \, B(x))).

Problem II.5.16
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)
(l)
(m)
(n)
(o)
(p)
(q)
(r)
(s)
(t)
Problem II.5.17

Let AA be a formula, BB a subformula of the formula AA, and A1A_{1} the result of replacing some occurrence of BB in AA by the formula B1B_{1}. Prove that if B∼B1B \sim B_{1}, then A∼A1A \sim A_{1} (the replacement theorem).

?
Problem II.5.18

Prove that for every formula there exists an equivalent prenex normal form.

?
Problem II.5.19

Reduce to prenex normal form, taking AA and BB to be quantifier-free formulas:

?
(a)

¬∃x∀y∃z∀u A\neg \exists x \forall y \exists z \forall u \, A;

(b)

(∃x∀y A(x,y)&∃x∀y B(x,y))(\exists x \forall y \, A(x, y) \& \exists x \forall y \, B(x, y));

(c)

(∃x∀y A(x,y)∨∃x∀y B(x,y))(\exists x \forall y \, A(x, y) \vee \exists x \forall y \, B(x, y));

(d)

(∃x∀y A(x,y)⊃∃x∀y B(x,y))(\exists x \forall y \, A(x, y) \supset \exists x \forall y \, B(x, y)).

Problem II.5.20

Let σ=⟨{Pini}i∈I,{fjnj}j∈J,{ak}k∈K⟩\sigma = \langle \left\{ P_{i}^{n_{i}}\right\}_{i \in I}, \left\{ f_{j}^{n_{j}}\right\}_{j \in J}, \left\{ a_{k}\right\}_{k \in K} \rangle, and let TT be the set of all terms of signature σ\sigma. Define predicates and functions on TT so that TT becomes an algebraic system of signature σ\sigma.

?
Problem II.5.21
?
(a)

Let a formula of signature σ\sigma have the form

∀x1…∀xn∃y1…∃ym B(x1,…,xn,y1,…,ym) \forall x_{1} \ldots \forall x_{n} \exists y_{1} \ldots \exists y_{m} \, B(x_{1}, \ldots , x_{n}, y_{1}, \ldots , y_{m})

for some formula BB (possibly containing quantifiers); let φ1,…,φm\varphi_{1}, \ldots , \varphi_{m} be nn-ary function symbols not occurring in σ\sigma. Prove that for every system M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle there exists an enrichment M1\mathfrak {M}_{1} of signature σ′=σ∪{φ1,…,φm}\sigma ' = \sigma \cup \left\{ \varphi_{1}, \ldots , \varphi_{m}\right\} such that

M1⊨∀x1…∀xn(∃y1…∃ym B(x1,…,xn,y1,…,ym)≡B(x1,…,xn,φ1(x1,…,xn),…,φm(x1,…,xn))). \mathfrak {M}_{1} \vDash \forall x_{1} \ldots \forall x_{n} (\exists y_{1} \ldots \exists y_{m} \, B(x_{1}, \ldots , x_{n}, y_{1}, \ldots , y_{m}) \equiv B(x_{1}, \ldots , x_{n}, \varphi _{1}(x_{1}, \ldots , x_{n}), \ldots , \varphi _{m}(x_{1}, \ldots , x_{n}))).
(b)

Prove that for every sentence AA of signature σ\sigma there exists a ∀\forall-formula A1A_{1} of a signature σ′\sigma ', obtained by adjoining new function symbols to σ\sigma, with the following property: for every system M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle there exists an enrichment M1\mathfrak {M}_{1} of signature σ′\sigma ' such that

M1⊨(A≡A′). \mathfrak {M}_{1} \vDash (A \equiv A').

(The functions adjoined in M1\mathfrak {M}_{1} are called Skolem functions.)

Problem II.5.22

For the formula ∀x∃z∀y∃u((y>z⊃y>x)&(u<z)&¬(u<x))\forall x \exists z \forall y \exists u ((y > z \supset y > x) \& (u < z) \& \neg (u < x)), construct the ∀\forall-formula whose existence is asserted in Problem II.5.21(b). For the system M=⟨N;<⟩\mathfrak {M} = \langle \mathbb {N}; {<} \rangle, find the required enrichment.

?
Problem II.5.23

For the formula ∀x∀y∃z∃t(P(x,t)&¬P(y,z))\forall x \forall y \exists z \exists t (P(x, t) \& \neg P(y, z)), construct the ∀\forall-formula whose existence is asserted in Problem II.5.21(b). For any system M=⟨M;P⟩\mathfrak {M} = \langle M; P \rangle, where M={0,1}M = \left\{ 0, 1\right\}, find a suitable enrichment.

?
Problem II.5.24

For the formula

∀x∀y∃z∃v∀t(¬S(x,y,y)⊃(S(z,v,x)&P(v,t,t))) \forall x \forall y \exists z \exists v \forall t (\neg S(x, y, y) \supset (S(z, v, x) \& P(v, t, t)))

and the system M=⟨N;S3,P3⟩\mathfrak {M} = \langle \mathbb {N}; S^{3}, P^{3} \rangle from Problem II.4.9, construct the Skolem functions (see Problem II.5.21(b)).

?
Problem II.5.25

Prove that if a formula of signature σ\sigma is satisfiable, then it is satisfiable on some algebra of terms of a signature σ′⊇σ\sigma ' \supseteq \sigma.

?
Problem II.5.26
?
(a)

Let A(u,x,y)A(u, x, y) contain no free variables other than u,xu, x, and yy. Prove that the formula ∃u∀x∃y A(u,x,y)\exists u \forall x \exists y \, A(u, x, y) is identically true if and only if the formula

∃u(∀x(∃y A(u,x,y)⊃P(u,x))⊃∀x P(u,x)), \exists u (\forall x (\exists y \, A(u, x, y) \supset P(u, x)) \supset \forall x \, P(u, x)),

where PP is a 2-ary predicate symbol not occurring in A(u,x,y)A(u, x, y), is identically true.

(b)

Prove that for every sentence AA one can construct a Skolem normal form A∗A^{*} such that AA is identically true if and only if A∗A^{*} is identically true.

Problem II.5.27

Let A∗A^{*} be a Skolem normal form of the sentence AA. Show that A∼A∗A \sim A^{*} does not hold in general. Is it always true that A⊨A∗A \vDash A^{*}? A similar question for A∗⊨AA^{*} \vDash A.

?
Problem II.5.28

Reduce to Skolem normal form:

?
(a)

(∃x∀y Q(x,y)⊃∀x∃y Q(x,y))(\exists x \forall y \, Q(x, y) \supset \forall x \exists y \, Q(x, y));

(b)

∃x∀y∃z∀v R(x,y,z,v)\exists x \forall y \exists z \forall v \, R(x, y, z, v);

(c)

∀x∃y∀v∃z R(x,y,z,v)\forall x \exists y \forall v \exists z \, R(x, y, z, v).

Problem II.5.29

Let M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle be an arbitrary model and M⊆M1M \subseteq M_{1}. Prove that there exists an extension M1=⟨M1;σ⟩\mathfrak {M}_{1} = \langle M_{1}; \sigma \rangle of the model M\mathfrak {M} such that for every formula A(x1,…,xn)A(x_{1}, \ldots , x_{n}) and any elements a1,…,an∈Ma_{1}, \ldots , a_{n} \in M,

M⊨A(a1,…,an)⇔M1⊨A(a1,…,an). \mathfrak {M} \vDash A(a_{1}, \ldots , a_{n}) \Leftrightarrow \mathfrak {M}_{1} \vDash A(a_{1}, \ldots , a_{n}).
?
Problem II.5.30

Let M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle and M={m1,…,mn}M = \left\{ m_{1}, \ldots , m_{n}\right\}. Let C(x)C(x) be a formula with free variable xx of signature σM=σ∪M\sigma_{M} = \sigma \cup M. Prove that

M⊨∃x C(x)⇔M⊨(C(m1)∨…∨C(mn)); \mathfrak {M} \vDash \exists x \, C(x) \Leftrightarrow \mathfrak {M} \vDash (C(m_{1}) \vee \ldots \vee C(m_{n})); M⊨∀x C(x)⇔M⊨(C(m1)&…&C(mn)). \mathfrak {M} \vDash \forall x \, C(x) \Leftrightarrow \mathfrak {M} \vDash (C(m_{1}) \& \ldots \& C(m_{n})).
?
Problem II.5.31

Prove that if the algebraic system M\mathfrak {M} is finite, then for every sentence AA one can construct a quantifier-free sentence A∗A^{*} relative to M\mathfrak {M} such that M⊨(A≡A∗)\mathfrak {M} \vDash (A \equiv A^{*}).

?
Problem II.5.32

Prove that if an algebraic system is finite, then for every formula one can check in finitely many steps whether it is satisfiable on this system or not.

?
Problem II.5.33

Prove that a formula of the form ∀x1…∀xm A(x1,…,xm)\forall x_{1} \ldots \forall x_{m} \, A(x_{1}, \ldots , x_{m}), where A(x1,…,xm)A(x_{1}, \ldots , x_{m}) is a quantifier-free formula without function symbols or constants, is identically true if and only if it is true in every model of mm elements.

?
Problem II.5.34

Prove that a formula of the form ∃x1…∃xm A(x1,…,xm)\exists x_{1} \ldots \exists x_{m} \, A(x_{1}, \ldots , x_{m}), where A(x1,…,xm)A(x_{1}, \ldots , x_{m}) is a quantifier-free formula without function symbols or constants, is identically true if and only if it is true in every one-element model.

?
Problem II.5.35

Prove that a formula of the form

∀x1…∀xm∃y1…∃yn A(x1,…,xm,y1,…,yn), \forall x_{1} \ldots \forall x_{m} \exists y_{1} \ldots \exists y_{n} \, A(x_{1}, \ldots , x_{m}, y_{1}, \ldots , y_{n}),

where A(x1,…,xm,y1,…,yn)A(x_{1}, \ldots , x_{m}, y_{1}, \ldots , y_{n}) is a quantifier-free formula without function symbols or constants, is identically true if and only if it is true in every model of mm elements.

?
Problem II.5.36

Let AA be a formula of signature σ=⟨P1,…,Pn⟩\sigma = \langle P_{1}, \ldots , P_{n} \rangle, where P1,…,PnP_{1}, \ldots , P_{n} are 1-ary predicate symbols. Prove that AA is satisfiable if and only if AA is satisfiable in a model containing at most 2n2^{n} elements.

?
Problem II.5.37

Are the formulas satisfiable:

?
(a)

∀x∃y(P(x)≡¬P(y))\forall x \exists y (P(x) \equiv \neg P(y));

(b)

∃x∀y∃z(P1(x)≡(P2(y)∨P3(z)))\exists x \forall y \exists z (P^{1}(x) \equiv (P^{2}(y) \vee P^{3}(z)));

(c)

∃y∀x(P(x)≡¬P(y))\exists y \forall x (P(x) \equiv \neg P(y))?

Problem II.5.38

Let σ=⟨P1,…,Pn⟩\sigma = \langle P^{1}, \ldots , P^{n} \rangle, where P1,…,PnP^{1}, \ldots , P^{n} are 1-ary predicate symbols. Prove that for every sentence AA of signature σ\sigma there exists a formula BB, equivalent to AA, built by means of , ∨\vee and ¬\neg from ∃\exists-constituents, i.e., formulas of the form ∃x(B1&…&Bs)\exists x (B_{1} \& \ldots \& B_{s}), where s≥1s \geq 1 and BiB_{i} (1≤i≤s1 \leq i \leq s) has the form P(x)P(x) or ¬P(x)\neg P(x) for some PP of σ\sigma.

?
Problem II.5.39

For an ∃\exists-constituent CC (see Problem II.5.38), denote by C(B1,…,Bn)C(B_{1}, \ldots , B_{n}) the formula obtained from CC by erasing the quantifier ∃x\exists x and replacing all occurrences of the subformulas P1(x),…,Pn(x)P^{1}(x), \ldots , P^{n}(x) in CC by B1,…,BnB_{1}, \ldots , B_{n} respectively. Prove that the formula

A=(C1&…&Ck&¬Ck+1&…&¬Ck+m), A = (C_{1} \& \ldots \& C_{k} \& \neg C_{k + 1} \& \ldots \& \neg C_{k + m}),

where C1,…,Ck+mC_{1}, \ldots , C_{k + m} are ∃\exists-constituents, k≥1k \geq 1, m≥0m \geq 0, is satisfiable if and only if the formula of the algebra of propositions

A1=(C1(B11,…,B1n)&¬Ck+1(B11,…,B1n)&…&¬Ck+m(B11,…,B1n)&…&Ck(Bk1,…,Bkn)& A_{1} = (C_{1}(B_{11}, \ldots , B_{1n}) \& \neg C_{k + 1}(B_{11}, \ldots , B_{1n}) \& \ldots \& \neg C_{k + m}(B_{11}, \ldots , B_{1n}) \& \ldots \& C_{k}(B_{k1}, \ldots , B_{kn}) \& {} &¬Ck+1(Bk1,…,Bkn)&…&¬Ck+m(Bk1,…,Bkn)) {} \& \neg C_{k + 1}(B_{k1}, \ldots , B_{kn}) \& \ldots \& \neg C_{k + m}(B_{k1}, \ldots , B_{kn}))

is satisfiable.

?
Problem II.5.40

Indicate a method for constructing, from any sentence AA with 1-ary predicates, a formula BB of the propositional calculus such that the satisfiability of the formula AA is equivalent to the satisfiability of BB.

?
Problem II.5.41

Using the method of Problem II.5.40, determine whether the following formulas are satisfiable:

?
(a)

¬∀x(P(x)⊃∀y(P(y)⊃((Q(x)⊃¬Q(y))∨∀z P(z))))\neg \forall x (P(x) \supset \forall y (P(y) \supset ((Q(x) \supset \neg Q(y)) \vee \forall z \, P(z))));

(b)

∀x∃y ¬(P(y)⊃((P(x)⊃Q(x))⊃((Q(x)⊃R(x))⊃R(y))))\forall x \exists y \, \neg (P(y) \supset ((P(x) \supset Q(x)) \supset ((Q(x) \supset R(x)) \supset R(y))));

(c)

∀x∃z∀y(((P(y)&Q(z))⊃(P(x)∨R(z)))⊃(Q(x)≡¬Q(y)))\forall x \exists z \forall y (((P(y) \& Q(z)) \supset (P(x) \vee R(z))) \supset (Q(x) \equiv \neg Q(y))).

Problem II.5.42

Write a sentence of signature ⟨=⟩\langle {=} \rangle:

?
(a)

true in every normal model containing at most nn elements (n≥1n \geq 1), and false in every other normal model;

(b)

true in every normal model containing at least nn elements (n≥1n \geq 1), and false in every other normal model;

(c)

true in every normal model containing exactly nn elements (n≥1n \geq 1), and false in every other normal model.

Problem II.5.43

Let

E1⇌∃x(x=x), E_{1} \rightleftharpoons \exists x (x = x), En⇌∃x1…∃xn(⋀1≤i<j≤n¬(xi=xj))for n≥2. E_{n} \rightleftharpoons \exists x_{1} \ldots \exists x_{n} \Bigl( \bigwedge _{1 \leq i < j \leq n} \neg (x_{i} = x_{j}) \Bigr) \quad \text{for } n \geq 2.
?
(a)

Prove that EnE_{n} is true in every normal model containing at least nn elements.

(b)

Prove the equivalence of the following formulas for normal models:

∃ν((⋀1≤i<j≤n¬(xi=xj))&⋀1≤i≤n¬(ν=xi)), \exists \nu \Bigl( \Bigl( \bigwedge _{1 \leq i < j \leq n} \neg (x_{i} = x_{j}) \Bigr) \& \bigwedge _{1 \leq i \leq n} \neg (\nu = x_{i}) \Bigr), ((⋀1≤i<j≤n¬(xi=xj))&En+1). \Bigl( \Bigl( \bigwedge _{1 \leq i < j \leq n} \neg (x_{i} = x_{j}) \Bigr) \& E_{n + 1} \Bigr).
(c)

Prove that every sentence of signature ⟨=⟩\langle {=} \rangle is equivalent on normal models to a formula built from E1,…,EnE_{1}, \ldots , E_{n} by means of , ∨\vee and ¬\neg.

(d)

Call the spectrum of a formula AA the collection of cardinalities of the normal models on which the formula AA is satisfiable. Show that every satisfiable formula built from E1,…,EnE_{1}, \ldots , E_{n} by means of , ∨\vee and ¬\neg has a spectrum that is a union of finitely many intervals of the form

{m∣a≤m≤b} and {m∣m≥a}(a∈N,b∈N). \left\{ m \mid a \leq m \leq b\right\} \text{ and } \left\{ m \mid m \geq a\right\} \quad (a \in \mathbb {N}, b \in \mathbb {N}).
(e)

Show that a sentence of signature ⟨=⟩\langle {=} \rangle is identically true on normal models if and only if it has spectrum {m∣m≥1}\left\{ m \mid m \geq 1\right\}.

Problem II.5.44

Find an infinite system of formulas of signature ⟨=⟩\langle {=} \rangle satisfiable only in infinite normal models.

?
Problem II.5.45

Give an example of a formula that is false in every normal model with an odd number of elements, and such that for every even number nn there exists a normal model of cardinality nn on which this formula is true.

?
Problem II.6.1

Prove that every sequent derivable in SC is derivable in PrSC.

?
Problem II.6.2

Let A1,…,An,AA_{1}, \ldots , A_{n}, A be formulas of SC, BB a formula of PrSC, and A1′,…,An′,A′A'_{1}, \ldots , A'_{n}, A' the formulas obtained from A1,…,An,AA_{1}, \ldots , A_{n}, A by substituting BB for the propositional variable PP. Prove that if the sequent A1,…,An⊢AA_{1}, \ldots , A_{n} \vdash A is derivable in SC, then A1′,…,An′⊢A′A'_{1}, \ldots , A'_{n} \vdash A' is derivable in PrSC.

?
Problem II.6.3

Prove that the rules of Problems II.3.3 and II.3.6 are admissible in PrSC.

?
Problem II.6.4

Let yy not be free in A(x)A(x), let yy be free for xx in A(x)A(x), and let A(y)A(y) be obtained from A(x)A(x) by replacing all free occurrences of xx by yy. Construct derivations in PrSC of the sequents:

?
(a)

∃y A(y)⊢∃x A(x)\exists y \, A(y) \vdash \exists x \, A(x);

(b)

∀y A(x)⊢∀y A(y)\forall y \, A(x) \vdash \forall y \, A(y).

Problem II.6.5

Let yy be free for xx in the formulas A1(x),…,An(x),B(x)A_{1}(x), \ldots , A_{n}(x), B(x). Prove that if A1(x),…,An(x)⊢B(x)A_{1}(x), \ldots , A_{n}(x) \vdash B(x) is derivable in PrSC, then A1(y),…,An(y)⊢B(y)A_{1}(y), \ldots , A_{n}(y) \vdash B(y) is derivable.

?
Problem II.6.6
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)
(l)
(m)
(n)
(o)
(p)
(q)
(r)
(s)
(t)
(u)
(v)
(w)
Problem II.6.7

Prove that the following sequents are derivable in PrSC:

?
(a)

(A≡B)⊢(¬A≡¬B)(A \equiv B) \vdash (\neg A \equiv \neg B);

(b)

(A≡B)⊢((A&C)≡(B&C))(A \equiv B) \vdash ((A \& C) \equiv (B \& C));

(c)

(A≡B)⊢((C&A)≡(C&B))(A \equiv B) \vdash ((C \& A) \equiv (C \& B));

(d)

(A≡B)⊢((A∨C)≡(B∨C))(A \equiv B) \vdash ((A \vee C) \equiv (B \vee C));

(e)

(A≡B)⊢((C∨A)≡(C∨B))(A \equiv B) \vdash ((C \vee A) \equiv (C \vee B));

(f)

(A≡B)⊢((A⊃C)≡(B⊃C))(A \equiv B) \vdash ((A \supset C) \equiv (B \supset C));

(g)

(A≡B)⊢((C⊃A)≡(C⊃B))(A \equiv B) \vdash ((C \supset A) \equiv (C \supset B));

(h)

∀x(A≡B)⊢(∀x A≡∀x B)\forall x (A \equiv B) \vdash (\forall x \, A \equiv \forall x \, B);

(i)

∀x(A≡B)⊢(∃x A≡∃x B)\forall x (A \equiv B) \vdash (\exists x \, A \equiv \exists x \, B).

Problem II.6.8

Let AA be a formula, BB a subformula of the formula AA, A1A_{1} the result of replacing some occurrence of BB in AA by the formula B1B_{1}, and x1,…,xnx_{1}, \ldots , x_{n} all the free variables of the formulas AA and A1A_{1}. Prove that the sequent ∀x1,…,∀xn(B≡B1)⊢(A≡A1)\forall x_{1}, \ldots , \forall x_{n} (B \equiv B_{1}) \vdash (A \equiv A_{1}) is derivable in PrSC (the replacement theorem for PrSC).

?
Problem II.6.9

Prove that for every formula AA there exists a prenex normal form A′A' such that ⊢(A≡A′)\vdash (A \equiv A') is derivable in PrSC.

?
Problem II.6.10

Find the prenex normal form for the following formulas:

?
(a)

(∀x∃y(A(x)⊃B(y,z))⊃∃x∀z(B(x,z)&A(y)))(\forall x \exists y (A(x) \supset B(y, z)) \supset \exists x \forall z (B(x, z) \& A(y))), where AA and BB are quantifier-free formulas;

(b)

(∀x P(x)⊃∀y(∀z Q(x,z)⊃∀u P(u)))(\forall x \, P(x) \supset \forall y (\forall z \, Q(x, z) \supset \forall u \, P(u))).

Problem II.6.11

Let AA be a formula built from atomic formulas and their negations by means of , ∨\vee, and the quantifiers ∀\forall and ∃\exists over arbitrary variables. Let A+A^{+} be the result of simultaneously replacing, in AA, by ∨\vee, ∨\vee by , ∀\forall by ∃\exists, ∃\exists by ∀\forall, and atomic formulas by their negations. Prove that the sequent ⊢(A+≡¬A)\vdash (A^{+} \equiv \neg A) is derivable in PrSC.

?
Problem II.6.12

Let AA be a formula built from atomic formulas and their negations by means of , ∨\vee, and the quantifiers ∀\forall and ∃\exists over arbitrary variables. Let A′A' be the result of simultaneously replacing, in AA, by ∨\vee, ∨\vee by , ∀\forall by ∃\exists, ∃\exists by ∀\forall, and atomic formulas by their negations. Prove that in PrSC:

?
(a)

if the sequent ⊢(A⊃B)\vdash (A \supset B) is derivable, then ⊢(B′⊃A′)\vdash (B' \supset A') is derivable;

(b)

if the sequent ⊢(A≡B)\vdash (A \equiv B) is derivable, then ⊢(A′⊃B′)\vdash (A' \supset B') is derivable.

Problem II.6.13

Show that a quasi-derivation in PrC from the empty set of formulas is a derivation in PrC.

?
Problem II.6.14

Are the following sequences derivations in PrC:

?
(a)

(∀x∃y A(x,y)⊃∃y A(y,y))(\forall x \exists y \, A(x, y) \supset \exists y \, A(y, y));

(b)

(∀x P(x)⊃P(y))(\forall x \, P(x) \supset P(y)), (∀x P(x)⊃∀y P(y))(\forall x \, P(x) \supset \forall y \, P(y));

(c)

(A(x)⊃∃x A(x))(A(x) \supset \exists x \, A(x)), ((A(x)⊃∃x A(x))⊃(∀x A(x)⊃(A(x)⊃∃x A(x))))((A(x) \supset \exists x \, A(x)) \supset (\forall x \, A(x) \supset (A(x) \supset \exists x \, A(x)))), (∀x A(x)⊃(A(x)⊃∃x A(x)))(\forall x \, A(x) \supset (A(x) \supset \exists x \, A(x)))?

Problem II.6.15

What requirements must the formula A(x)A(x) satisfy for the following sequence to be a derivation in PrC:

?
(a)

(A(y)⊃∃x A(x))(A(y) \supset \exists x \, A(x)), (∃y A(y)⊃∃x A(x))(\exists y \, A(y) \supset \exists x \, A(x));

(b)

(∀x A(x)⊃A(y))(\forall x \, A(x) \supset A(y)), (∀x A(x)⊃∀y A(y))(\forall x \, A(x) \supset \forall y \, A(y))?

Problem II.6.16

Prove that if A1,…,An,AA_{1}, \ldots , A_{n}, A are formulas of PC, BB is a formula of PrC, PP is a propositional variable, and A1,…,An⊢AA_{1}, \ldots , A_{n} \vdash A in PC, then A1(P\B),…,An(P\B)⊢A(P\B)A_{1}(P \backslash B), \ldots , A_{n}(P \backslash B) \vdash A(P \backslash B) in PrC.

?
Problem II.6.17

Construct derivations of the formulas in PrC:

?
(a)

(∀x∀y A(x,y)⊃∀y∀x A(x,y))(\forall x \forall y \, A(x, y) \supset \forall y \forall x \, A(x, y));

(b)

(∃x∃y A(x,y)⊃∃y∃x A(x,y))(\exists x \exists y \, A(x, y) \supset \exists y \exists x \, A(x, y));

(c)

(∃x∀y A(x,y)⊃∀y∃x A(x,y))(\exists x \forall y \, A(x, y) \supset \forall y \exists x \, A(x, y)).

Problem II.6.18

Is the sequence of formulas a derivation from Γ={(C⊃A(x))}\Gamma = \left\{ (C \supset A(x))\right\} in PrC, where CC contains no free occurrences of xx:

?
(a)

(C⊃A(x))(C \supset A(x)), (C⊃∀x A(x))(C \supset \forall x \, A(x));

(b)

((C⊃A(x))⊃(B(y)⊃(C⊃A(x))))((C \supset A(x)) \supset (B(y) \supset (C \supset A(x)))), (C⊃A(x))(C \supset A(x)), (B(y)⊃(C⊃A(x)))(B(y) \supset (C \supset A(x))), (∃y B(y)⊃(C⊃A(x)))(\exists y \, B(y) \supset (C \supset A(x))),

if CC and A(x)A(x) contain no free occurrences of yy?

Problem II.6.19

Construct derivations from Γ={∀x(A(x)⊃B(x))}\Gamma = \left\{ \forall x (A(x) \supset B(x))\right\} in PrC of the following formulas:

?
(a)

(∃x A(x)⊃∃x B(x))(\exists x \, A(x) \supset \exists x \, B(x));

(b)

(∀y A(y)⊃∀z B(z))(\forall y \, A(y) \supset \forall z \, B(z)), where yy and zz do not occur in A(x)A(x) and B(x)B(x).

Problem II.6.20

Prove that the following rules are admissible in PrC:

?
(a)

Γ⊢AB,Γ⊢A\dfrac {\Gamma \vdash A}{B, \Gamma \vdash A};

(b)

B,B,Γ⊢AB,Γ⊢A\dfrac {B, B, \Gamma \vdash A}{B, \Gamma \vdash A};

(c)

Γ,A,B,Γ1⊢CΓ,B,A,Γ1⊢C\dfrac {\Gamma , A, B, \Gamma_{1} \vdash C}{\Gamma , B, A, \Gamma_{1} \vdash C}.

Problem II.6.21

Prove the deduction theorem for PrC: if Γ,A⊢B\Gamma , A \vdash B, then Γ⊢(A⊃B)\Gamma \vdash (A \supset B).

?
Problem II.6.22

Prove that if in PrC Γ⊢A\Gamma \vdash A and Γ,A⊢B\Gamma , A \vdash B, then Γ⊢B\Gamma \vdash B.

?
Problem II.6.23

Prove that the assertion of Problem II.3.24 of 3 holds in PrC.

?
Problem II.6.24

Prove the following rules:

?
(a)

∀\forall-elimination: ∀x A(x)⊢A(t)\forall x \, A(x) \vdash A(t), where A(x)A(x) and tt are subject to the same requirements as in axiom scheme 11;

(b)

∃\exists-introduction: A(t)⊢∃x A(x)A(t) \vdash \exists x \, A(x) under the same conditions as in (a);

(c)

∀\forall-introduction: Γ⊢A(x)Γ⊢∀x A(x)\dfrac {\Gamma \vdash A(x)}{\Gamma \vdash \forall x \, A(x)}, where xx is not free in the formulas of Γ\Gamma;

(d)

∃\exists-elimination: Γ,A(x)⊢BΓ,∃x A(x)⊢B\dfrac {\Gamma , A(x) \vdash B}{\Gamma , \exists x \, A(x) \vdash B}, where xx is not free in the formulas of Γ\Gamma or in the formula BB.

Problem II.6.25

Prove that the formula A(x)A(x) is derivable in PrC if and only if the formula ∀x A(x)\forall x \, A(x) is derivable.

?
Problem II.6.26

Let z1,…,znz_{1}, \ldots , z_{n} not occur bound in A(z1,…,zn)A(z_{1}, \ldots , z_{n}) or in B(z1,…,zn)B(z_{1}, \ldots , z_{n}), and let A(z1,…,zn)⊢B(z1,…,zn)A(z_{1}, \ldots , z_{n}) \vdash B(z_{1}, \ldots , z_{n}) in PrC. Prove that there exists a derivation of B(z1,…,zn)B(z_{1}, \ldots , z_{n}) from A(z1,…,zn)A(z_{1}, \ldots , z_{n}) in PrC in which z1,…,znz_{1}, \ldots , z_{n} never occur bound.

?
Problem II.6.27

Let z1,…,znz_{1}, \ldots , z_{n} not occur bound in A(z1,…,zn)A(z_{1}, \ldots , z_{n}) or in B(z1,…,zn)B(z_{1}, \ldots , z_{n}); let x1,…,xnx_{1}, \ldots , x_{n} be variables not occurring bound in A(z1,…,zn)A(z_{1}, \ldots , z_{n}) or in B(z1,…,zn)B(z_{1}, \ldots , z_{n}). Prove that

A(z1,…,zn)⊢B(z1,…,zn)⇔A(x1,…,xn)⊢B(x1,…,xn). A(z_{1}, \ldots , z_{n}) \vdash B(z_{1}, \ldots , z_{n}) \Leftrightarrow A(x_{1}, \ldots , x_{n}) \vdash B(x_{1}, \ldots , x_{n}).
?
Problem II.6.28

Let Γ\Gamma be a set of formulas of signature σ\sigma, and AA a formula of signature σ\sigma. Prove that if Γ⊢A\Gamma \vdash A in PrC, then there exists a derivation of AA from Γ\Gamma in PrC consisting only of formulas of signature σ\sigma.

?
Problem II.6.29

Prove that if the formula AA is derivable in PrC, then the sequent ⊢A\vdash A is derivable in PrSC.

?
Problem II.6.30

Prove that:

?
(a)

if the sequent A1,…,An⊢BA_{1}, \ldots , A_{n} \vdash B is derivable in PrSC, then A1,…,An⊢BA_{1}, \ldots , A_{n} \vdash B in PrC;

(b)

if the sequent A1,…,An⊢A_{1}, \ldots , A_{n} \vdash is derivable in PrSC, then A1,…,An⊢(B&¬B)A_{1}, \ldots , A_{n} \vdash (B \& \neg B) in PrC;

(c)

if the sequent ⊢B\vdash B is derivable in PrSC, then the formula BB is derivable in PrC.

Problem II.6.31

Let AA be a formula, BB a subformula of the formula AA, and A′A' the result of replacing some occurrence of BB in AA by the formula B′B'. Prove that if ⊢(B≡B′)\vdash (B \equiv B'), then ⊢(A≡A′)\vdash (A \equiv A') (the replacement theorem for PrC).

?
Problem II.6.32

Prove that if Γ⊢A\Gamma \vdash A in PrC, then Γ⊨A\Gamma \vDash A.

?
Problem II.6.33

Prove that all formulas derivable in PrC are identically true.

?
Problem II.6.34

Prove that if a set of formulas Γ\Gamma is satisfiable, then it is consistent. (A set Γ\Gamma is satisfiable if there exist an algebraic system M\mathfrak {M} and values in M\mathfrak {M} of the free variables such that all formulas of Γ\Gamma are true for these values of the variables.)

?
Problem II.6.35

Prove that a set of formulas Γ\Gamma is inconsistent if and only if every formula is derivable in PrC from Γ\Gamma.

?
Problem II.6.36

Prove that if the sets of formulas T0,T1,T2,…T_{0}, T_{1}, T_{2}, \ldots are consistent and Ti⊆Ti+1T_{i} \subseteq T_{i + 1} (i=0,1,2,…i = 0, 1, 2, \ldots), then ⋃i∈NTi\bigcup_{i \in \mathbb {N}} T_{i} is a consistent set of formulas.

?
Problem II.6.37

Prove the Lindenbaum theorem: every consistent set of formulas TT can be extended to a complete consistent set of the same signature.

?
Problem II.6.38
(a)
(b)
(c)
(e)
Problem II.6.39

Let a set Γ\Gamma of formulas of signature σ\sigma be complete and satisfy the condition: for every formula of signature σ\sigma with one free variable xx, if Γ⊢∃x A(x)\Gamma \vdash \exists x \, A(x), then Γ⊢A(t)\Gamma \vdash A(t) for some closed term tt of signature σ\sigma. Prove that:

?
(a)

Γ⊢∃x A(x)⇔Γ⊢A(t)\Gamma \vdash \exists x \, A(x) \Leftrightarrow \Gamma \vdash A(t) for some closed term tt of signature σ\sigma;

(b)

Γ⊢∀x A(x)⇔Γ⊢A(t)\Gamma \vdash \forall x \, A(x) \Leftrightarrow \Gamma \vdash A(t) for every closed term tt of signature σ\sigma.

Problem II.6.40

Let the set Γ∪{∃x A(x)}\Gamma \cup \left\{ \exists x \, A(x)\right\} be consistent. Prove that if the variable yy does not occur in Γ\Gamma or in ∃x A(x)\exists x \, A(x), then the set Γ∪{∃x A(x),A(y)}\Gamma \cup \left\{ \exists x \, A(x), A(y)\right\} is consistent.

?
Problem II.6.41

Prove that every consistent set of sentences is satisfiable (the model existence theorem).

?
Problem II.6.42

Prove the Lowenheim--Skolem theorem: every satisfiable set of sentences is satisfiable in some countable algebraic system.

?
Problem II.6.43

Prove that if the sentence AA is not derivable in PrC, then ¬A\neg A is satisfiable on the natural numbers.

?
Problem II.6.44

Prove that the formula AA is identically true if and only if AA is derivable in PrC (Godel's completeness theorem for PrC).

?
Problem II.6.45

Show that if the sentence AA is true in every system on the natural numbers, then AA is identically true.

?
Problem II.6.46

Prove that if the sentence AA is satisfiable in some system, then AA is satisfiable on the natural numbers.

?
Problem II.6.47

Prove that if the sentence AA is true in every system on which the formulas of a countable set Γ\Gamma are true, then Γ⊢A\Gamma \vdash A.

?
Problem II.6.48

Prove that if a set of sentences Γ\Gamma is countable and every finite subset Γ1⊆Γ\Gamma_{1} \subseteq \Gamma is satisfiable, then the whole set Γ\Gamma is satisfiable (Mal'tsev's local theorem).

?
Problem II.6.49

Prove that if the negation of every conjunction of finitely many sentences of a countable set Γ\Gamma is unprovable in PrC, then the set Γ\Gamma is satisfiable.

?
Problem II.6.50

Prove, for every sentence AA and every countable set Γ\Gamma,

Γ⊨A⇔Γ⊢A \Gamma \vDash A \Leftrightarrow \Gamma \vdash A

(the adequacy theorem).

?
Problem II.6.51

Prove that if Γ\Gamma is a countable set of sentences and Γ⊢A\Gamma \vdash A, then Γ1⊢A\Gamma_{1} \vdash A for some finite subset Γ1⊆Γ\Gamma_{1} \subseteq \Gamma (Mal'tsev's compactness theorem).

?
Problem II.6.52

Prove that, for AA to be derivable in PrC, it is not sufficient that AA be true in every finite system.

?
Problem II.6.53

Let AA be a quantifier-free formula of PrC. Prove that AA is derivable in PrC if and only if AA is derivable using only axioms 1--10 by rule I.

?
Problem II.6.54

Are the formulas derivable in PrC:

?
(a)

(∃x A(x)⊃∀x A(x))(\exists x \, A(x) \supset \forall x \, A(x));

(b)

¬(∃x A(x)⊃∀x A(x))\neg (\exists x \, A(x) \supset \forall x \, A(x));

(c)

(∃x∀y A(x,y)⊃∀y∃x A(x,y))(\exists x \forall y \, A(x, y) \supset \forall y \exists x \, A(x, y));

(d)

(∀x∃y A(x,y)⊃∃y∀x A(x,y))(\forall x \exists y \, A(x, y) \supset \exists y \forall x \, A(x, y));

(e)

((∀x A(x)⊃∃x B(x))≡∃x(A(x)⊃B(x)))((\forall x \, A(x) \supset \exists x \, B(x)) \equiv \exists x (A(x) \supset B(x)))?

Problem II.7.1

Prove that the following are derivable in PrCE of signature σ\sigma:

?
(a)

((x1=y1&…&xn=yn)⊃t(x1,…,xn)=t(y1,…,yn))((x_{1} = y_{1} \& \ldots \& x_{n} = y_{n}) \supset t(x_{1}, \ldots , x_{n}) = t(y_{1}, \ldots , y_{n})) for every term tt of signature σ\sigma;

(b)

((x1=y1&…&xn=yn)⊃(A(x1,…,xn)≡A(y1,…,yn)))((x_{1} = y_{1} \& \ldots \& x_{n} = y_{n}) \supset (A(x_{1}, \ldots , x_{n}) \equiv A(y_{1}, \ldots , y_{n}))) for every formula AA of signature σ\sigma.

Problem II.7.2

Prove that if Γ\Gamma is a set of axioms of the theory TT of signature σ\sigma, and M\mathfrak {M} is an algebraic system of signature σ\sigma in which all formulas of Γ\Gamma are true, then all theorems of the theory TT are true in M\mathfrak {M}.

?
Problem II.7.3

Let the sentence AA be true in every system in which all axioms of the theory TT are true. Prove that AA belongs to TT.

?
Problem II.7.4

Prove that if all axioms of the theory TT are true in some algebraic system, then there exists a model of the theory TT.

?
Problem II.7.5

Prove that every consistent theory has a model.

?
Problem II.7.6

Prove that if the sentence AA is true in every model of the theory TT, then AA is a theorem of the theory TT (the completeness theorem for PrCE).

?
Problem II.7.7

Let the sentence ∀x1…∀xn∃!y A(x1,…,xn,y)\forall x_{1} \ldots \forall x_{n} \exists ! y \, A(x_{1}, \ldots , x_{n}, y) be a theorem of the theory TT of signature σ\sigma. Let the theory T1T_{1} of signature σ′=σ∪{fn}\sigma ' = \sigma \cup \left\{ f^{n}\right\}, where fn∉σf^{n} \notin \sigma, have as axioms all axioms of the theory TT and

∀x1…∀xn A(x1,…,xn,fn(x1,…,xn)). \forall x_{1} \ldots \forall x_{n} \, A(x_{1}, \ldots , x_{n}, f^{n}(x_{1}, \ldots , x_{n})).
?
(a)

Prove that for every formula BB of signature σ′\sigma ' there exists a formula B∗B^{*} of signature σ\sigma satisfying the conditions:

  1. if fnf^{n} does not occur in BB, then B∗=BB^{*} = B;

  2. (B∗≡B)(B^{*} \equiv B) is a theorem of the theory T1T_{1}.

(b)

Prove that if BB does not contain fnf^{n} and is a theorem of the theory T1T_{1}, then BB is a theorem of TT.

Problem II.7.8

Prove that if an elementary theory TT has an infinite model, then TT also has a countable model.

?
Problem II.7.9

Prove that the theory TT has a model if and only if every finite subset T1⊆TT_{1} \subseteq T is satisfiable.

?
Problem II.7.10

Prove that if, for every natural number nn, the theory TT has a model of cardinality greater than nn, then this theory has an infinite model.

?
Problem II.7.11

Prove that there is no sentence true in every finite model and false in every infinite model.

?
Problem II.7.12

Prove that if the sentence AA is true in every infinite group, then AA is true in every finite group of sufficiently large order.

?
Problem II.7.13

Prove that the theory of equality EE is incomplete.

?
Problem II.7.14

Prove that a sentence AA of signature ⟨=⟩\langle {=} \rangle is true in every normal system if and only if AA is a theorem of the theory EE.

?
Problem II.7.15

Construct an algorithm that, for any sentence of signature ⟨=⟩\langle {=} \rangle, determines whether this sentence is a theorem of the theory EE.

?
Problem II.7.16

Are the following sentences theorems of the theory EE:

?
(a)

∀x∃y∀z(¬z=x∨¬y=z)\forall x \exists y \forall z (\neg z = x \vee \neg y = z);

(b)

∀x∃y∀z∃v(v=z&¬(z=x&¬x=y&v=y))\forall x \exists y \forall z \exists v (v = z \& \neg (z = x \& \neg x = y \& v = y))?

Problem II.7.17

Let the signature σ\sigma contain a single 2-ary predicate PP, and let TT be the set of sentences derivable from Γ={A1,A2}\Gamma = \left\{ A_{1}, A_{2}\right\}, where

A1=∀x∀y(P(x,y)⊃¬P(y,x)), A_{1} = \forall x \forall y (P(x, y) \supset \neg P(y, x)), A2=∀x∀y∀z(P(x,y)⊃(P(y,z)⊃P(x,z))). A_{2} = \forall x \forall y \forall z (P(x, y) \supset (P(y, z) \supset P(x, z))).

Is TT a complete theory?

?
Problem II.7.18

Prove that QQ is a consistent theory.

?
Problem II.7.19

Is the system of sentences {Q1,…,Q7}\left\{ Q_{1}, \ldots , Q_{7}\right\} independent?

?
Problem II.7.20
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)
(l)
Problem II.7.21

Prove the derivability in QQ of the formulas:

?
(a)

(x+y=0⊃(x=0&y=0))(x + y = 0 \supset (x = 0 \& y = 0));

(b)

(x⋅y=0⊃(x=0∨y=0))(x \cdot y = 0 \supset (x = 0 \vee y = 0)).

Problem II.7.22

Prove that every model of the theory QQ is infinite.

?
Problem II.7.23

Define the constant 0 and the functions s,+\mathbf{s}, + and ⋅\cdot so that the model of the theory QQ becomes the set:

?
(a)

N={0,1,2,…}\mathbb {N} = \left\{ 0, 1, 2, \ldots \right\};

(b)

N∪{a}={0,1,2,…;a}\mathbb {N} \cup \left\{ a\right\} = \left\{ 0, 1, 2, \ldots ; a\right\} (a∉Na \notin \mathbb {N});

(c)

N∪{a,b}={0,1,2,…;a,b}\mathbb {N} \cup \left\{ a, b\right\} = \left\{ 0, 1, 2, \ldots ; a, b\right\} (a,b∉Na, b \notin \mathbb {N});

(d)

N∪N′={0,1,2,…;a0,a1,a2,…}\mathbb {N} \cup \mathbb {N}' = \left\{ 0, 1, 2, \ldots ; a_{0}, a_{1}, a_{2}, \ldots \right\} (ai∉Na_{i} \notin \mathbb {N} for all ii and ai≠aja_{i} \neq a_{j} for i≠ji \neq j).

Problem II.7.24

Can the constant 0 and the functions s,+\mathbf{s}, + and ⋅\cdot be defined so that the model of the theory QQ becomes:

?
(a)

the set of all integers;

(b)

the set of all nonnegative rational numbers;

(c)

the set of all rational numbers?

Problem II.7.25

Prove that the theory PP is consistent.

?
Problem II.7.26

Prove the dependence of the axioms of the theory PP.

?
Problem II.7.27

Prove that all formulas of Problem II.7.20 are theorems of the theory PP.

?
Problem II.7.28

Prove that there exists a nonstandard (i.e., not isomorphic to the system N\mathfrak {N}) model of the theory PP.

?
Problem II.7.29

Prove that the following formulas are theorems of PP:

?
(a)

(x+y=y+z⊃x=y)(x + y = y + z \supset x = y);

(b)

(¬z=0⊃(x⋅z=y⋅z⊃x=y))(\neg z = 0 \supset (x \cdot z = y \cdot z \supset x = y)).

Problem II.7.30
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)
(l)
(m)
(n)
Problem II.7.31

Prove that for every formula A(x)A(x) with one free variable xx, the following formulas are theorems of PP:

?
(a)

(∀x(∀z(z<x⊃A(z))⊃A(x))⊃∀x A(x))(\forall x (\forall z (z < x \supset A(z)) \supset A(x)) \supset \forall x \, A(x)) (strong induction);

(b)

(∃x A(x)⊃∃y(A(y)&∀z(z<y⊃¬A(z))))(\exists x \, A(x) \supset \exists y (A(y) \& \forall z (z < y \supset \neg A(z)))) (the least-number principle);

(c)

(∀x(A(x)⊃∃y(y<x&A(y)))⊃∀x ¬A(x))(\forall x (A(x) \supset \exists y (y < x \& A(y))) \supset \forall x \, \neg A(x)) (the method of infinite descent).

Problem II.7.32

Let us introduce the following abbreviations:

x=rest(y,z)⇌((x<z&∃u(y=u⋅z+x))∨(z=0&x=y)); x = \mathrm{rest}(y, z) \rightleftharpoons ((x < z \& \exists u (y = u \cdot z + x)) \vee (z = 0 \& x = y)); z=⌊xy⌋⇌(∃u(u<y&x=z⋅y+u)∨(y=0&x=z)). z = \left\lfloor \frac{x}{y} \right\rfloor \rightleftharpoons (\exists u (u < y \& x = z \cdot y + u) \vee (y = 0 \& x = z)).

Prove that the following formulas are theorems of PP:

?
(a)

∀x∀y∃!z(z=rest(y,x))\forall x \forall y \exists ! z (z = \mathrm{rest}(y, x));

(b)

∀x∀y∃!(z=⌊xy⌋)\forall x \forall y \exists ! \left( z = \left\lfloor \dfrac {x}{y} \right\rfloor \right).

Problem II.7.33

Write a formula Pr(x)\mathrm{Pr}(x) such that Pr(Δn)\mathrm{Pr}(\Delta_{n}) is a theorem of the theory PP if and only if nn is a prime number.

?
Problem II.7.34

Let us introduce the following abbreviations:

x/y⇌∃z(y=x⋅z); x / y \rightleftharpoons \exists z (y = x \cdot z); z=d(x,y)⇌(z/x&z/y&∀u((u/x&u/y)⊃u/z)); z = d(x, y) \rightleftharpoons (z / x \& z / y \& \forall u ((u / x \& u / y) \supset u / z)); z=dn(x1,…,xn)⇌∃u(z=d(x1,u)&u=dn−1(x2,…,xn))(n>2); z = d_{n}(x_{1}, \ldots , x_{n}) \rightleftharpoons \exists u (z = d(x_{1}, u) \& u = d_{n - 1}(x_{2}, \ldots , x_{n})) \quad (n > 2); u=β(x,y,z)⇌u=rest(x,1+y⋅(z+1)). u = \beta (x, y, z) \rightleftharpoons u = \mathrm{rest}(x, 1 + y \cdot (z + 1)).

Prove that the following formulas are theorems of PP:

?
(a)

∀x1,…,∀xn∃!y(y=dn(x1,…,xn))\forall x_{1}, \ldots , \forall x_{n} \exists ! y (y = d_{n}(x_{1}, \ldots , x_{n}));

(b)

∀x∀y∀z∃!u(u=β(x,y,z))\forall x \forall y \forall z \exists ! u (u = \beta (x, y, z));

(c)

∀x∀y∀z∀u((z=d(x,y)&u=rest(x,y))⊃z=d(y,u))\forall x \forall y \forall z \forall u ((z = d(x, y) \& u = \mathrm{rest}(x, y)) \supset z = d(y, u));

(d)

∀x∀y((¬x=0&¬y=0&d(x,y)=s(0))⊃∃z∃u∃v∃w(x⋅z=y⋅u+s(0)&y⋅v=x⋅w+s(0)))\forall x \forall y ((\neg x = 0 \& \neg y = 0 \& d(x, y) = \mathbf{s}(0)) \supset \exists z \exists u \exists v \exists w (x \cdot z = y \cdot u + \mathbf{s}(0) \& y \cdot v = x \cdot w + \mathbf{s}(0)));

(e)

∀x1,…,∀xn∀y1,…,∀yn((dn(x1,…,xn)=Δ1&y1<x1&…&yn<xn)⊃∃z(rest(z,x1)=y1&…&rest(z,xn)=yn))\forall x_{1}, \ldots , \forall x_{n} \forall y_{1}, \ldots , \forall y_{n} ((d_{n}(x_{1}, \ldots , x_{n}) = \Delta_{1} \& y_{1} < x_{1} \& \ldots \& y_{n} < x_{n}) \supset \exists z (\mathrm{rest}(z, x_{1}) = y_{1} \& \ldots \& \mathrm{rest}(z, x_{n}) = y_{n}));

(f)

∀x∀y∀z∀u∃x1∃y1(∀v(v≤z⊃β(x,y,v)=β(x1,y1,v))&β(x1,y1,s(z))=u)\forall x \forall y \forall z \forall u \exists x_{1} \exists y_{1} (\forall v (v \leq z \supset \beta (x, y, v) = \beta (x_{1}, y_{1}, v)) \& \beta (x_{1}, y_{1}, \mathbf{s}(z)) = u).

Problem II.7.35

Prove that every theorem of the theory RR is a theorem of the theory QQ.

?
Problem II.7.36

Is the system of formulas

{R1(np)∣n,p∈N}∪{R2(np)∣n,p∈N}∪{R3(np)∣n,p∈N,n≠p}∪{R4(n)∣n∈N}∪{R5(n)∣n∈N} \left\{ R_{1}^{(np)} \mid n, p \in \mathbb {N}\right\} \cup \left\{ R_{2}^{(np)} \mid n, p \in \mathbb {N}\right\} \cup \left\{ R_{3}^{(np)} \mid n, p \in \mathbb {N}, n \neq p\right\} \cup \left\{ R_{4}^{(n)} \mid n \in \mathbb {N}\right\} \cup \left\{ R_{5}^{(n)} \mid n \in \mathbb {N}\right\}

independent?

?
Problem II.7.37

Prove that the standard model of arithmetic is isomorphically embeddable in every model of the theory QQ.

?
Problem II.7.38
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)
(l)
(m)
Problem II.7.39

Prove in ZF the following theorems:

?
(a)

¬x∈x\neg x \in x;

(b)

¬(x∈y&y∈x)\neg (x \in y \& y \in x);

(c)

¬(x∈y&y∈z&z∈x)\neg (x \in y \& y \in z \& z \in x).

Problem II.7.40

Prove that the following statements about ordinal numbers are theorems of ZF:

?
(a)

(Ord(z)⊃(y∈z⊃(x∈y⊃x∈z)))(\mathrm{Ord}(z) \supset (y \in z \supset (x \in y \supset x \in z)));

(b)

((Ord(x)&y∈x)⊃Ord(y))((\mathrm{Ord}(x) \& y \in x) \supset \mathrm{Ord}(y));

(c)

(Ord(x)⊃W(x))(\mathrm{Ord}(x) \supset W(x)), where W(x)W(x) is a formula meaning that ∈\in is a total irreflexive order on xx;

(d)

((Ord(x)&y=x∪{x})⊃Ord(y))((\mathrm{Ord}(x) \& y = x \cup \left\{ x\right\} ) \supset \mathrm{Ord}(y));

(e)

((Ord(x)&∀y(∀z(z∈y⊃A(z))⊃A(y)))⊃A(x))((\mathrm{Ord}(x) \& \forall y (\forall z (z \in y \supset A(z)) \supset A(y))) \supset A(x)), where A(x)A(x) is a formula with one free variable xx (transfinite induction);

(f)

((Ord(x)&Ord(y))⊃(x∈y∨y∈x∨x=y))((\mathrm{Ord}(x) \& \mathrm{Ord}(y)) \supset (x \in y \vee y \in x \vee x = y));

(g)

((Ord(x)&¬x=0)⊃0∈x)((\mathrm{Ord}(x) \& \neg x = 0) \supset 0 \in x);

(h)

((Ord(x)&Ord(y)&x∈y)⊃∀u∀v((MA(u,x)&MA(v,y))⊃u=v))((\mathrm{Ord}(x) \& \mathrm{Ord}(y) \& x \in y) \supset \forall u \forall v ((M_{A}(u, x) \& M_{A}(v, y)) \supset u = v)).

Problem II.7.41

Prove in ZF the following theorems:

?
(a)

(∀y(y∈x⊃Ord(y))⊃Ord(∪x))(\forall y (y \in x \supset \mathrm{Ord}(y)) \supset \mathrm{Ord}(\cup x));

(b)

((¬x=0&∀y(y∈x⊃Ord(y)))⊃Ord(∩x))((\neg x = 0 \& \forall y (y \in x \supset \mathrm{Ord}(y))) \supset \mathrm{Ord}(\cap x));

(c)

∃x L(x)\exists x \, L(x);

(d)

∃!x(x=ω)\exists ! x (x = \omega );

(e)

(Ord(ω)&0∈ω&∀x(x∈ω⊃x∪{x}∈ω))(\mathrm{Ord}(\omega ) \& 0 \in \omega \& \forall x (x \in \omega \supset x \cup \left\{ x\right\} \in \omega )).

Problem II.7.42

Prove in ZF the following theorems:

?
(a)

(N(x)⊃Ord(x))(N(x) \supset \mathrm{Ord}(x));

(b)

((N(x)&y∈x)⊃N(y))((N(x) \& y \in x) \supset N(y));

(c)

∀x(N(x)⊃∃!y(N(y)&y=s(x)))\forall x (N(x) \supset \exists ! y (N(y) \& y = \mathbf{s}(x)));

(d)

((N(x)&N(y)&s(x)=s(y))⊃x=y)((N(x) \& N(y) \& \mathbf{s}(x) = \mathbf{s}(y)) \supset x = y);

(e)

¬s(x)=0\neg \mathbf{s}(x) = 0;

(f)

((N(x)&¬x=0)⊃∃y(N(y)&x=s(y)))((N(x) \& \neg x = 0) \supset \exists y (N(y) \& x = \mathbf{s}(y))).

Problem II.7.43

Prove in ZF the induction principle for natural numbers: for every formula A(x)A(x) with one free variable xx,

((A(0)&∀x((N(x)&A(x))⊃A(s(x))))⊃∀y(N(y)⊃A(y))). ((A(0) \& \forall x ((N(x) \& A(x)) \supset A(\mathbf{s}(x)))) \supset \forall y (N(y) \supset A(y))).
?
Problem II.7.44

Prove in ZF the following theorems:

?
(a)

∀x∀y((N(x)&N(y))⊃∃!z(N(z)&x+y=z))\forall x \forall y ((N(x) \& N(y)) \supset \exists ! z (N(z) \& x + y = z));

(b)

∀x(N(x)⊃x+0=x)\forall x (N(x) \supset x + 0 = x);

(c)

∀x∀y((N(x)&N(y))⊃x+s(y)=s(x+y))\forall x \forall y ((N(x) \& N(y)) \supset x + \mathbf{s}(y) = \mathbf{s}(x + y));

(d)

∀x∀y((N(x)&N(y))⊃∃!z(N(z)&x⋅y=z))\forall x \forall y ((N(x) \& N(y)) \supset \exists ! z (N(z) \& x \cdot y = z));

(e)

∀x(N(x)⊃x⋅0=0)\forall x (N(x) \supset x \cdot 0 = 0);

(f)

∀x∀y((N(x)&N(y))⊃x⋅s(y)=x⋅y+x)\forall x \forall y ((N(x) \& N(y)) \supset x \cdot \mathbf{s}(y) = x \cdot y + x).

Problem II.7.45

Prove that if AA is a theorem of the theory PP, then the formula ρN(A)\rho_{N}(A), obtained from AA by relativizing the quantifiers with respect to NN, is a theorem of the theory ZF.

?
Problem II.8.1

Prove that if DD is a filter over II, then I∈DI \in D.

?
Problem II.8.2

Let X⊆IX \subseteq I. Prove that {Y∣Y⊆I and X⊆Y}\left\{ Y \mid Y \subseteq I \text{ and } X \subseteq Y\right\} is a filter over II.

?
Problem II.8.3

Let DD be a filter over II and J∈DJ \in D. Show that D1={X∩J∣X∈D}D_{1} = \left\{ X \cap J \mid X \in D\right\} is a filter over JJ, and also that if DD is a nonprincipal filter, then D1D_{1} is also a nonprincipal filter.

?
Problem II.8.4

Prove that if some finite set belongs to a filter, then this filter is principal.

?
Problem II.8.5

Prove that every nonprincipal ultrafilter contains all sets having finite complements.

?
Problem II.8.6

Prove that a filter DD over II is an ultrafilter if and only if DD is a maximal element in the set of all filters over II, ordered by inclusion.

?
Problem II.8.7

Prove that in the set Φ\Phi of all filters over II, ordered by inclusion, {I}\left\{ I\right\} is the least element. Show also that if ∣I∣≥2\left|I\right| \geq 2, then Φ\Phi has no greatest element.

?
Problem II.8.8

Prove that, for a filter over II containing the set S⊆P(I)S \subseteq \mathcal{P}(I) to exist, it is necessary and sufficient that the intersection of any finite number of elements of SS be nonempty.

?
Problem II.8.9

Let II be an infinite set of cardinality α\alpha and

Φ={X∣X⊆I and ∣X∣<α}. \Phi = \left\{ X \mid X \subseteq I \text{ and } \left|X\right| < \alpha \right\} .

Prove that Φ\Phi is a filter over II.

?
Problem II.8.10

Prove that a system Ψ\Psi of subsets of a set II is contained in some Frechet filter if and only if every intersection of finitely many sets of the system Ψ\Psi has cardinality equal to the cardinality of the set II.

?
Problem II.8.11

Show that every nonprincipal ultrafilter over a countable set is a Frechet filter.

?
Problem II.8.12

Let FF be a filter over II, A⊆IA \subseteq I, and FA={X∩A∣X∈F}F_{A} = \left\{ X \cap A \mid X \in F\right\}. Prove that, for FAF_{A} to be a filter over AA, it is necessary and sufficient that X∩A≠∅X \cap A \neq \emptyset for every X∈FX \in F.

?
Problem II.8.13

Let FF be an ultrafilter over II, A⊆IA \subseteq I, and FA={X∩A∣X∈F}F_{A} = \left\{ X \cap A \mid X \in F\right\}. Prove that, for FAF_{A} to be an ultrafilter over AA, it is necessary and sufficient that AA belong to FF.

?
Problem II.8.14

Show that every filter can be extended to an ultrafilter.

?
Problem II.8.15

Prove that every filter is the intersection of all ultrafilters containing it.

?
Problem II.8.16

Let FF and GG be filters over II. Prove that

F∩G={X∪Y∣X∈F and Y∈G}. F \cap G = \left\{ X \cup Y \mid X \in F \text{ and } Y \in G\right\} .
?
Problem II.8.17

Prove that if the union of a finite sequence {Ai}i≤n\left\{ A_{i}\right\}_{i \leq n} of subsets of a set II belongs to an ultrafilter FF, then at least one of the sets AiA_{i} belongs to FF.

?
Problem II.8.18

Let FF be an ultrafilter and G1,…,GnG_{1}, \ldots , G_{n} filters over II. Prove that if F⊇G1∩…∩GnF \supseteq G_{1} \cap \ldots \cap G_{n}, then there exists ii (1≤i≤n1 \leq i \leq n) such that F⊇GiF \supseteq G_{i}.

?
Problem II.8.19

Let the set JJ be infinite. Construct an ultrafilter FF and a family of ultrafilters {Gj}j∈J\left\{ G_{j}\right\}_{j \in J} such that F⊇⋂j∈JGjF \supseteq \bigcap_{j \in J} G_{j}, but FF does not contain GjG_{j} for any jj.

?
Problem II.8.20

Prove that ⋂X∈FX\bigcap_{X \in F} X, where FF is an ultrafilter, contains at most one point.

?
Problem II.8.21

Let DD be a filter over II and ∼\sim some equivalence relation on II. Let D∼={B∣∃A(A∈D&B={[x]∼∣x∈A})}D^{\sim } = \left\{ B \mid \exists A (A \in D \& B = \left\{ [x]_{\sim } \mid x \in A\right\} )\right\}. Prove that:

?
(a)

D∼D^{\sim } is a filter over I/∼I / {\sim };

(b)

if DD is an ultrafilter, then D∼D^{\sim } is an ultrafilter;

(c)

if DD is an ultrafilter and [x]∼∉D[x]_{\sim } \notin D for every xx, then D∼D^{\sim } is a nonprincipal ultrafilter.

Problem II.8.22

Prove that a filter DD over II is countably complete if and only if there is no decreasing sequence X0⊃X1⊃X2⊃…X_{0} \supset X_{1} \supset X_{2} \supset \ldots of elements Xi∈DX_{i} \in D such that ⋂i∈NXi=∅\bigcap_{i \in \mathbb {N}} X_{i} = \emptyset.

?
Problem II.8.23

Prove that ∼D\sim_{D} is an equivalence relation on ∏i∈IMi\prod_{i \in I} M_{i}.

?
Problem II.8.24

Prove that if f1∼Dg1,…,fn∼Dgnf_{1} \sim_{D} g_{1}, \ldots , f_{n} \sim_{D} g_{n}, then:

?
(a)

Pn(f1/D,…,fn/D)=Pn(g1/D,…,gn/D)P^{n}(f_{1} / D, \ldots , f_{n} / D) = P^{n}(g_{1} / D, \ldots , g_{n} / D);

(b)

Fn(f1,…,fn)∼DFn(g1,…,gn)F^{n}(f_{1}, \ldots , f_{n}) \sim_{D} F^{n}(g_{1}, \ldots , g_{n}).

Problem II.8.25

Prove that for every II,

∏i∈IMi≅∏i∈IMi/D, \prod _{i \in I} \mathfrak {M}_{i} \cong \prod _{i \in I} \mathfrak {M}_{i} / D,

where D={I}D = \left\{ I\right\}.

?
Problem II.8.26

Prove that the canonical mapping φ:∏i∈IMi→∏i∈IMi/D\varphi : \prod_{i \in I} \mathfrak {M}_{i} \to \prod_{i \in I} \mathfrak {M}_{i} / D, where φ(f)=f/D\varphi (f) = f / D, is a homomorphism of ∏i∈IMi\prod_{i \in I} \mathfrak {M}_{i} onto ∏i∈IMi/D\prod_{i \in I} \mathfrak {M}_{i} / D. Show that, in general, this homomorphism is not a strong homomorphism.

?
Problem II.8.27

Prove that if a sentence containing neither ¬\neg nor ⊃\supset is true on the direct product ∏i∈IMi\prod_{i \in I} \mathfrak {M}_{i}, then it is true on the filtered product ∏i∈IMi/D\prod_{i \in I} \mathfrak {M}_{i} / D with respect to any filter DD.

?
Problem II.8.28

Prove that if D,D1D, D_{1} are filters over II and D⊆D1D \subseteq D_{1}, then the mapping φ\varphi defined by φ(f/D)=f/D1\varphi (f / D) = f / D_{1} is a homomorphism of ∏i∈IMi/D\prod_{i \in I} \mathfrak {M}_{i} / D onto ∏i∈IMi/D1\prod_{i \in I} \mathfrak {M}_{i} / D_{1}.

?
Problem II.8.29

Let J∈DJ \in D, where DD is a filter over II. Show that

∏i∈IMi/D≅∏j∈JMj/DJ, \prod _{i \in I} \mathfrak {M}_{i} / D \cong \prod _{j \in J} \mathfrak {M}_{j} / D_{J},

where DJD_{J} is the filter formed by the intersections of JJ with the sets of the filter DD. In particular, if DD is a principal filter consisting of subsets of the set JJ, then

∏i∈IMi/D≅∏j∈JMj. \prod _{i \in I} \mathfrak {M}_{i} / D \cong \prod _{j \in J} \mathfrak {M}_{j}.
?
Problem II.8.30

Let II be finite and DD a filter over II. Prove that ∏i∈IMi/D\prod_{i \in I} \mathfrak {M}_{i} / D is isomorphic to the direct product of some of the systems Mi\mathfrak {M}_{i}.

?
Problem II.8.31

Let {Ik∣k∈K}\left\{ I_{k} \mid k \in K\right\} be a partition of II, let filters DkD_{k} be given over IkI_{k}, and let a filter D∗D^{*} be given over KK. Show that

D={X⊆I∣{k∣k∈K and X∩Ik∈Dk}∈D∗} D = \left\{ X \subseteq I \mid \left\{ k \mid k \in K \text{ and } X \cap I_{k} \in D_{k}\right\} \in D^{*}\right\}

is a filter over II and, for all Mi\mathfrak {M}_{i} (i∈Ii \in I),

∏i∈IMi/D≅∏k∈K(∏i∈IkMi/Dk)/D∗ \prod _{i \in I} \mathfrak {M}_{i} / D \cong \prod _{k \in K} \left( \prod _{i \in I_{k}} \mathfrak {M}_{i} / D_{k} \right) \Big/ D^{*}

(the associative law for filtered products).

?
Problem II.8.32

Prove that if the intersection JJ of all sets of a filter DD over II is nonempty and does not belong to DD, then

∏i∈IMi/D≅∏j∈JMj⋅(∏k∈J′Mk/DJ′), \prod _{i \in I} \mathfrak {M}_{i} / D \cong \prod _{j \in J} \mathfrak {M}_{j} \cdot \left( \prod _{k \in J'} \mathfrak {M}_{k} / D_{J'} \right),

where J′=I\JJ' = I \backslash J and DJ′D_{J'} is the filter over J′J' formed by the intersections of J′J' with all sets of the filter DD.

?
Problem II.8.33

Let φi:Mi→Ni\varphi_{i}: M_{i} \to N_{i} be homomorphisms, and let φ(f/D)=(φ′(f))/D\varphi (f / D) = (\varphi '(f)) / D, where (φ′(f))(j)=φj(f(j))(\varphi '(f))(j) = \varphi_{j}(f(j)) for f∈∏i∈IMif \in \prod_{i \in I} M_{i}, j∈Jj \in J. Prove that then φ\varphi is a homomorphism of ∏i∈IMi/D\prod_{i \in I} \mathfrak {M}_{i} / D into ∏i∈INi/D\prod_{i \in I} \mathfrak {N}_{i} / D. Prove that if the φi\varphi_{i} are strong homomorphisms (isomorphisms), then so is φ\varphi.

?
Problem II.8.34

Let φ\varphi be a one-to-one correspondence between II and JJ, let DD be a filter over II, and D1={φ(X)∣X∈D}D_{1} = \left\{ \varphi (X) \mid X \in D\right\}. Prove that

∏i∈IMi/D≅∏j∈JMφ−1(j)/D1. \prod _{i \in I} \mathfrak {M}_{i} / D \cong \prod _{j \in J} \mathfrak {M}_{\varphi ^{-1}(j)} / D_{1}.
?
Problem II.8.35

Let {Ci∣i∈I}\left\{ C_{i} \mid i \in I\right\} be a family of sets, and let an equivalence relation ∼\sim be given on II such that i∼j⇒Ci=Cji \sim j \Rightarrow C_{i} = C_{j}. Prove that for every ultrafilter DD over II there exists an isomorphic embedding of ∏α∈I/∼Cα/D∼\prod_{\alpha \in I / {\sim }} C_{\alpha } / D^{\sim } into ∏i∈ICi/D\prod_{i \in I} C_{i} / D, where D∼D^{\sim } is constructed as in Problem II.8.21, and Cα=CiC_{\alpha } = C_{i} for α∈I/∼\alpha \in I / {\sim } and i∈αi \in \alpha.

?
Problem II.8.36

Let {Ik}k∈K\left\{ I_{k}\right\}_{k \in K} be the family of all finite nonempty subsets of II, and let {Mi}i∈I\left\{ \mathfrak {M}_{i}\right\}_{i \in I} be a family of algebraic systems of signature σ\sigma. Prove that there exists a filter DD over KK such that for every filter D1⊇DD_{1} \supseteq D over KK there exists an isomorphic embedding of ∏i∈IMi\prod_{i \in I} \mathfrak {M}_{i} into ∏k∈K(∏i∈IkMi)/D1\prod_{k \in K} \left( \prod_{i \in I_{k}} \mathfrak {M}_{i} \right) \Big/ D_{1}.

?
Problem II.8.37

Prove that if AA and BB are conditionally filterable with respect to the filter DD over II, then (A&B)(A \& B), ∃x B\exists x \, B, ∀x A\forall x \, A are also conditionally filterable with respect to DD.

?
Problem II.8.38

Prove that if AA and BB are filterable with respect to the filter DD over II, then (A&B)(A \& B), ∃x A\exists x \, A are also filterable with respect to DD.

?
Problem II.8.39

Prove that atomic formulas are filterable with respect to every filter.

?
Problem II.8.40

Let AA be filterable with respect to the ultrafilter DD. Prove that ¬A\neg A is filterable with respect to DD.

?
Problem II.8.41

Prove that every formula is filterable with respect to every ultrafilter (os's theorem).

?
Problem II.8.42

Let AA be filterable with respect to the filter DD over II, and let BB be conditionally filterable with respect to DD. Prove that (A⊃B)(A \supset B) and ¬A\neg A are conditionally filterable with respect to DD.

?
Problem II.8.43

Call a formula Horn if it is obtained from formulas of the form ¬A\neg A, (A⊃B)(A \supset B), BB, where AA is a conjunction of atomic formulas and BB is an atomic formula, by means of the operations of conjunction and adjoining quantifiers. Prove that Horn formulas are conditionally filterable with respect to every filter.

?
Problem II.8.44

Prove that the ultraproduct of linearly ordered sets is linearly ordered.

?
Problem II.8.45

Prove that the filtered product of preordered sets is preordered.

?
Problem II.8.46

Prove that the filtered product of partially ordered sets is partially ordered.

?
Problem II.8.47

Prove that the filtered product of groups is a group.

?
Problem II.8.48

Let a finite system M\mathfrak {M} contain nn elements. Prove that every ultrapower of M\mathfrak {M} also contains nn elements.

?
Problem II.8.49

Show that if the cardinalities of all the factors do not exceed a natural number nn, then the cardinality of the ultraproduct does not exceed nn.

?
Problem II.8.50

Prove that every filtered product of infinite systems is infinite.

?
Problem II.8.51

Suppose that for every nn the family {Mi}i∈I\left\{ \mathfrak {M}_{i}\right\}_{i \in I} contains only finitely many systems of cardinality nn. Prove that in this case the ultraproduct ∏i∈IMi/D\prod_{i \in I} \mathfrak {M}_{i} / D with respect to a nonprincipal ultrafilter DD is infinite.

?
Problem II.8.52

Prove that if ∣Mi∣≤∣Ni∣\left|M_{i}\right| \leq \left|N_{i}\right| for every i∈Ii \in I, then for every filter DD over II,

∣∏i∈IMi/D∣≤∣∏i∈INi/D∣. \left|\prod _{i \in I} \mathfrak {M}_{i} / D\right| \leq \left|\prod _{i \in I} \mathfrak {N}_{i} / D\right|.
?
Problem II.8.53

Let all the factors Mi\mathfrak {M}_{i} (i∈Ni \in \mathbb {N}) be finite, let DD be an ultrafilter over N\mathbb {N}, and let {i∣∣Mi∣=n}∉D\left\{ i \mid \left|M_{i}\right| = n\right\} \notin D for every n∈Nn \in \mathbb {N}. Prove that ∏i∈NMi\prod_{i \in \mathbb {N}} \mathfrak {M}_{i} has the cardinality of the continuum.

?
Problem II.8.54

Let all the factors Mi\mathfrak {M}_{i} (i∈Ni \in \mathbb {N}) be finite or countable, let DD be a nonprincipal ultrafilter over the set of natural numbers N\mathbb {N}, and let {i∣∣Mi∣=n}∉D\left\{ i \mid \left|M_{i}\right| = n\right\} \notin D for every natural number nn. Prove that the cardinality of ∏i∈NMi/D\prod_{i \in \mathbb {N}} \mathfrak {M}_{i} / D equals the continuum.

?
Problem II.8.55

Prove that if DD is not a countably complete ultrafilter over II, and for every natural number nn we have {i∣∣Mi∣=n}∉D\left\{ i \mid \left|M_{i}\right| = n\right\} \notin D, then ∏i∈IMi/D\prod_{i \in I} \mathfrak {M}_{i} / D has cardinality at least the continuum.

?
Problem II.8.56

Let all Mi\mathfrak {M}_{i} (i∈Ii \in I) be countable, and let DD be a countably complete ultrafilter over II. Prove that ∣∏i∈IMi/D∣=ℵ0\left|\prod_{i \in I} \mathfrak {M}_{i} / D\right| = \aleph_{0}.

?
Problem II.8.57

Let ⟨Ai;≤⟩\langle A_{i}; \leq \rangle be partially ordered sets (i∈Ni \in \mathbb {N}), where AiA_{i} contains ii minimal elements. What is the cardinality of the set of minimal elements in the ultraproduct ∏i∈NAi/D\prod_{i \in \mathbb {N}} \mathfrak {A}_{i} / D, if DD is a nonprincipal ultrafilter over N\mathbb {N}?

?
Problem II.8.58

Prove that for every infinite set II there exists a filter DD over II such that for every filter D1D_{1} over II containing DD, and every infinite system M\mathfrak {M},

∣MI/D1∣≥2∣I∣. \left|M^{I} / D_{1}\right| \geq 2^{\left|I\right|}.
?
Problem II.8.59

Prove that for every infinite algebraic system M\mathfrak {M} and every given cardinality mm, there exists an ultrapower of the system M\mathfrak {M} whose cardinality is greater than mm.

?
Problem II.8.60

Prove that if DD is a not countably complete ultrafilter over II and the algebraic system M\mathfrak {M} is infinite, then the natural embedding φ:M→MI/D\varphi : M \to M^{I} / D, i.e., φ(a)=f/D\varphi (a) = f / D, where f(i)=af(i) = a for all i∈Ii \in I, is not a one-to-one correspondence between MM and MI/DM^{I} / D.

?
Problem II.9.1

Prove that the class KσK_{\sigma } is axiomatizable.

?
Problem II.9.2

Prove that the union and intersection of axiomatizable classes are axiomatizable.

?
Problem II.9.3

Let KK be an axiomatizable class, M∈K\mathfrak {M} \in K, and M′\mathfrak {M}' isomorphic to M\mathfrak {M}. Show that M′∈K\mathfrak {M}' \in K.

?
Problem II.9.4

Let KK be an axiomatizable class, and {i∣i∈I,Mi∈K}∈D\left\{ i \mid i \in I, \mathfrak {M}_{i} \in K\right\} \in D, where DD is an ultrafilter over II. Prove that ∏i∈IMi/D∈K\prod_{i \in I} \mathfrak {M}_{i} / D \in K.

?
Problem II.9.5

Prove that if a class KK of algebraic systems is axiomatizable, then the class K′K' of all infinite systems from KK is also axiomatizable.

?
Problem II.9.6

Let KK be an axiomatizable class containing finite systems with arbitrarily large numbers of elements. Construct an infinite system from the class KK. Prove that KK contains an infinite system of cardinality the continuum.

?
Problem II.9.7

Prove that the following are not axiomatizable:

?
(a)

the class of finite groups;

(b)

the class of finite abelian groups;

(c)

the class of cyclic groups.

Problem II.9.8

Prove that the class of fields of finite characteristic is not axiomatizable.

?
Problem II.9.9

Let M0=⟨M0;≤⟩\mathfrak {M}_{0} = \langle M_{0}; \leq \rangle, M1=⟨M1;≤⟩,…\mathfrak {M}_{1} = \langle M_{1}; \leq \rangle , \ldots be a family of well-ordered sets such that ∣Mk+1∣≥k+1\left|M_{k + 1}\right| \geq k + 1. Prove that the ultraproduct ∏i∈NMi/D\prod_{i \in \mathbb {N}} \mathfrak {M}_{i} / D is well-ordered with respect to ≤\leq if and only if DD is a principal ultrafilter. Deduce that the class of well-ordered sets is not axiomatizable.

?
Problem II.9.10

Prove that a class KK is axiomatizable if and only if it is closed under ultraproducts and elementary equivalence.

?
Problem II.9.11

Prove that an elementary theory TT has a model if and only if every finite subset T0⊆TT_{0} \subseteq T is satisfiable (Mal'tsev's local theorem).

?
Problem II.9.12

Prove that every consistent theory has a model (the model existence theorem).

?
Problem II.9.13

Prove that, for a class KK to be finitely axiomatizable, it is necessary and sufficient that KK and its complement Kσ\KK_{\sigma } \backslash K be axiomatizable.

?
Problem II.9.14

Let KK be a finitely axiomatizable class and ∏i∈IMi/D∈K\prod_{i \in I} \mathfrak {M}_{i} / D \in K, where DD is an ultrafilter over II. Prove that {i∣Mi∈K}∈D\left\{ i \mid \mathfrak {M}_{i} \in K\right\} \in D.

?
Problem II.9.15

Let KK be an axiomatizable class containing finite systems with arbitrarily large numbers of elements. Prove that the class of infinite systems of KK is not finitely axiomatizable.

?
Problem II.9.16

Prove that the following classes are not finitely axiomatizable:

?
(a)

infinite groups;

(b)

infinite partially ordered sets;

(c)

infinite linearly ordered sets.

Problem II.9.17

Prove that the class of fields of characteristic 0 is not finitely axiomatizable.

?
Problem II.9.18

Let the theory TT have an infinite model. Prove that for every infinite cardinal number mm there exists a model for TT of cardinality greater than mm (Mal'tsev's extension theorem).

?
Problem II.9.19

Suppose that for every n∈Nn \in \mathbb {N} the theory TT has a model of cardinality greater than nn. Prove that for every infinite cardinal number mm there exists a model for TT of cardinality greater than mm.

?
Problem II.9.20

Prove that if every finite impoverishment of every finite submodel of a model M\mathfrak {M} is isomorphically embeddable in some model of the class KK, then M\mathfrak {M} is isomorphically embeddable in a suitable ultraproduct of models from KK.

?
Problem II.9.21

Let D(M)D(\mathfrak {M}) be the diagram of the system M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle and let M′=⟨M′;σ∪M⟩\mathfrak {M}' = \langle M'; \sigma \cup M \rangle be a model for D(M)D(\mathfrak {M}). Prove that M\mathfrak {M} is isomorphically embeddable in ⟨M′;σ⟩\langle M'; \sigma \rangle.

?
Problem II.9.22

Let M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle be a finite algebraic system of finite signature. Prove that there exists an ∃\exists-sentence AA of signature σ\sigma such that, for every system M′′=⟨M′′;σ⟩\mathfrak {M}'' = \langle M''; \sigma \rangle, AA is true in M′′\mathfrak {M}'' if and only if M\mathfrak {M} is isomorphically embeddable in M′′\mathfrak {M}''.

?
Problem II.9.23

Let σ\sigma be a finite signature, let Mi=⟨Mi;σ⟩\mathfrak {M}_{i} = \langle M_{i}; \sigma \rangle (i∈Ii \in I) be a system of finite algebraic systems of signature σ\sigma, and suppose there exists nn such that ∣Mi∣≤n\left|M_{i}\right| \leq n. Prove that for every ultrafilter DD over II there exists i0∈Ii_{0} \in I such that ∏i∈IMi/D≅Mi0\prod_{i \in I} \mathfrak {M}_{i} / D \cong \mathfrak {M}_{i_{0}}.

?
Problem II.9.24

Let M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle be an algebraic system, AA a nonempty subset of MM, and Mi=⟨Mi;σ⟩\mathfrak {M}_{i} = \langle M_{i}; \sigma \rangle (i∈Ii \in I) the family of all subsystems of M\mathfrak {M} such that Mi⊇AM_{i} \supseteq A. Prove that M0=⟨⋂i∈IMi;σ⟩\mathfrak {M}_{0} = \left\langle \bigcap_{i \in I} M_{i}; \sigma \right\rangle is the subsystem of M\mathfrak {M} generated by the set AA.

?
Problem II.9.25

Prove that if M1=⟨M1;σ⟩\mathfrak {M}_{1} = \langle M_{1}; \sigma \rangle is the subsystem of the system M\mathfrak {M} generated by the set AA, then M1M_{1} is the set of all values of terms of signature σ\sigma when the variables take values in the set AA.

?
Problem II.9.26

Let M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle, and let AA be a nonempty subset of MM. Prove that the subsystem M′\mathfrak {M}' generated by the set AA has cardinality at most max⁡{∣A∣,∣σ∣,ℵ0}\max \left\{ \left|A\right|, \left|\sigma \right|, \aleph_{0}\right\}.

?
Problem II.9.27

Prove that every axiomatizable class consists of impoverishments of algebraic systems of some universally axiomatizable class.

?
Problem II.9.28

Prove that every system of an axiomatizable class KK of finite signature contains a finite or countable KK-subsystem.

?
Problem II.9.29

Let KK be an axiomatizable class whose signature σ\sigma has cardinality pp, and let M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle be some KK-system. Prove that every subset A⊆MA \subseteq M of cardinality mm is contained in a suitable KK-subsystem of the system M\mathfrak {M} of cardinality at most p+m+ℵ0p + m + \aleph_{0} (the Lowenheim--Skolem theorem).

?
Problem II.9.30

Prove that every infinite system M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle of an axiomatizable class KK admits a KK-extension of any preassigned cardinality greater than ∣M∣+∣σ∣\left|M\right| + \left|\sigma \right|.

?
Problem II.9.31

Construct an example of an axiomatizable class KK such that the class KK contains finite models with arbitrarily large numbers of elements, while all infinite models of KK have cardinality at least the cardinality of the continuum.

?
Problem II.9.32

Construct an example of an axiomatizable class KK such that KK has a countable model, while every other model of the class KK that is an extension of this model has cardinality at least the cardinality of the continuum.

?
Problem II.9.33

Prove that if an axiomatizable class KK contains a system of cardinality m≥ℵ0m \geq \aleph_{0}, then for every n≥2mn \geq 2^{m} there exists a KK-system of cardinality nn.

?
Problem II.9.34

Suppose the generalized continuum hypothesis holds: for any cardinal numbers m,nm, n with m≤n≤2mm \leq n \leq 2^{m}, it follows that m=nm = n or n=2mn = 2^{m}. Prove that then, for every axiomatizable class KK, exactly one of the following conditions holds:

?
(a)

the cardinalities of finite systems of KK are bounded by some natural number, and KK consists only of finite systems;

(b)

the cardinalities of finite systems of KK are bounded by some natural number, and there exists an infinite cardinal number mm such that, for every infinite cardinal number nn, the class KK contains a model of cardinality nn if and only if n≥mn \geq m;

(c)

the cardinalities of finite systems of KK are unbounded, and there exists an infinite cardinal number m≤2ℵ0m \leq 2^{\aleph_{0}} such that KK contains a system of infinite cardinality nn if and only if n≥mn \geq m.

Give examples of classes for each of the cases (a), (b), (c).

Problem II.9.35

Prove that if φ:M→M′\varphi : M \to M' is an elementary mapping, then φ\varphi is one-to-one, and for every formula A(x1,…,xn)A(x_{1}, \ldots , x_{n}) and all m1,…,mn∈Mm_{1}, \ldots , m_{n} \in M we have

M⊨A(m1,…,mn)⇔M′⊨A(φ(m1),…,φ(mn)). \mathfrak {M} \vDash A(m_{1}, \ldots , m_{n}) \Leftrightarrow \mathfrak {M}' \vDash A(\varphi (m_{1}), \ldots , \varphi (m_{n})).
?
Problem II.9.36

Let N=⟨N;≤⟩\mathfrak {N} = \langle N; \leq \rangle, M=⟨M;≤⟩\mathfrak {M} = \langle M; \leq \rangle, where NN is the set of natural numbers and MM the set of positive integers. Show that N\mathfrak {N} and M\mathfrak {M} are elementarily equivalent, but N\mathfrak {N} is not an elementary extension of M\mathfrak {M}.

?
Problem II.9.37

Let MM be the set of even numbers, M=⟨M;≤⟩\mathfrak {M} = \langle M; \leq \rangle, N=⟨N;≤⟩\mathfrak {N} = \langle N; \leq \rangle, where ≤\leq is the usual order. Is M\mathfrak {M} an elementary submodel of N\mathfrak {N}?

?
Problem II.9.38

Let R=⟨R;+,⋅⟩\mathfrak {R} = \langle \mathbb {R}; +, \cdot \rangle be the field of real numbers, and C=⟨C;+,⋅⟩\mathfrak {C} = \langle \mathbb {C}; +, \cdot \rangle the field of complex numbers. Is C\mathfrak {C} an elementary extension of R\mathfrak {R}?

?
Problem II.9.39

Prove that for every ultrafilter DD over II the canonical mapping φ:M→MI/D\varphi : M \to M^{I} / D, defined by φ(b)=f/D\varphi (b) = f / D, where f(i)=bf(i) = b for all i∈Ii \in I, is an elementary embedding of MM into MI/DM^{I} / D. Prove that if MM is a finite system, then φ\varphi is an isomorphism of MM onto MI/DM^{I} / D.

?
Problem II.9.40

Let Mn=⟨Mn;≤⟩\mathfrak {M}_{n} = \langle M_{n}; \leq \rangle be linearly ordered sets (n∈Nn \in \mathbb {N}); MnM_{n} contains 2n+12n + 1 elements.

?
(a)

Construct an isomorphism of the set of integers ⟨Z;≤⟩\langle \mathbb {Z}; \leq \rangle into ∏i∈NMi/D\prod_{i \in \mathbb {N}} \mathfrak {M}_{i} / D, if DD is a nonprincipal ultrafilter on N\mathbb {N}.

(b)

Is this isomorphism an elementary mapping?

Problem II.9.41

Let FD(M)FD(\mathfrak {M}) be the complete diagram of the system M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle and let M′=⟨M′;σ∪M⟩\mathfrak {M}' = \langle M'; \sigma \cup M \rangle be a model for FD(M)FD(\mathfrak {M}). Prove that M\mathfrak {M} is elementarily embeddable in ⟨M′;σ⟩\langle M'; \sigma \rangle.

?
Problem II.9.42

Prove that for every infinite system M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle and every cardinal number mm, there exists an elementary extension of the system M\mathfrak {M} of cardinality greater than mm.

?
Problem II.9.43

Let M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle be a subsystem of the system M′=⟨M′;σ⟩\mathfrak {M}' = \langle M'; \sigma \rangle. Prove that, for M\mathfrak {M} to be an elementary subsystem of M′\mathfrak {M}', it is necessary and sufficient that, for every formula A(x1,…,xn,y)A(x_{1}, \ldots , x_{n}, y) of signature σ\sigma and all m1,…,mn∈Mm_{1}, \ldots , m_{n} \in M, M′⊨∃y A(m1,…,mn,y)\mathfrak {M}' \vDash \exists y \, A(m_{1}, \ldots , m_{n}, y) implies the existence of m∈Mm \in M such that M⊨A(m1,…,mn,m)\mathfrak {M} \vDash A(m_{1}, \ldots , m_{n}, m).

?
Problem II.9.44

Prove that every infinite system of finite or countable signature σ\sigma is an elementary extension of a countable system of signature σ\sigma.

?
Problem II.9.45

Let M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle be an infinite system, X⊆MX \subseteq M, and let mm be a cardinality such that max⁡{∣σ∣,∣X∣,ℵ0}≤m≤∣M∣\max \left\{ \left|\sigma \right|, \left|X\right|, \aleph_{0}\right\} \leq m \leq \left|M\right|. Prove that there exists an elementary subsystem M′=⟨M′;σ⟩\mathfrak {M}' = \langle M'; \sigma \rangle of cardinality mm such that X⊆M′X \subseteq M'.

?
Problem II.9.46

Let M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle be an infinite system and m≥max⁡{∣M∣,∣σ∣}m \geq \max \left\{ \left|M\right|, \left|\sigma \right|\right\}. Prove that M\mathfrak {M} has an elementary extension of cardinality mm.

?
Problem II.9.47

Let M1,…,Mn,…\mathfrak {M}_{1}, \ldots , \mathfrak {M}_{n}, \ldots be a set of systems such that Mi+1\mathfrak {M}_{i + 1} is an elementary extension of Mi\mathfrak {M}_{i} for every ii. Prove that ⋃iMi\bigcup_{i} \mathfrak {M}_{i} is an elementary extension of every Mi\mathfrak {M}_{i}.

?
Problem II.9.48

Prove that a class KK is axiomatizable if and only if KK is abstract, closed under ultraproducts, and closed under taking elementary subsystems.

?
Problem II.9.49

Prove that a class KK of systems of signature σ\sigma is universally axiomatizable if and only if, for every system M\mathfrak {M} of signature σ\sigma, the fact that every finite impoverishment of every finite submodel of the system M\mathfrak {M} is isomorphically embeddable in some KK-system implies that M\mathfrak {M} belongs to KK.

?
Problem II.9.50

Show that a class KK is universally axiomatizable if and only if KK is closed under ultraproducts, abstract, and hereditary (closed under taking subsystems).

?
Problem II.9.51

Let the class KK be axiomatizable, and let SKSK be the class of systems isomorphic to subsystems of KK-systems. Prove that the class SKSK is universally axiomatizable.

?
Problem II.9.52

Prove that, for M\mathfrak {M} and M1\mathfrak {M}_{1} to be elementarily equivalent, it is necessary and sufficient that there exist an ultrafilter DD over a suitable set II for which there exists an elementary mapping of M\mathfrak {M} into M1I/D\mathfrak {M}_{1}^{I} / D.

?
Problem II.9.53

Prove that if M\mathfrak {M} and M1\mathfrak {M}_{1} are elementarily equivalent and M\mathfrak {M} is finite, then M1\mathfrak {M}_{1} is finite and isomorphic to M\mathfrak {M}.

?
Problem II.9.54

Prove that, for a consistent theory TT to be complete, it is necessary and sufficient that all of its models be elementarily equivalent.

?
Problem II.9.55

Show that the class of models of a categorical theory consists (up to isomorphism) of a single finite system. (A theory is called categorical if all of its models are isomorphic.)

?
Problem II.9.56

Let TT be an elementary theory having no finite models, which is mm-categorical for some infinite cardinality mm. Prove that TT is a complete theory. (A theory is called mm-categorical if all of its models of cardinality mm are isomorphic.)

?
Problem II.9.57

Prove that the theory of densely ordered sets (see Problem I.5.13 of 5 of Part I) without least or greatest element is complete.

?
Problem II.9.58

Let Γ\Gamma be a complete set of sentences of signature σ\sigma, and let Γ0⊇Γ\Gamma_{0} \supseteq \Gamma, Γ1⊇Γ\Gamma_{1} \supseteq \Gamma be two consistent sets of sentences such that all object constants of Γ0\Gamma_{0} and all function and predicate symbols of Γ1\Gamma_{1} belong to σ\sigma. Prove that the set Γ0∪Γ1\Gamma_{0} \cup \Gamma_{1} is consistent.

?
Problem II.9.59

Let Γ\Gamma be a complete set of sentences of signature σ\sigma, AA a sentence all of whose object constants belong to σ\sigma, and Γ∪{A}\Gamma \cup \left\{ A\right\} consistent. Prove that if Γ\Gamma is satisfiable in a system M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle, then the set {A}∪FD(M)\left\{ A\right\} \cup FD(\mathfrak {M}) is consistent.

?
Problem II.9.60

Let M=⟨M;σ⟩\mathfrak {M} = \langle M; \sigma \rangle be an impoverishment of the system M1=⟨M1;σ⟩\mathfrak {M}_{1} = \langle M_{1}; \sigma \rangle, and let M2=⟨M2;σ⟩\mathfrak {M}_{2} = \langle M_{2}; \sigma \rangle be an elementary extension of M\mathfrak {M}. Prove that there exists an elementary extension M3=⟨M3;σ1⟩\mathfrak {M}_{3} = \langle M_{3}; \sigma_{1} \rangle of the system M1\mathfrak {M}_{1} such that ⟨M3;σ⟩\langle M_{3}; \sigma \rangle is an elementary extension of M2\mathfrak {M}_{2}.

?
Problem II.9.61

Let Γ\Gamma be a complete set of sentences of signature σ\sigma, AA a sentence of signature σ1⊇σ\sigma_{1} \supseteq \sigma, BB a sentence of signature σ2⊇σ\sigma_{2} \supseteq \sigma, and σ1∩σ2=σ\sigma_{1} \cap \sigma_{2} = \sigma, with all object constants of AA and all object constants of BB belonging to σ\sigma. Prove that if Γ∪{A}\Gamma \cup \left\{ A\right\} and Γ∪{B}\Gamma \cup \left\{ B\right\} are consistent, then Γ∪{A,B}\Gamma \cup \left\{ A, B\right\} is consistent.

?
Problem II.9.62

Let Γ\Gamma be a complete set of sentences of signature σ\sigma, AA a sentence of signature σ1⊇σ\sigma_{1} \supseteq \sigma, BB a sentence of signature σ2⊇σ\sigma_{2} \supseteq \sigma, and σ1∩σ2=σ\sigma_{1} \cap \sigma_{2} = \sigma. Prove that if Γ∪{A}\Gamma \cup \left\{ A\right\} and Γ∪{B}\Gamma \cup \left\{ B\right\} are consistent, then Γ∪{A,B}\Gamma \cup \left\{ A, B\right\} is consistent.

?
Problem II.9.63

Let AA be a sentence of signature σ1\sigma_{1}, BB a sentence of signature σ2\sigma_{2}, and ⊢(A⊃B)\vdash (A \supset B) in PrC, with ¬A\neg A and BB not derivable in PrC. Prove that σ=σ1∩σ2\sigma = \sigma_{1} \cap \sigma_{2} is nonempty and there exists a sentence CC of signature σ\sigma such that ⊢(A⊃C)\vdash (A \supset C) and ⊢(C⊃B)\vdash (C \supset B) in PrC (the interpolation theorem for PrC).

?