Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator

DOI10.1016/0196-8858(84)90007-1zbMath0542.03003OpenAlexW1977518772MaRDI QIDQ795031

Alfredo Ferro, Michael Breban

Publication date: 1984

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(84)90007-1

zbMATH Keywords

power setdecidability resultsclasses of unquantified set-theoretic formulaegeneral set union

Mathematics Subject Classification ID

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

Related Items (5)

Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator ⋮ European Summer Meeting of the Association for Symbolic Logic ⋮ Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx} ⋮ The automation of syllogistic. I: Syllogistic normal forms ⋮ Unnamed Item

Cites Work

• Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
• Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
• Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
• Sentences with three quantifiers are decidable in set theory
• Unnamed Item
• Unnamed Item

This page was built for publication: Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator