Pages that link to "Item:Q4868240"
From MaRDI portal
The following pages link to Decidability of ∀*∀‐Sentences in Membership Theories (Q4868240):
Displaying 13 items.
- Satisfiability of formulae with one \(\forall\) is decidable in exponential time (Q915716) (← links)
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
- 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)
- The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable (Q2655138) (← links)
- (Q3333034) (← links)
- Truth In V for ∃*∀∀-Sentences is Decidable (Q3416111) (← links)
- The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability (Q3570158) (← links)
- Deciding the Inductive Validity of ∀ ∃ * Queries (Q3644758) (← links)
- Provability and Decidability of Arithmetical Universal-Existential Sentences (Q3720563) (← links)
- Foundation versus induction in Kripke-Platek set theory (Q4254688) (← links)
- Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case (Q4884668) (← links)
- A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers (Q6653095) (← links)