Pages that link to "Item:Q4291741"
From MaRDI portal
The following pages link to Undecidability results for restricted universally quantified formulae of set theory (Q4291741):
Displaying 18 items.
- The decidability of the \(\forall ^*\exists\) class and the axiom of foundation (Q1409304) (← links)
- Three-variable statements of set-pairing (Q1885036) (← links)
- Decidability and completeness for open formulas of membership theories (Q1903592) (← links)
- The Bernays-Schönfinkel-Ramsey class for set theory: decidability (Q2915897) (← links)
- Set-syllogistics meet combinatorics (Q2971068) (← links)
- (Q3325714) (← links)
- Truth In V for ∃*∀∀-Sentences is Decidable (Q3416111) (← links)
- Untestable Properties Expressible with Four First-Order Quantifiers (Q3564875) (← links)
- A Uniformly, Extremely Nonextensional Formula of Arithmetic with many Undecidable Fixed Points in many Theories (Q3677758) (← links)
- (Q3691669) (← links)
- (Q3981005) (← links)
- Undecidable hypotheses in Edward Nelson's internal set theory (Q4005527) (← links)
- THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION (Q4295224) (← links)
- Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini (Q4361575) (← links)
- Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable (Q4557171) (← links)
- (Q4865517) (← links)
- (Q4880812) (← links)
- A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers (Q6653095) (← links)