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

DOI10.2178/JSL/1164060452MaRDI QIDQ3416111zbMATHOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(7)

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

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)