Part II. Mathematical Logic
[425/81%]Determine whether the given sequence is a formula:
;
;
;
.
In how many ways can parentheses be inserted into the following sequence so as to obtain a formula:
;
?
Write out all subformulas of the formula:
;
.
Prove that every formula that is not a propositional variable can be represented in one of the following forms: , , , for some formulas and .
Prove that the result of replacing a given occurrence of the formula in the formula , in place of a subformula , is again a formula.
Prove that the result of the substitution of the formula for the propositional variable in the formula is again a formula.
Construct the truth tables for the following formulas:
;
;
;
;
;
.
Prove the satisfiability of the formulas:
;
;
.
For which values of the variables are the following formulas false:
;
;
;
;
?
Prove that if the formula is identically true, then the formula is identically true. (Here is a propositional variable, and is a formula.)
Prove that if the formulas and are identically true, then the formula is identically true.
Prove that:
if the formulas and are identically true, then the formula is identically true;
if the formulas , , are identically true, then the formula is identically true;
if the formulas , are identically true, then the formula is identically true.
Prove that if and only if is identically true.
Prove that:
;
;
( and ) .
Prove that and imply:
;
;
;
.
Prove that if , then for any formulas and variable .
Prove that if and is the result of replacing some occurrence of the subformula in the formula by the formula , then .
Prove that:
;
;
.
Prove that for every formula there exists an equivalent formula with tight negations, i.e., a formula in which the symbol does not occur and negations apply only to propositional variables.
Prove that for every formula there exists an equivalent:
conjunctive normal form;
disjunctive normal form.
Reduce to disjunctive and conjunctive normal form:
;
;
.
Prove that if is an identically true CNF, then for every disjunct of the formula there is a variable such that and both occur in this disjunct.
Prove that if is an identically false DNF, then for every conjunct of the formula there is a variable such that and both occur in this conjunct.
Let be a formula with tight negations (see Problem II.1.22), and let be obtained from by replacing by , by , and the variables by . Prove that .
Let and be formulas with tight negations (see Problem II.1.22), and let , be the formulas dual to and respectively ( is obtained from by replacing by , by ). Prove that implies (the duality law).
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.)
Prove that every formula 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).
Prove that for every satisfiable formula there exists an equivalent p.d.n.f.
Prove that for an identically false formula there is no equivalent p.d.n.f.
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.)
Prove that every formula 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).
Prove that for every falsifiable formula there exists an equivalent p.c.n.f.
Prove that for an identically true formula there is no equivalent p.c.n.f.
Reduce to perfect disjunctive normal form, i.e., find a p.d.n.f. equivalent to the given formula:
;
;
.
Reduce to perfect conjunctive normal form, i.e., find a p.c.n.f. equivalent to the given formula:
;
;
.
Construct a formula such that the given formula is identically true:
;
.
Construct a formula in three variables that is true if and only if exactly two of the variables are false.
Construct a formula in three variables that takes the same value as the majority (minority) of the variables.
Construct a formula in the variables such that:
and ;
and ;
and .
Prove that a formula in variables is identically true (identically false) if and only if its p.d.n.f. (p.c.n.f.) contains pairwise non-equivalent conjuncts (disjuncts).
Let the formula be written in p.c.n.f. We construct a formula as follows:
-
we write out the conjunction of the disjuncts not occurring in ;
-
we change to , to , to , to . Prove that the formula is a p.d.n.f. of the formula .
From the p.c.n.f. of a formula , construct:
the p.d.n.f. , where is dual to (see Problem II.1.28);
the p.c.n.f. of the formula ;
the p.d.n.f. of the formula .
From the p.d.n.f. of a formula and the p.d.n.f. of a formula , construct:
the p.c.n.f. and p.d.n.f. of the formula ;
the p.c.n.f. and p.d.n.f. of the formula ;
the p.c.n.f. and p.d.n.f. of the formula .
Prove that a formula in the variables is equivalent to some formula containing only , , and not containing , if and only if its p.c.n.f. lacks the disjunct .
Let the formula contain no connectives other than . Prove that is identically true if and only if every variable occurs in an even number of times.
Let the formula contain no connectives other than and . Prove that is identically true if and only if every variable and the negation sign occur in an even number of times.
Show that to each formula of the algebra of propositions one can assign a function of the algebra of logic such that
How many functions of the algebra of logic in variables are there?
Find all essential variables of the following functions:
;
;
.
Express by means of superpositions:
and in terms of and ;
and in terms of and ;
and in terms of and ;
, , , in terms of ;
in terms of and 0;
in terms of and 1;
in terms of .
Prove that and are distinct closed classes, different from .
Prove that it is impossible to express by means of superpositions:
in terms of , , and ;
in terms of , ;
in terms of , .
Prove that for every function the equality holds:
Let . Prove that every function of the algebra of logic can be represented in the form
where , , .
Prove the completeness of the systems of functions:
;
;
;
.
Prove the incompleteness of the systems of functions:
;
.
Prove the completeness of the systems of functions:
;
(here );
;
.
Prove that:
is a complete system of functions;
every function is uniquely representable by a Zhegalkin polynomial, i.e., in the form:
where .
Show that the following systems of functions are independent:
;
;
;
.
Show the completeness and independence of the following systems of functions:
, where ;
, where ;
.
Show that 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.
Which system consisting of a single 2-ary function is complete? Find all such systems.
Give an example of a complete system of functions:
consisting of a single 3-ary function;
consisting of a single -ary function ().
Prove that a finite complete subsystem can be extracted from every complete system of functions.
Prove that:
is a basis for ;
is a basis for ;
is a basis for ;
is a basis for ;
is a basis for .
Prove that the classes are precomplete classes.
Prove that:
from any nonmonotone function together with the functions 0 and 1, one can obtain the function by superpositions;
the class is a precomplete class.
Prove that:
from any non-self-dual function together with the function , one can obtain the functions 0 and 1 by superpositions;
the class is a precomplete class.
Prove that:
from any nonlinear function together with the functions 0, 1, , one can obtain the function by superpositions;
the class is a precomplete class.
Prove that every closed class is contained in some precomplete class.
Prove that a system of functions is complete if and only if it is not contained in any of the precomplete classes.
Prove that there are no precomplete classes other than and (E.Post's theorem).
Prove that every basis of contains at most four functions.
Let and be terms representing some functions of the algebra of logic, and let be the formula of set theory defined at the end of the introductory part of the section. Prove that:
;
;
.
Prove that in set theory:
, where ;
;
.
Prove that in set theory
Suppose the function is representable by the term , and by the term . Prove that:
if for all , then in set theory the identity holds;
if for all , then in set theory the relation holds;
if for all , then in set theory the identity holds;
if for all , then in set theory the identity holds.
Prove that if the function is representable by the term and for all arbitrary , then for all .
On the basis of which identities of the algebra of logic can the following theorems of set theory be obtained:
;
;
;
?
Construct derivations of the following sequents in SC:
;
;
;
;
;
.
Prove the substitution rule for SC: if the sequent is derivable, is a variable and is any formula, then the sequent is derivable.
Prove that the following rules are admissible in SC:
(cut);
(combining premises);
(splitting premises);
(case analysis);
(contraposition);
(proof by contradiction);
(introduction of and );
(elimination of and ).
Prove that if the rule is admissible in SC for every formula , then the rule is admissible in SC.
Prove that the following rules are admissible in SC:
;
;
.
Let be a formula, a subformula of the formula , and the result of replacing some occurrence of in by the formula . Prove the derivability in SC of the sequent (the replacement theorem for SC).
Let be a formula and its CNF (see 1). Prove the derivability in SC of the sequent .
Prove that for every identically true CNF the sequent is derivable in SC.
Prove that:
if the sequent is derivable in SC, then the formula is identically true;
if the sequent is derivable in SC, then the formula is identically true;
if the sequent is derivable in SC, then the formula is identically true.
Prove that the sequent is derivable in SC if and only if is identically true (the completeness theorem for SC).
Are the following sequents derivable in SC:
;
;
;
;
;
?
Prove the interpolation theorem for SC: if the sequent is provable and the sequents and are not provable, then there exists a formula , all of whose variables occur both in and in , such that the sequents and are provable (such a formula is called an interpolant).
Construct interpolants (see Problem II.3.15) for the following sequents:
;
.
Are the following sequences of formulas derivations in PC:
;
, , ;
, , ?
Construct derivations of the following formulas in PC:
;
;
.
Prove that if is derivable in PC, then is derivable in PC for any variable and formula (the substitution rule).
Find the minimal set such that the following sequence is a derivation in PC from :
, , , , ;
, , , , .
Prove that in PC.
Prove that the following rules are admissible in PC:
;
;
;
;
.
Prove the deduction theorem for PC: if , then .
Prove for PC:
(introduction of );
(introduction of );
(introduction of );
(introduction of );
(elimination of );
(elimination of );
(elimination of );
(elimination of ).
Prove that a set is consistent if and only if there exists a formula that is not derivable in PC from .
Let be a formula, a subformula of the formula , and the result of replacing some occurrence of in by the formula . Prove the replacement theorem for PC:
Prove that if the formula is derivable in PC, then the sequent is derivable in SC.
Prove that:
if the sequent is derivable in SC, then in PC;
if the sequent is derivable in SC, then in PC;
if the sequent is derivable in SC, then the formula is derivable in PC.
Prove that:
all axioms of PC are identically true;
all formulas derivable in PC are identically true.
Prove the completeness theorem for PC: every identically true formula is derivable in PC.
Find formulas and such that the derivability in PC of implies the derivability of , but it is not true that .
Let be a formula and all of its variables. Prove that if is not derivable in PC, then there exist formulas such that the formula is derivable in PC.
Let and be formulas. Set
Prove that:
is an equivalence relation on the set of all formulas;
the quotient set is a Boolean algebra, where in PC (this algebra is called the Lindenbaum algebra for PC);
is derivable in PC if and only if is the greatest element 1 of the algebra .
Let be a Boolean algebra. Assign to it the logical matrix , where , , , . Prove that is derivable in PC if and only if is generally valid in all logical matrices corresponding to Boolean algebras.
Let be an ultrafilter on the Lindenbaum algebra (see Problem II.3.35). For an arbitrary variable , set the value of equal to if , and otherwise. Prove that for every formula
Deduce from (a) the completeness theorem for the calculus PC (see Problem II.3.32).
Let be a formula, a system of formulas, and a logical matrix. Prove that if all formulas of are generally valid in , and a direct consequence of formulas generally valid in is a formula generally valid in , while the formula is not generally valid in , then is independent of .
Let , , , , , . Prove that the formula
is independent of , where , using the logical matrix .
Prove the independence of the axiom schemes of the calculus PC.
Let be the propositional calculus with axiom schemes:
L1. ,
L2. ,
L3.
and rule of inference .
Prove that every formula derivable in is also derivable in PC.
Prove the deduction theorem for .
Set , . Prove that every formula derivable in PC is derivable in .
Prove that:
every formula derivable in IPC is derivable in PC;
, are not derivable in IPC.
For the calculus IPC, prove the deduction theorem: if , then .
Let ISC be the sequent calculus that differs from SC by the absence of rule 11. Prove that:
if the formula is derivable in IPC, then the sequent is derivable in ISC;
if the sequent is derivable in ISC, then ;
if the sequent is derivable in ISC, then ;
if the sequent is derivable in ISC, then the formula is derivable in IPC.
Prove that:
;
;
.
Prove that if the formula is derivable in PC, then the formula is derivable in IPC.
Let , , , ,
Prove that:
every formula derivable in IPC is generally valid in ().
the formulas
are not derivable in IPC ().
Let be a logical matrix such that the set of formulas generally valid in coincides with the set of formulas derivable in IPC. Prove that the set is infinite.
Let be a 1-ary, a 2-ary, and a 3-ary function symbol. Are the following words terms:
;
;
?
Let be as in the previous problem, a 1-ary and a 3-ary predicate symbol. Are the following words formulas:
;
;
;
?
Show that the expression
where is a 1-ary predicate symbol, is not a formula.
Write out all subformulas of the formula:
;
.
Describe the set of terms in one variable :
and function symbol ;
and function symbol .
Which occurrences of variables are free and which are bound in the formulas:
;
;
?
Is the term free for in :
, , ;
, , ?
Prove that:
a term containing no variables is free for any variable in any formula;
the variable is free for in any formula;
if contains no free occurrences of , then any term is free for in .
Let , where
Write a formula with one free variable , true in if and only if:
;
;
;
is even;
is odd;
is a prime number.
Write a formula with two free variables and , true in from Problem II.4.9 if and only if:
;
;
;
divides ;
and are twin primes.
Write a formula with three free variables , true in from Problem II.4.9 if and only if:
is the least common multiple of and .
is the greatest common divisor of and .
Write a sentence expressing, in the model from Problem II.4.9:
commutativity of addition;
associativity of addition;
commutativity of multiplication;
associativity of multiplication;
distributivity of addition with respect to multiplication;
the infinitude of the set of prime numbers;
every number is a sum of four squares;
the existence of the l.c.m.and g.c.d.for nonzero numbers.
Write a sentence expressing, in the model from Problem II.4.9:
the nonexistence of a unit;
there are finitely many primes;
every number can be represented as a sum of two squares;
for every number there exists a strictly smaller number;
the existence of a greatest natural number.
Are these sentences true in the model ?
Write a sentence expressing, in the model from Problem II.4.9:
there are infinitely many twin primes;
every even number greater than 2 is a sum of two primes.
Write a sentence expressing, in the model from Problem II.4.9, that the equation has exactly two distinct roots.
Write a sentence expressing, in the model from Problem II.4.9, that the system of equations
has no solution.
Let be the set of points, lines, and planes of 3-dimensional Euclidean space, with the following predicates:
Write the following formulas:
through every two points a line can be drawn; if these points are distinct, such a line is unique;
through every three points not lying on one line a unique plane can be drawn;
the definition of parallel lines;
the definition of parallel planes.
In the model from Problem II.4.17, write:
Euclid's axiom on parallel lines;
Lobachevsky's axiom on parallel lines.
Choose predicates and write:
Hilbert's axioms for Euclidean geometry;
the axioms for Lobachevsky geometry;
the axioms for Riemannian geometry.
Consider models with a single 2-ary predicate . Write that the given predicate :
is reflexive;
is symmetric;
is transitive;
is an equivalence relation.
In the signature , where and are 2-ary predicates, write the axioms:
of a partially ordered set;
of a linearly ordered set.
Let be a partially ordered set and
Write that:
is the least element;
is a minimal element;
lies between and ;
the set is densely ordered;
every maximal element is minimal.
Let , where is some set, and
Write that:
is the intersection of and ;
is the union of and ;
;
;
is the complement of .
Consider , where , , and is the predicate of set equality. Write that:
;
is a singleton set.
In the signature , write the axioms:
of an ordered set with a greatest and a least element;
of a discretely ordered set;
of a lattice;
of a distributive lattice;
of a Dedekind lattice;
of a relatively complemented distributive lattice;
of a Boolean algebra;
of an atomic Boolean algebra.
In a suitable signature, write the axioms:
of a quasigroup;
of a loop;
of a semigroup;
of a commutative semigroup;
of a commutative cancellative semigroup.
In a suitable signature, write the axioms:
of a group;
of an abelian group;
of an ordered abelian group;
of a divisible group.
In a suitable signature, write the axioms:
of a ring;
of an associative, commutative ring;
of a Lie ring;
of an integral domain;
of a skew field;
of a field;
of an algebraically closed field;
of a real closed field.
Let , where , is an arbitrary 1-ary predicate, and is zero. Write the induction axiom for .
Let , where is a well-ordered set, , and is an arbitrary 1-ary predicate. Write the transfinite induction axiom for .
Prove that a formula of signature is satisfiable in the algebraic system if and only if is satisfiable in every enrichment .
Prove that for every sentence of signature relative to the algebraic system , we have or .
Prove that:
is satisfiable if and only if is not identically true;
is identically true if and only if is not satisfiable.
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.
Prove that if a closed -formula is true in an algebraic system, then it is true in every subsystem of it.
Prove that if a closed -formula is true in an algebraic system, then it is true in every extension of it.
Give an example of a formula and an algebraic system such that and is false in some extension and some subsystem of the system .
Let be a subsystem of the system . Prove that for every sentence of signature relative to the algebraic system , if and only if , where is an enrichment of and is the relativization of the formula , with, for every ,
Are the formulas satisfiable:
;
;
;
;
;
?
Are the formulas identically true:
;
;
;
?
Let be obtained from by replacing all free occurrences of the variable by the term . Prove the identical truth of the following formulas, if the term is free for in :
;
.
Give examples of formulas and terms such that formulas (a) and (b) of the preceding problem are not identically true.
Prove that the formula
is satisfiable in some infinite model and false in all finite ones.
Prove that the formula
is true in every model containing at most three elements.
Prove that the following formulas are true in every finite model, but not identically true:
;
.
Write a formula with 1-ary predicates, satisfiable only in models containing at least five elements.
Prove the identical truth of the following formulas:
;
, where is not free in ;
;
.
Let be a formula, a subformula of the formula , and the result of replacing some occurrence of in by the formula . Prove that if , then (the replacement theorem).
Prove that for every formula there exists an equivalent prenex normal form.
Reduce to prenex normal form, taking and to be quantifier-free formulas:
;
;
;
.
Let , and let be the set of all terms of signature . Define predicates and functions on so that becomes an algebraic system of signature .
Let a formula of signature have the form
for some formula (possibly containing quantifiers); let be -ary function symbols not occurring in . Prove that for every system there exists an enrichment of signature such that
Prove that for every sentence of signature there exists a -formula of a signature , obtained by adjoining new function symbols to , with the following property: for every system there exists an enrichment of signature such that
(The functions adjoined in are called Skolem functions.)
For the formula , construct the -formula whose existence is asserted in Problem II.5.21(b). For the system , find the required enrichment.
For the formula , construct the -formula whose existence is asserted in Problem II.5.21(b). For any system , where , find a suitable enrichment.
For the formula
and the system from Problem II.4.9, construct the Skolem functions (see Problem II.5.21(b)).
Prove that if a formula of signature is satisfiable, then it is satisfiable on some algebra of terms of a signature .
Let contain no free variables other than , and . Prove that the formula is identically true if and only if the formula
where is a 2-ary predicate symbol not occurring in , is identically true.
Prove that for every sentence one can construct a Skolem normal form such that is identically true if and only if is identically true.
Let be a Skolem normal form of the sentence . Show that does not hold in general. Is it always true that ? A similar question for .
Reduce to Skolem normal form:
;
;
.
Let be an arbitrary model and . Prove that there exists an extension of the model such that for every formula and any elements ,
Let and . Let be a formula with free variable of signature . Prove that
Prove that if the algebraic system is finite, then for every sentence one can construct a quantifier-free sentence relative to such that .
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.
Prove that a formula of the form , where is a quantifier-free formula without function symbols or constants, is identically true if and only if it is true in every model of elements.
Prove that a formula of the form , where 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.
Prove that a formula of the form
where is a quantifier-free formula without function symbols or constants, is identically true if and only if it is true in every model of elements.
Let be a formula of signature , where are 1-ary predicate symbols. Prove that is satisfiable if and only if is satisfiable in a model containing at most elements.
Are the formulas satisfiable:
;
;
?
Let , where are 1-ary predicate symbols. Prove that for every sentence of signature there exists a formula , equivalent to , built by means of , and from -constituents, i.e., formulas of the form , where and () has the form or for some of .
For an -constituent (see Problem II.5.38), denote by the formula obtained from by erasing the quantifier and replacing all occurrences of the subformulas in by respectively. Prove that the formula
where are -constituents, , , is satisfiable if and only if the formula of the algebra of propositions
is satisfiable.
Indicate a method for constructing, from any sentence with 1-ary predicates, a formula of the propositional calculus such that the satisfiability of the formula is equivalent to the satisfiability of .
Using the method of Problem II.5.40, determine whether the following formulas are satisfiable:
;
;
.
Write a sentence of signature :
true in every normal model containing at most elements (), and false in every other normal model;
true in every normal model containing at least elements (), and false in every other normal model;
true in every normal model containing exactly elements (), and false in every other normal model.
Let
Prove that is true in every normal model containing at least elements.
Prove the equivalence of the following formulas for normal models:
Prove that every sentence of signature is equivalent on normal models to a formula built from by means of , and .
Call the spectrum of a formula the collection of cardinalities of the normal models on which the formula is satisfiable. Show that every satisfiable formula built from by means of , and has a spectrum that is a union of finitely many intervals of the form
Show that a sentence of signature is identically true on normal models if and only if it has spectrum .
Find an infinite system of formulas of signature satisfiable only in infinite normal models.
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 there exists a normal model of cardinality on which this formula is true.
Prove that every sequent derivable in SC is derivable in PrSC.
Let be formulas of SC, a formula of PrSC, and the formulas obtained from by substituting for the propositional variable . Prove that if the sequent is derivable in SC, then is derivable in PrSC.
Prove that the rules of Problems II.3.3 and II.3.6 are admissible in PrSC.
Let not be free in , let be free for in , and let be obtained from by replacing all free occurrences of by . Construct derivations in PrSC of the sequents:
;
.
Let be free for in the formulas . Prove that if is derivable in PrSC, then is derivable.
Prove that the following sequents are derivable in PrSC:
;
;
;
;
;
;
;
;
.
Let be a formula, a subformula of the formula , the result of replacing some occurrence of in by the formula , and all the free variables of the formulas and . Prove that the sequent is derivable in PrSC (the replacement theorem for PrSC).
Prove that for every formula there exists a prenex normal form such that is derivable in PrSC.
Find the prenex normal form for the following formulas:
, where and are quantifier-free formulas;
.
Let be a formula built from atomic formulas and their negations by means of , , and the quantifiers and over arbitrary variables. Let be the result of simultaneously replacing, in , by , by , by , by , and atomic formulas by their negations. Prove that the sequent is derivable in PrSC.
Let be a formula built from atomic formulas and their negations by means of , , and the quantifiers and over arbitrary variables. Let be the result of simultaneously replacing, in , by , by , by , by , and atomic formulas by their negations. Prove that in PrSC:
if the sequent is derivable, then is derivable;
if the sequent is derivable, then is derivable.
Show that a quasi-derivation in PrC from the empty set of formulas is a derivation in PrC.
Are the following sequences derivations in PrC:
;
, ;
, , ?
What requirements must the formula satisfy for the following sequence to be a derivation in PrC:
, ;
, ?
Prove that if are formulas of PC, is a formula of PrC, is a propositional variable, and in PC, then in PrC.
Construct derivations of the formulas in PrC:
;
;
.
Is the sequence of formulas a derivation from in PrC, where contains no free occurrences of :
, ;
, , , ,
if and contain no free occurrences of ?
Construct derivations from in PrC of the following formulas:
;
, where and do not occur in and .
Prove that the following rules are admissible in PrC:
;
;
.
Prove the deduction theorem for PrC: if , then .
Prove that if in PrC and , then .
Prove that the assertion of Problem II.3.24 of 3 holds in PrC.
Prove the following rules:
-elimination: , where and are subject to the same requirements as in axiom scheme 11;
-introduction: under the same conditions as in (a);
-introduction: , where is not free in the formulas of ;
-elimination: , where is not free in the formulas of or in the formula .
Prove that the formula is derivable in PrC if and only if the formula is derivable.
Let not occur bound in or in , and let in PrC. Prove that there exists a derivation of from in PrC in which never occur bound.
Let not occur bound in or in ; let be variables not occurring bound in or in . Prove that
Let be a set of formulas of signature , and a formula of signature . Prove that if in PrC, then there exists a derivation of from in PrC consisting only of formulas of signature .
Prove that if the formula is derivable in PrC, then the sequent is derivable in PrSC.
Prove that:
if the sequent is derivable in PrSC, then in PrC;
if the sequent is derivable in PrSC, then in PrC;
if the sequent is derivable in PrSC, then the formula is derivable in PrC.
Let be a formula, a subformula of the formula , and the result of replacing some occurrence of in by the formula . Prove that if , then (the replacement theorem for PrC).
Prove that if in PrC, then .
Prove that all formulas derivable in PrC are identically true.
Prove that if a set of formulas is satisfiable, then it is consistent. (A set is satisfiable if there exist an algebraic system and values in of the free variables such that all formulas of are true for these values of the variables.)
Prove that a set of formulas is inconsistent if and only if every formula is derivable in PrC from .
Prove that if the sets of formulas are consistent and (), then is a consistent set of formulas.
Prove the Lindenbaum theorem: every consistent set of formulas can be extended to a complete consistent set of the same signature.
Let a set of formulas of signature be complete and satisfy the condition: for every formula of signature with one free variable , if , then for some closed term of signature . Prove that:
for some closed term of signature ;
for every closed term of signature .
Let the set be consistent. Prove that if the variable does not occur in or in , then the set is consistent.
Prove that every consistent set of sentences is satisfiable (the model existence theorem).
Prove the Lowenheim--Skolem theorem: every satisfiable set of sentences is satisfiable in some countable algebraic system.
Prove that if the sentence is not derivable in PrC, then is satisfiable on the natural numbers.
Prove that the formula is identically true if and only if is derivable in PrC (Godel's completeness theorem for PrC).
Show that if the sentence is true in every system on the natural numbers, then is identically true.
Prove that if the sentence is satisfiable in some system, then is satisfiable on the natural numbers.
Prove that if the sentence is true in every system on which the formulas of a countable set are true, then .
Prove that if a set of sentences is countable and every finite subset is satisfiable, then the whole set is satisfiable (Mal'tsev's local theorem).
Prove that if the negation of every conjunction of finitely many sentences of a countable set is unprovable in PrC, then the set is satisfiable.
Prove, for every sentence and every countable set ,
(the adequacy theorem).
Prove that if is a countable set of sentences and , then for some finite subset (Mal'tsev's compactness theorem).
Prove that, for to be derivable in PrC, it is not sufficient that be true in every finite system.
Let be a quantifier-free formula of PrC. Prove that is derivable in PrC if and only if is derivable using only axioms 1--10 by rule I.
Are the formulas derivable in PrC:
;
;
;
;
?
Prove that the following are derivable in PrCE of signature :
for every term of signature ;
for every formula of signature .
Prove that if is a set of axioms of the theory of signature , and is an algebraic system of signature in which all formulas of are true, then all theorems of the theory are true in .
Let the sentence be true in every system in which all axioms of the theory are true. Prove that belongs to .
Prove that if all axioms of the theory are true in some algebraic system, then there exists a model of the theory .
Prove that every consistent theory has a model.
Prove that if the sentence is true in every model of the theory , then is a theorem of the theory (the completeness theorem for PrCE).
Let the sentence be a theorem of the theory of signature . Let the theory of signature , where , have as axioms all axioms of the theory and
Prove that for every formula of signature there exists a formula of signature satisfying the conditions:
-
if does not occur in , then ;
-
is a theorem of the theory .
Prove that if does not contain and is a theorem of the theory , then is a theorem of .
Prove that if an elementary theory has an infinite model, then also has a countable model.
Prove that the theory has a model if and only if every finite subset is satisfiable.
Prove that if, for every natural number , the theory has a model of cardinality greater than , then this theory has an infinite model.
Prove that there is no sentence true in every finite model and false in every infinite model.
Prove that if the sentence is true in every infinite group, then is true in every finite group of sufficiently large order.
Prove that the theory of equality is incomplete.
Prove that a sentence of signature is true in every normal system if and only if is a theorem of the theory .
Construct an algorithm that, for any sentence of signature , determines whether this sentence is a theorem of the theory .
Are the following sentences theorems of the theory :
;
?
Let the signature contain a single 2-ary predicate , and let be the set of sentences derivable from , where
Is a complete theory?
Prove that is a consistent theory.
Is the system of sentences independent?
Prove the derivability in of the formulas:
;
.
Prove that every model of the theory is infinite.
Define the constant 0 and the functions and so that the model of the theory becomes the set:
;
();
();
( for all and for ).
Can the constant 0 and the functions and be defined so that the model of the theory becomes:
the set of all integers;
the set of all nonnegative rational numbers;
the set of all rational numbers?
Prove that the theory is consistent.
Prove the dependence of the axioms of the theory .
Prove that all formulas of Problem II.7.20 are theorems of the theory .
Prove that there exists a nonstandard (i.e., not isomorphic to the system ) model of the theory .
Prove that the following formulas are theorems of :
;
.
Prove that for every formula with one free variable , the following formulas are theorems of :
(strong induction);
(the least-number principle);
(the method of infinite descent).
Let us introduce the following abbreviations:
Prove that the following formulas are theorems of :
;
.
Write a formula such that is a theorem of the theory if and only if is a prime number.
Let us introduce the following abbreviations:
Prove that the following formulas are theorems of :
;
;
;
;
;
.
Prove that every theorem of the theory is a theorem of the theory .
Is the system of formulas
independent?
Prove that the standard model of arithmetic is isomorphically embeddable in every model of the theory .
Prove in ZF the following theorems:
;
;
.
Prove that the following statements about ordinal numbers are theorems of ZF:
;
;
, where is a formula meaning that is a total irreflexive order on ;
;
, where is a formula with one free variable (transfinite induction);
;
;
.
Prove in ZF the following theorems:
;
;
;
;
.
Prove in ZF the following theorems:
;
;
;
;
;
.
Prove in ZF the induction principle for natural numbers: for every formula with one free variable ,
Prove in ZF the following theorems:
;
;
;
;
;
.
Prove that if is a theorem of the theory , then the formula , obtained from by relativizing the quantifiers with respect to , is a theorem of the theory ZF.
Prove that if is a filter over , then .
Let . Prove that is a filter over .
Let be a filter over and . Show that is a filter over , and also that if is a nonprincipal filter, then is also a nonprincipal filter.
Prove that if some finite set belongs to a filter, then this filter is principal.
Prove that every nonprincipal ultrafilter contains all sets having finite complements.
Prove that a filter over is an ultrafilter if and only if is a maximal element in the set of all filters over , ordered by inclusion.
Prove that in the set of all filters over , ordered by inclusion, is the least element. Show also that if , then has no greatest element.
Prove that, for a filter over containing the set to exist, it is necessary and sufficient that the intersection of any finite number of elements of be nonempty.
Let be an infinite set of cardinality and
Prove that is a filter over .
Prove that a system of subsets of a set is contained in some Frechet filter if and only if every intersection of finitely many sets of the system has cardinality equal to the cardinality of the set .
Show that every nonprincipal ultrafilter over a countable set is a Frechet filter.
Let be a filter over , , and . Prove that, for to be a filter over , it is necessary and sufficient that for every .
Let be an ultrafilter over , , and . Prove that, for to be an ultrafilter over , it is necessary and sufficient that belong to .
Show that every filter can be extended to an ultrafilter.
Prove that every filter is the intersection of all ultrafilters containing it.
Let and be filters over . Prove that
Prove that if the union of a finite sequence of subsets of a set belongs to an ultrafilter , then at least one of the sets belongs to .
Let be an ultrafilter and filters over . Prove that if , then there exists () such that .
Let the set be infinite. Construct an ultrafilter and a family of ultrafilters such that , but does not contain for any .
Prove that , where is an ultrafilter, contains at most one point.
Let be a filter over and some equivalence relation on . Let . Prove that:
is a filter over ;
if is an ultrafilter, then is an ultrafilter;
if is an ultrafilter and for every , then is a nonprincipal ultrafilter.
Prove that a filter over is countably complete if and only if there is no decreasing sequence of elements such that .
Prove that is an equivalence relation on .
Prove that if , then:
;
.
Prove that for every ,
where .
Prove that the canonical mapping , where , is a homomorphism of onto . Show that, in general, this homomorphism is not a strong homomorphism.
Prove that if a sentence containing neither nor is true on the direct product , then it is true on the filtered product with respect to any filter .
Prove that if are filters over and , then the mapping defined by is a homomorphism of onto .
Let , where is a filter over . Show that
where is the filter formed by the intersections of with the sets of the filter . In particular, if is a principal filter consisting of subsets of the set , then
Let be finite and a filter over . Prove that is isomorphic to the direct product of some of the systems .
Let be a partition of , let filters be given over , and let a filter be given over . Show that
is a filter over and, for all (),
(the associative law for filtered products).
Prove that if the intersection of all sets of a filter over is nonempty and does not belong to , then
where and is the filter over formed by the intersections of with all sets of the filter .
Let be homomorphisms, and let , where for , . Prove that then is a homomorphism of into . Prove that if the are strong homomorphisms (isomorphisms), then so is .
Let be a one-to-one correspondence between and , let be a filter over , and . Prove that
Let be a family of sets, and let an equivalence relation be given on such that . Prove that for every ultrafilter over there exists an isomorphic embedding of into , where is constructed as in Problem II.8.21, and for and .
Let be the family of all finite nonempty subsets of , and let be a family of algebraic systems of signature . Prove that there exists a filter over such that for every filter over there exists an isomorphic embedding of into .
Prove that if and are conditionally filterable with respect to the filter over , then , , are also conditionally filterable with respect to .
Prove that if and are filterable with respect to the filter over , then , are also filterable with respect to .
Prove that atomic formulas are filterable with respect to every filter.
Let be filterable with respect to the ultrafilter . Prove that is filterable with respect to .
Prove that every formula is filterable with respect to every ultrafilter (os's theorem).
Let be filterable with respect to the filter over , and let be conditionally filterable with respect to . Prove that and are conditionally filterable with respect to .
Call a formula Horn if it is obtained from formulas of the form , , , where is a conjunction of atomic formulas and 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.
Prove that the ultraproduct of linearly ordered sets is linearly ordered.
Prove that the filtered product of preordered sets is preordered.
Prove that the filtered product of partially ordered sets is partially ordered.
Prove that the filtered product of groups is a group.
Let a finite system contain elements. Prove that every ultrapower of also contains elements.
Show that if the cardinalities of all the factors do not exceed a natural number , then the cardinality of the ultraproduct does not exceed .
Prove that every filtered product of infinite systems is infinite.
Suppose that for every the family contains only finitely many systems of cardinality . Prove that in this case the ultraproduct with respect to a nonprincipal ultrafilter is infinite.
Prove that if for every , then for every filter over ,
Let all the factors () be finite, let be an ultrafilter over , and let for every . Prove that has the cardinality of the continuum.
Let all the factors () be finite or countable, let be a nonprincipal ultrafilter over the set of natural numbers , and let for every natural number . Prove that the cardinality of equals the continuum.
Prove that if is not a countably complete ultrafilter over , and for every natural number we have , then has cardinality at least the continuum.
Let all () be countable, and let be a countably complete ultrafilter over . Prove that .
Let be partially ordered sets (), where contains minimal elements. What is the cardinality of the set of minimal elements in the ultraproduct , if is a nonprincipal ultrafilter over ?
Prove that for every infinite set there exists a filter over such that for every filter over containing , and every infinite system ,
Prove that for every infinite algebraic system and every given cardinality , there exists an ultrapower of the system whose cardinality is greater than .
Prove that if is a not countably complete ultrafilter over and the algebraic system is infinite, then the natural embedding , i.e., , where for all , is not a one-to-one correspondence between and .
Prove that the class is axiomatizable.
Prove that the union and intersection of axiomatizable classes are axiomatizable.
Let be an axiomatizable class, , and isomorphic to . Show that .
Let be an axiomatizable class, and , where is an ultrafilter over . Prove that .
Prove that if a class of algebraic systems is axiomatizable, then the class of all infinite systems from is also axiomatizable.
Let be an axiomatizable class containing finite systems with arbitrarily large numbers of elements. Construct an infinite system from the class . Prove that contains an infinite system of cardinality the continuum.
Prove that the following are not axiomatizable:
the class of finite groups;
the class of finite abelian groups;
the class of cyclic groups.
Prove that the class of fields of finite characteristic is not axiomatizable.
Let , be a family of well-ordered sets such that . Prove that the ultraproduct is well-ordered with respect to if and only if is a principal ultrafilter. Deduce that the class of well-ordered sets is not axiomatizable.
Prove that a class is axiomatizable if and only if it is closed under ultraproducts and elementary equivalence.
Prove that an elementary theory has a model if and only if every finite subset is satisfiable (Mal'tsev's local theorem).
Prove that every consistent theory has a model (the model existence theorem).
Prove that, for a class to be finitely axiomatizable, it is necessary and sufficient that and its complement be axiomatizable.
Let be a finitely axiomatizable class and , where is an ultrafilter over . Prove that .
Let be an axiomatizable class containing finite systems with arbitrarily large numbers of elements. Prove that the class of infinite systems of is not finitely axiomatizable.
Prove that the following classes are not finitely axiomatizable:
infinite groups;
infinite partially ordered sets;
infinite linearly ordered sets.
Prove that the class of fields of characteristic 0 is not finitely axiomatizable.
Let the theory have an infinite model. Prove that for every infinite cardinal number there exists a model for of cardinality greater than (Mal'tsev's extension theorem).
Suppose that for every the theory has a model of cardinality greater than . Prove that for every infinite cardinal number there exists a model for of cardinality greater than .
Prove that if every finite impoverishment of every finite submodel of a model is isomorphically embeddable in some model of the class , then is isomorphically embeddable in a suitable ultraproduct of models from .
Let be the diagram of the system and let be a model for . Prove that is isomorphically embeddable in .
Let be a finite algebraic system of finite signature. Prove that there exists an -sentence of signature such that, for every system , is true in if and only if is isomorphically embeddable in .
Let be a finite signature, let () be a system of finite algebraic systems of signature , and suppose there exists such that . Prove that for every ultrafilter over there exists such that .
Let be an algebraic system, a nonempty subset of , and () the family of all subsystems of such that . Prove that is the subsystem of generated by the set .
Prove that if is the subsystem of the system generated by the set , then is the set of all values of terms of signature when the variables take values in the set .
Let , and let be a nonempty subset of . Prove that the subsystem generated by the set has cardinality at most .
Prove that every axiomatizable class consists of impoverishments of algebraic systems of some universally axiomatizable class.
Prove that every system of an axiomatizable class of finite signature contains a finite or countable -subsystem.
Let be an axiomatizable class whose signature has cardinality , and let be some -system. Prove that every subset of cardinality is contained in a suitable -subsystem of the system of cardinality at most (the Lowenheim--Skolem theorem).
Prove that every infinite system of an axiomatizable class admits a -extension of any preassigned cardinality greater than .
Construct an example of an axiomatizable class such that the class contains finite models with arbitrarily large numbers of elements, while all infinite models of have cardinality at least the cardinality of the continuum.
Construct an example of an axiomatizable class such that has a countable model, while every other model of the class that is an extension of this model has cardinality at least the cardinality of the continuum.
Prove that if an axiomatizable class contains a system of cardinality , then for every there exists a -system of cardinality .
Suppose the generalized continuum hypothesis holds: for any cardinal numbers with , it follows that or . Prove that then, for every axiomatizable class , exactly one of the following conditions holds:
the cardinalities of finite systems of are bounded by some natural number, and consists only of finite systems;
the cardinalities of finite systems of are bounded by some natural number, and there exists an infinite cardinal number such that, for every infinite cardinal number , the class contains a model of cardinality if and only if ;
the cardinalities of finite systems of are unbounded, and there exists an infinite cardinal number such that contains a system of infinite cardinality if and only if .
Give examples of classes for each of the cases (a), (b), (c).
Prove that if is an elementary mapping, then is one-to-one, and for every formula and all we have
Let , , where is the set of natural numbers and the set of positive integers. Show that and are elementarily equivalent, but is not an elementary extension of .
Let be the set of even numbers, , , where is the usual order. Is an elementary submodel of ?
Let be the field of real numbers, and the field of complex numbers. Is an elementary extension of ?
Prove that for every ultrafilter over the canonical mapping , defined by , where for all , is an elementary embedding of into . Prove that if is a finite system, then is an isomorphism of onto .
Let be linearly ordered sets (); contains elements.
Construct an isomorphism of the set of integers into , if is a nonprincipal ultrafilter on .
Is this isomorphism an elementary mapping?
Let be the complete diagram of the system and let be a model for . Prove that is elementarily embeddable in .
Prove that for every infinite system and every cardinal number , there exists an elementary extension of the system of cardinality greater than .
Let be a subsystem of the system . Prove that, for to be an elementary subsystem of , it is necessary and sufficient that, for every formula of signature and all , implies the existence of such that .
Prove that every infinite system of finite or countable signature is an elementary extension of a countable system of signature .
Let be an infinite system, , and let be a cardinality such that . Prove that there exists an elementary subsystem of cardinality such that .
Let be an infinite system and . Prove that has an elementary extension of cardinality .
Let be a set of systems such that is an elementary extension of for every . Prove that is an elementary extension of every .
Prove that a class is axiomatizable if and only if is abstract, closed under ultraproducts, and closed under taking elementary subsystems.
Prove that a class of systems of signature is universally axiomatizable if and only if, for every system of signature , the fact that every finite impoverishment of every finite submodel of the system is isomorphically embeddable in some -system implies that belongs to .
Show that a class is universally axiomatizable if and only if is closed under ultraproducts, abstract, and hereditary (closed under taking subsystems).
Let the class be axiomatizable, and let be the class of systems isomorphic to subsystems of -systems. Prove that the class is universally axiomatizable.
Prove that, for and to be elementarily equivalent, it is necessary and sufficient that there exist an ultrafilter over a suitable set for which there exists an elementary mapping of into .
Prove that if and are elementarily equivalent and is finite, then is finite and isomorphic to .
Prove that, for a consistent theory to be complete, it is necessary and sufficient that all of its models be elementarily equivalent.
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.)
Let be an elementary theory having no finite models, which is -categorical for some infinite cardinality . Prove that is a complete theory. (A theory is called -categorical if all of its models of cardinality are isomorphic.)
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.
Let be a complete set of sentences of signature , and let , be two consistent sets of sentences such that all object constants of and all function and predicate symbols of belong to . Prove that the set is consistent.
Let be a complete set of sentences of signature , a sentence all of whose object constants belong to , and consistent. Prove that if is satisfiable in a system , then the set is consistent.
Let be an impoverishment of the system , and let be an elementary extension of . Prove that there exists an elementary extension of the system such that is an elementary extension of .
Let be a complete set of sentences of signature , a sentence of signature , a sentence of signature , and , with all object constants of and all object constants of belonging to . Prove that if and are consistent, then is consistent.
Let be a complete set of sentences of signature , a sentence of signature , a sentence of signature , and . Prove that if and are consistent, then is consistent.
Let be a sentence of signature , a sentence of signature , and in PrC, with and not derivable in PrC. Prove that is nonempty and there exists a sentence of signature such that and in PrC (the interpolation theorem for PrC).