Decidability and completeness for open formulas of membership theories
From MaRDI portal
(Redirected from Decidability and completeness for open formulas of membership theories)
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 ^* class and the axiom of foundation
- Publication:4731166
Cites work
- A minimal predicative set theory
- Decidability of ∀*∀‐Sentences in Membership Theories
- Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
- Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
- Expressing infinity without foundation
- scientific article; zbMATH DE number 3657754 (Why is no real title available?)
- scientific article; zbMATH DE number 3715502 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- On the interpretability of arithmetic in set theory
- THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION
- Undecidability results for restricted universally quantified formulae of set theory
- Undecidable theories
- Witnessing differences without redundancies
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)
