Decidability and completeness for open formulas of membership theories

DOI10.1305/ndjfl/1040248461zbMath0837.03007OpenAlexW1965171814MaRDI QIDQ1903592

Dorella Bellè, Franco Parlamento

Publication date: 13 May 1996

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1040248461

zbMATH Keywords

completenessdecidabilityregularity axiomextensionality axiomantifoundation axiomopen formulas

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items (1)

The decidability of the \(\forall ^*\exists\) class and the axiom of foundation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
• A minimal predicative set theory
• On the interpretability of arithmetic in set theory
• Undecidable theories
• Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
• Expressing infinity without foundation
• Undecidability results for restricted universally quantified formulae of set theory
• THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION
• Witnessing differences without redundancies
• Decidability of ∀*∀‐Sentences in Membership Theories

This page was built for publication: Decidability and completeness for open formulas of membership theories