Pages that link to "Item:Q3787974"
From MaRDI portal
The following pages link to Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae (Q3787974):
Displaying 16 items.
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case (Q556680) (← links)
- Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability (Q810494) (← links)
- Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator (Q1096608) (← links)
- The automation of syllogistic. I: Syllogistic normal forms (Q1111540) (← links)
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
- A finite analog to the Löwenheim-Skolem theorem (Q1338480) (← links)
- Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators (Q1854500) (← links)
- Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate (Q2252530) (← links)
- A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT (Q2817912) (← links)
- Truth In V for ∃*∀∀-Sentences is Decidable (Q3416111) (← links)
- Complete Axiomatisations of Properties of Finite Sets (Q3508165) (← links)
- The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability (Q3570158) (← links)
- Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory (Q3768865) (← links)
- Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present (Q3803085) (← links)
- (Q4503906) (← links)
- Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case (Q4884668) (← links)