Decision procedures for elementary sublanguages of set theory: XII. Multilevel syllogistic extended with singleton and choice operators

zbMATH Open0734.03005MaRDI QIDQ810492

Alfredo Ferro

Publication date: 1991

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

zbMATH Keywords

choice operatortransfinite inductiondecision algorithmsunquantified theory of sets

Mathematics Subject Classification ID

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

Related Items (4)

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?) ⋮ 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

This page was built for publication: Decision procedures for elementary sublanguages of set theory: XII. Multilevel syllogistic extended with singleton and choice operators

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