Undecidability results for restricted universally quantified formulae of set theory (Q4291741)

From MaRDI portal
Revision as of 14:47, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 567370
Language Label Description Also known as
English
Undecidability results for restricted universally quantified formulae of set theory
scientific article; zbMATH DE number 567370

    Statements

    Undecidability results for restricted universally quantified formulae of set theory (English)
    0 references
    0 references
    0 references
    17 October 1994
    0 references
    undecidability in first-order set theoretic language
    0 references
    ZF without Foundation Axiom
    0 references
    codings of Turing machine computations in set theoretic language
    0 references
    satisfiability
    0 references
    \(\omega\)-models
    0 references
    antifoundation axiom
    0 references
    0 references

    Identifiers

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