Pages that link to "Item:Q4295224"
From MaRDI portal
The following pages link to THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION (Q4295224):
Displaying 7 items.
- The decidability of the \(\forall ^*\exists\) class and the axiom of foundation (Q1409304) (← links)
- Decidability and completeness for open formulas of membership theories (Q1903592) (← links)
- Deciding simple infinity axiom sets with one binary relation by means of superpostulates (Q2096446) (← links)
- Truth In V for ∃*∀∀-Sentences is Decidable (Q3416111) (← links)
- Undecidability results for restricted universally quantified formulae of set theory (Q4291741) (← links)
- Witnessing differences without redundancies (Q4332986) (← links)
- A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers (Q6653095) (← links)