Undecidability results for restricted universally quantified formulae of set theory (Q4291741): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q810493
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Franco Parlamento / rank
 
Normal rank

Revision as of 05:00, 21 February 2024

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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references