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.
Articles by others on the same topic
There are currently no matching articles.