If , interpret each new constant in as the same element . Atomic logical formulas and their negations then have exactly their truth values in , so the expansion satisfies the diagram of a structure. If the inclusion is elementary, every logical formula with those named parameters has the same truth value, so the expansion satisfies the elementary diagram.
Conversely, from any expansion satisfying the diagram of a structure defineThe diagram of a structure contains whenever , so is injective. It contains every true function-value equation, so commutes with all operations and constants. Positive and negative relation instances ensure both preservation and reflection of the relations. Thus is an embedding of first-order structures. If the expansion satisfies the elementary diagram, for every logical formula and tuple it also givesso is an elementary embedding of first-order structures.
The precise conclusion for an arbitrary expansion is an embedding of first-order structures, rather than a literal inclusion of the original carriers. The source's inclusion notation is correct when one uses the customary identification of with its embedded copy, or requires the expansion to interpret as the actual element of a carrier already containing . With that naming convention, is the inclusion and the requested two equivalences follow exactly.
Without the convention the literal wording fails, even in the first-order language of logical equality: singleton first-order structures with carriers and have a diagram-satisfying expansion by sending the first first-order structure's named point to , but the first carrier is not a subset of the second. The embedding of first-order structures formulation proved above states the invariant result and makes the intended inclusion formulation precise.
Articles by others on the same topic
There are currently no matching articles.