Axiomatizable Classes
[63/92%]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).