Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and pred_ <
From MaRDI portal
[Part XVI is reviewed below (see Zbl 0698.03004).] From the authors' introduction: ``This paper gives a decision procedure for an unquantified fragment of set theory involving the constant \(\emptyset\), the Boolean set operators \(\cap\), \(\cup\), \(\setminus\), \(\{\) \(\}\) (singleton), the rank predicate, and the predicates \(=\), \(\in\), \(\subseteq\), Finite.
Recommendations
- Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs
- Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
- Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator
- Decision procedures for elementary sublanguages of set theory: XII. Multilevel syllogistic extended with singleton and choice operators
- Publication:3475242
Cites work
- Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx}
- Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
- Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs
Cited in
(17)- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership
- Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate
- A decision procedure for restricted intensional sets
- scientific article; zbMATH DE number 5151001 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3983142 (Why is no real title available?)
- Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present
- scientific article; zbMATH DE number 1512848 (Why is no real title available?)
- scientific article; zbMATH DE number 1765710 (Why is no real title available?)
- A decision procedure for sets, binary relations and partial functions
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions
- Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
- Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs
- Decision procedures for elementary sublanguages of set theory: XII. Multilevel syllogistic extended with singleton and choice operators
- Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
This page was built for publication: Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912082)
