Skip to main content
Log in

The problem of finding an inference rule for set theory

  • Basic Research Problem
  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

This article is the ninth of a series of articles discussing various open research problems in automated reasoning. Here we focus on finding an inference rule for set theory. The problem proposed for research asks one to find a means for building in set-theoretic reasoning in a manner similar to the way paramodulation builds in equality-oriented reasoning. For evaluating a proposed solution to this research problem, we include suggestions concerning possible test problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. 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’, J. Automated Reasoning 2, pp. 287–327 (1986).

    Google Scholar 

  2. Gödel, K. The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis with the Axioms of Set Theory, Princeton University Press, Princeton (1940).

    Google Scholar 

  3. Robinson, G., and Wos, L., ‘Paramodulation and theorem-proving in first-order theories with equality’, pp. 135–150 in Machine Intelligence 4, ed. B. Meltzer and D. Michie, Edinburgh University Press, Edinburgh (1969).

    Google Scholar 

  4. Wos, L., Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, New Jersey (1987).

    Google Scholar 

  5. Wos, L., Overbeek, R., Lusk, E., and Boyle, J., Automated Reasoning: Introduction and Applications, Prentice-Hall, Englewood Cliffs, New Jersey (1984).

    Google Scholar 

  6. Wos, L., and Robinson, G., ‘Maximal models and refutation completeness: Semidecision procedures in automatic theorem proving’, pp. 609–639 in Word Problems: Decision Problems and the Burnside Problem in Group Theory, ed. W. Boone, F. Cannonito, and R. Lyndon, North-Holland, New York (1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wos, L. The problem of finding an inference rule for set theory. J Autom Reasoning 5, 93–95 (1989). https://doi.org/10.1007/BF00245023

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00245023

Key words

Navigation