A set of propositions has a model exactly when every finite subset has a model. Syntactically, a contradiction uses only finitely many assumptions, and every consistent set extends by Zorn lemma to a maximal consistent set in propositional logic.
Let and let be infinite, with an injection available. In the propositional logic with variables , no finitary theory has as its models exactly all total injections , represented by their true pairs. Fix and suppose axiomatizes that entire class. Adjoin for every .
Every finite subset of these extra requirements is satisfiable together with : start with any total injection and permute so that the value at avoids the finitely many forbidden values. The propositional compactness theorem then supplies a model of in which has no value, a contradiction.
The requirement that all total injections be models is essential. A theory can certainly force totality by specifying a particular injection, with one axiom for each . What fails is a finitary axiomatization of the full unrestricted class. Conditions saying at most one value per input and at most one input per value are expressible by pairwise prohibitions.
Articles by others on the same topic
There are currently no matching articles.