Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
From MaRDI portal
Publication:810489
zbMath0734.03003MaRDI QIDQ810489
Publication date: 1991
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\) ⋮ Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership ⋮ Adding the power-set to description logics ⋮ Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* ⋮ Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate ⋮ The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations ⋮ Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators ⋮ Set theory for verification. I: From foundations to functions
This page was built for publication: Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators