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

zbMATH Open0734.03003MaRDI QIDQ810489FDOQ810489

Authors: Domenico Cantone 

Publication date: 1991

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Recommendations

• Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator
• scientific article; zbMATH DE number 1263308
• Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\)
• Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator
• Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate

zbMATH Keywords

satisfiabilitydecision procedureunquantified formulae of set theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Set theory (03E99)

Cited In (24)

• The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
• 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?)
• 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
• Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator
• Title not available (Why is that?)
• 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?)
• Title not available (Why is that?)
• Set theory for verification. I: From foundations to functions
• Title not available (Why is that?)
• 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_ <\)
• Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator
• 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
• Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator
• Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae

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)