A graph must assign exactly one output to every input, while the distinguished unary predicate must select exactly one element. Suitable sentences areThe existential clauses provide totality and nonemptiness of the selected output, respectively; the universal clauses provide uniqueness. Thus a structure satisfying uniquely determines a total unary function and a constant on its unchanged domain. Conversely any interpretations of determine such relations by and .
For each term define an -formula expressing its value. Use fresh bound variables at every step:Freshness includes avoiding all relevant free variables of the formula being translated. Define the atomic translation byand extend through the logical operations: , , and . Fresh witnesses prevent variable capture and ensure the translation preserves the original free-variable set.
For an -structure , let have the graph relation of and singleton relation . Induction on terms proves that holds precisely when is the value of . Induction on formulas then provesConversely every -structure satisfying is uniquely the relational version of an -structure on that same domain. Hence, for arbitrary possibly infinite , semantic entailment on the left is equivalent to semantic entailment from on the right, with assignments retained in the free-formula case. Applying soundness theorem for first-order logic and Gödel's completeness theorem givesThe prohibition on completeness in the preceding direct equality question is local to that proof; here it supplies the clean semantic-to-syntactic transfer after the actual translation and model correspondence have been established.
Articles by others on the same topic
There are currently no matching articles.