Decidability and completeness for open formulas of membership theories
From MaRDI portal
Publication:1903592
DOI10.1305/NDJFL/1040248461zbMATH Open0837.03007OpenAlexW1965171814MaRDI QIDQ1903592FDOQ1903592
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
Recommendations
- Publication:4893143
- scientific article; zbMATH DE number 937378
- Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator
- The decidability of the \(\forall ^*\exists\) class and the axiom of foundation
- Publication:4731166
Cites Work
- Undecidable theories
- Title not available (Why is that?)
- Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
- Title not available (Why is that?)
- Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
- Title not available (Why is that?)
- A minimal predicative set theory
- Expressing infinity without foundation
- Decidability of ∀*∀‐Sentences in Membership Theories
- Witnessing differences without redundancies
- Undecidability results for restricted universally quantified formulae of set theory
- On the interpretability of arithmetic in set theory
- THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION
Cited In (4)
This page was built for publication: Decidability and completeness for open formulas of membership theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903592)
