Abstract
Completeness results and decision algorithms for unquantified theory of sets involving the choice operator are presented. The interest for considering the choice operator is justified by the problem of formalizing transfinite induction in automated theorem proving.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
CantoneD., FerroA., and OmodeoE. G. (1988). ‘Decision procedures for elementary sublanguages of set theory. VIII. A semidecision procedures for finite satisfiability of unquantified set-theoretic formulae’. Comm. Pure Appl. Math. 51, 105–120.
FerroA., OmodeoE. G., and SchwartzJ. T. (1980). ‘Decision procedures for elementary sublanguages of set theory. I. Multi-level Syllogistic and some extensions’, Comm. Pure Appl. Math. 33, 599–608.
FerroA. and OmodeoE. G. (1987). ‘Decision procedures for elementary sublanguages of set theory. VII. Validity in set theory when a choice operator is present’, Comm. Pure Appl. Math. 40, 265–280.
Jech, T. (1978). Set Theory, Academic Press.
Leisenring, A. C. (1969). Mathematical Logic and Hilbert's ε-Symbol, MacDonald & Co.
Omodeo, E. G. (1984). Decidability and Proof Procedures for Set Theory with a Choice Operator, Ph. D. Thesis New York University.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ferro, A. Decision procedures for elementary sublanguages of set theory: XII. Multilevel syllogistic extended with singleton and choice operators. J Autom Reasoning 7, 257–270 (1991). https://doi.org/10.1007/BF00243809
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00243809