Skip to main content

Decision procedures for some fragments of set theory

  • Wednesday Morning
  • Conference paper
  • First Online:
Book cover 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 (CADE 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 87))

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Behmann, H., Beiträge zur Algebra der Logik insbesondere zum Entscheidungsproblem, Math. Annalen 86 (1922) 163–220.

    Article  Google Scholar 

  2. Davis, M., Putnam, H., A computing procedure for quantification theory, J. ACM 7 (1960) 201–215.

    Article  Google Scholar 

  3. Ferro, A., Omodeo, E. G., Schwartz, J. T., Decision procedures for elementary sublanguages of set theory. I. Multilevel syllogistic and some extensions, Comm. Pure Appl. Math. (to appear).

    Google Scholar 

  4. Łukasiewicz, J., Aristotle's Syllogistic, Clarendon Press, 1952.

    Google Scholar 

  5. Nelson, C. G., Oppen, D. C., A simplifier based on efficient decision algorithms, Fifth Ann. Symp. on Principles of Programming Languages (1978) 141–150.

    Google Scholar 

  6. Oppen, D. C., Complexity of combinations of quantifier-free procedures, Workshop on Automatic Deduction, Austin, Texas (1979).

    Google Scholar 

  7. Pratt, V. R., On specifying verifiers, (to appear).

    Google Scholar 

  8. Presburger, M., Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, Comptes-rendus du premier Congrès des mathématiciens des Pays Slaves, Warsaw (1929), 92–101.

    Google Scholar 

  9. Quine, W.V.O. Methods of Logic, Henry Holt & Co., New York, 1950.

    Google Scholar 

  10. Schwartz, J. T., Instantiation and decision procedures for certain classes of quantified set-theoretic formulae. Inst. for Computer Applic. in Science and Engr., NASA Langley Research Center, Hampton, Virginia, Report Number 7810 (1978).

    Google Scholar 

  11. Schwartz, J. T., A survey of program proof technology, Courant Institute, Comp. Sci. Dept., Report No. 1, September 1978.

    Google Scholar 

  12. Shepherdson, J. C., On the interpretation of Aristotle's syllogistic, J. Symb. Log. 21 (1956) 137–147.

    Google Scholar 

  13. Tarski, A., Ordinal Algebras, North-Holland, Amsterdam, 1956.

    Google Scholar 

  14. Ville, F., Décidabilité des formules existentielles en théorie des ensembles, C. R. Acad. Sc. Paris, t. 272, Série A (1971), 513–516.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wolfgang Bibel Robert Kowalski

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferro, A., Omodeo, E.G., Schwartz, J.T. (1980). Decision procedures for some fragments of set theory. In: Bibel, W., Kowalski, R. (eds) 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980. CADE 1980. Lecture Notes in Computer Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10009-1_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-10009-1_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10009-6

  • Online ISBN: 978-3-540-38140-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics