Three-quantifier sentences

DOI10.4064/FM177-3-3MaRDI QIDQ4425144zbMATH OpenOpenAlexFDO

Authors Harvey M. Friedman

Publication date 10 September 2003

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4064/fm177-3-3

zbMATH Keywords

3-quantifier sentences5-quantifier sentenceprimitive notation of set theoryweak fragment of ZFwitnesses of 2-quantifier formulasZFC

Mathematics Subject Classification ID

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

Recommendations

• Truth In V for ∃*∀∀-Sentences is Decidable
• PRIMITIVE INDEPENDENCE RESULTS
• The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations
• Publication:3489978
• Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability

Cited in

(2)

• Truth In V for ∃*∀∀-Sentences is Decidable
• The subset relation and 2‐stratified sentences in set theory and class theory

This page was built for publication: Three-quantifier sentences

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