Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx}
From MaRDI portal
Publication:3726080
Recommendations
Cited in
(12)- Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator
- The automation of syllogistic. I: Syllogistic normal forms
- scientific article; zbMATH DE number 4143941 (Why is no real title available?)
- Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator
- A note on the decidability of mls extended with the powerset operator
- 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
- scientific article; zbMATH DE number 4108742 (Why is no real title available?)
- scientific article; zbMATH DE number 679898 (Why is no real title available?)
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions
- scientific article; zbMATH DE number 4183384 (Why is no real title available?)
- The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations
- Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\)
This page was built for publication: Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3726080)