Abstract
I present a new clausal version of NGB set theory, and compare my version with that first given by Boyer et al. [4]. A complete set of reductions for Boolean rings is given, derived from those of Hsiang [7]. I list over 400 theorems proved semiautomatically in elementary set theory, and supply the proofs of several of these, including Cantor's theorem. I present a semiautomated proof that the composition of homomorphisms is a homomorphism, thus solving a challenge problem given in [4]. Using the clauses and heuristics presented, there is no apparent obstacle to the semiautomated development of set theory through considerably more difficult theorems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bailin, S., ‘A λ-Unifiability Test for Set Theory’, Journal of Automated Reasoning 4(3), 269–286 (September 1988).
Bernays, P., and Fraenkel, A., Axiomatic Set Theory, Amsterdam: North Holland (1958).
Bledsoe, W., ‘Splitting and Reduction Heuristics in Automatic Theorem Proving’, Artificial Intelligence 2(1), 57–78 (1971).
Boyer, R., Lusk, E., McCune, W., Overbeek, R., Stickel, M., and Wos, L., ‘Set Theory in First-Order Logic: Clauses for Gödel's Axioms’, Journal of Automated Reasoning 2(3), 287–327 (1986).
Chang, C., and Lee, R., Symbolic Logic and Mechanical Theorem Proving, New York: Academic Press (1973).
Gödel, K., The Consistency of the Axiom of Choice and of the Generalized Continuum Hypothesis with the Axioms of Set Theory, Princeton: Princeton University Press (1940).
Hsiang, J., ‘Refutational Theorem Proving using Term-Rewriting Systems’, Artificial Intelligence 25(3), 255–300 (1985).
Knuth, D., and Bendix, P., ‘Simple Word Problems in Universal Algebras’, in Computational Problems in Abstract Algebra, J. Leech (ed.), New York: Pergamon Press (1970).
Loveland, D., Automated Theorem Proving: A Logical Basis, Amsterdam: North Holland (1978).
Lusk, E., and Overbeek, R., ‘Experiments with Resolution-Based Theorem-Proving Algorithms’, Computers and Mathematics with Applications 8(3), 141–152 (1982).
McAllester, D., Ontic: A Knowledge Representation System for Mathematics, Cambridge: MIT Press (1989).
McCune, W., Otter 1.0 User's Guide, ANL-88/44, Argonne National Laboratory (1989).
Mendelson, E., Introduction to Mathematical Logic, Third Edition, Monterey: Wadsworth & Brooks/Cole (1987).
Moravec, H., Mind Children: The Future of Robot and Human Intelligence, Cambridge: Harvard University Press (1988).
Robinson, J., ‘A Machine Oriented Logic Based on the Resolution Principle’, J. Assoc. Comp. Mach. 12, 23–41 (1965).
Quaife, A., ‘Automated Proofs of Löb's Theorem and Gödel's Two Incompleteness Theorems’, Journal of Automated Reasoning 4(2), 219–231 (June 1988).
Quaife, A., ‘Automated Development of Tarski's Geometry’, Journal of Automated Reasoning 5(1), 97–118 (March 1989).
Quine, W., ‘The Problem of Simplifying Truth Functions’, American Mathematical Monthly 59(8), 521–531 (October 1952).
Suppes, P., Axiomatic Set. Theory, New York: Dover (1972).
Winker, S., and Wos, L., ‘Procedure Implementation through Demodulation and Related Tricks’, Proceedings of the Sixth Conference on Automated Deduction (ed.) D. Loveland, New York: Springer-Verlag (1982).
Wos, L., Overbeek, R., Lusk, E., and Boyle, J., Automated Reasoning, Englewood Cliffs: Prentice Hall (1984).
Wos, L., Automated Reasoning: 33 Basic Research Problems, Englewood Cliffs: Prentice Hall (1988).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Quaife, A. Automated deduction in von Neumann-Bernays-Gödel set theory. J Autom Reasoning 8, 91–147 (1992). https://doi.org/10.1007/BF00263451
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00263451