Suppose a first-order theory characterized equivalence relations with exactly one infinite class. Name two inequivalent points and require each named class to have at least elements for every positive integer . Every finite subset is satisfied with one infinite class and a sufficiently large finite class. Compactness theorem would produce a first-order model with two infinite classes, a contradiction.
If a theory were inconsistent, a proof of contradiction would use a finite inconsistent subset. Therefore consistency of every finite subset implies consistency of the whole theory, and completeness supplies a model.
The class of all partially ordered sets with finitely many maximal elements is not axiomatizable by a first-order theory. Suppose axiomatizes this full class. Add constants , require them pairwise distinct, and require each to be maximal:Every finite subset is realized in a finite antichain, which has as many maximal elements as needed and is a model of . By the compactness theorem, the enlarged theory has a model with infinitely many distinct maximal elements, contradicting the definition of .
The full-class qualification is essential. The class with at most one maximal element is first-order axiomatizable relative to the partial-order axioms. The obstruction is the unbounded finite number permitted by the original class.
In a language with unary predicates , the full class of structures in which exactly one of is infinite is not axiomatizable by a first-order theory. Suppose axiomatizes that class. Add constants for distinct members of and constants for distinct members of .
Every finite fragment is satisfiable: take infinite and finite but large enough to contain its finitely many required distinct witnesses. This structure belongs to the full class and hence satisfies all of . The compactness theorem then supplies a model of in which both predicates are infinite, a contradiction.
The same argument applies to definable sets whenever these finite requirements can be realized within the proposed class. It does not forbid axiomatizing a more restricted subclass: for example, the requirement that be infinite and empty is axiomatizable by an infinitude schema and one emptiness sentence.
If a first-order theory had exactly the finite structures in a class containing arbitrarily large members, adjoin constants and require them to be pairwise distinct. Every finite fragment has a sufficiently large finite model, while compactness produces an infinite model, a contradiction. In particular, finite groups are not first-order axiomatizable.
If a theory axiomatized the well-orders, adjoin constants and the sentences . Every finite fragment has a finite well-ordered model, but compactness would produce a model with an infinite descending chain.
Articles by others on the same topic
The Compactness Theorem is a fundamental result in mathematical logic, particularly in model theory. It states that a set of first-order sentences (or propositions) has a model (i.e., it is consistent) if and only if every finite subset of that set has a model.