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-1zbMATH Open0542.03003OpenAlexW1977518772MaRDI QIDQ795031FDOQ795031

Authors: Michael Breban, Alfredo Ferro 

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

Recommendations

• scientific article; zbMATH DE number 23190
• scientific article; zbMATH DE number 845472
• Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
• scientific article; zbMATH DE number 4152340
• Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability

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)

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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

Cited In (16)

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decidability in elementary analysis. II
• Decidability and completeness for open formulas of membership theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• European Summer Meeting of the Association for Symbolic Logic
• Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator
• A note on the decidability of mls extended with the powerset operator
• 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
• Title not available (Why is that?)
• Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae
• Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present

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

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