Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators

Cited In (15)

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
Adding the power-set to description logics
Title not available (Why is that?)
A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case
Title not available (Why is that?)
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*
Title not available (Why is that?)
Set theory for verification. I: From foundations to functions
Title not available (Why is that?)
Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
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_ <\)
Title not available (Why is that?)
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

   Recommendations

This page was built for publication: Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810489)