Truth In V for ∃*∀∀-Sentences is Decidable

DOI10.2178/JSL/1164060452zbMATH Open1109.03057OpenAlexW2155997936MaRDI QIDQ3416111FDOQ3416111

Authors: Dorella Bellè, Franco Parlamento 

Publication date: 19 January 2007

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1164060452

Recommendations

• Decidability of \(\exists^*\forall\forall\)-sentences in HF
• Undecidability results for restricted universally quantified formulae of set theory
• Three-quantifier sentences
• Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae
• THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION

zbMATH Keywords

decidabilityZFCfirst-order languagecumulative set-theoretic hierarchyprimitive language of set theorythree-quantifier sentences

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Models of arithmetic and set theory (03C62) Axiomatics of classical set theory and its fragments (03E30)

Cites Work

• The ∀_n∃‐Completeness of Zermelo‐Fraenkel Set Theory
• Decidability of ∀*∀‐Sentences in Membership Theories
• Witnessing differences without redundancies
• Three-quantifier sentences

Cited In (6)

• Three-quantifier sentences
• Decidability of ∀*∀‐Sentences in Membership Theories
• An ‘i’ for an i, a Truth for a Truth†
• On interpretations of bounded arithmetic and bounded set theory
• Decidability of \(\exists^*\forall\forall\)-sentences in HF
• A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers

This page was built for publication: Truth In V for ∃*∀∀-Sentences is Decidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416111)