Finite axiomatizations for existentially closed posets and semilattices (Q1087537)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Finite axiomatizations for existentially closed posets and semilattices
scientific article

    Statements

    Finite axiomatizations for existentially closed posets and semilattices (English)
    0 references
    0 references
    1986
    0 references
    It is well known that any universal first order relational theory K with the joint embedding and the amalgamation property admits an \(\aleph_ 0\)-categorical model-completion \(\bar K\) which is given by formalizing the finite diagrams of models of K according to the back and forth method [e.g. the reviewer's dissertation, Z. Math. Logik Grundlagen Math. 15, 37-48 (1969; Zbl 0188.321), p. 42, footnote]. Applied to totally ordered sets the method yields the densely ordered sets without endpoints. The authors establish similar finite axiomatizations of \(\bar K\) for posets and semilattices.
    0 references
    existentially closed posets
    0 references
    existentially closed semilattices
    0 references
    finite axiomatizability
    0 references
    model companions
    0 references
    categoricity
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references