Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator

DOI10.1002/cpa.3160380507zbMath0582.03005OpenAlexW1994872660MaRDI QIDQ3705420

Alfredo Ferro, Domenico Cantone

Publication date: 1985

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://archive.org/details/decisionprocedurd00cant

zbMATH Keywords

algorithmsatisfiabilitypower setset theoretic conjunctionsset theoretic formulas

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Set theory (03E99)

Related Items (4)

A set-theoretic translation method for polymodal logics ⋮ The automation of syllogistic. I: Syllogistic normal forms ⋮ A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions ⋮ Adding the power-set to description logics

Cites Work

• Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx}

This page was built for publication: Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator