Pages that link to "Item:Q795031"
From MaRDI portal
The following pages link to Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator (Q795031):
Displaying 12 items.
- Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability (Q810494) (← links)
- Decidability in elementary analysis. II (Q912081) (← 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)
- Decidability and completeness for open formulas of membership theories (Q1903592) (← links)
- A note on the decidability of mls extended with the powerset operator (Q3712309) (← links)
- Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx} (Q3726080) (← 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 VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae (Q3787974) (← links)
- Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present (Q3803085) (← links)
- (Q4865517) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Q5966661) (← links)
