Skip to main content
SpringerLink
Log in

Set-theoretic reductions of Hilbert's tenth problem

  • Conference paper
  • First Online:
CSL '89 (CSL 1989)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Börger. Computability, complexity, logic. North-Holland, Amsterdam, 1989.

    Google Scholar 

  2. M. Breban, A. Ferro, E.G. Omodeo, and J.T. Schwartz. Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions. Comm. Pure App. Math., XXXIV:177–195, 1981.

    Google Scholar 

  3. C. Cantone. A survey of computable set theory. Le Matematiche, to appear.

    Google Scholar 

  4. D. Cantone and V. Cutello. A decision procedure for set-theoretic formulae involving rank and cardinality comparison. Proceedings of 3rd Italian Conference on Theoretical Computer Science, Mantova, pp. 150–163, 1989.

    Google Scholar 

  5. D. Cantone, A. Ferro, and E.G. Omodeo. Computable Set Theory. Oxford University Press, to appear.

    Google Scholar 

  6. A. Ferro, E.G. Omodeo, and J.T. Schwartz. Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions. Comm. Pure App. Math., XXXIII:599–608, 1980.

    Google Scholar 

  7. T.J. Jech. Set theory. Academic Press, New York, 1978.

    Google Scholar 

  8. A. Levy. Basic Set Theory. Springer-Verlag, 1979.

    Google Scholar 

  9. Y. Matijasevič. Enumerable sets are Diphantine sets. Soviet Math. Doklady, 11:354–357, 1970.

    Google Scholar 

  10. F. Parlamento and A. Policriti. 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. Comm. Pure App. Math., XLI:221–251, 1988.

    Google Scholar 

  11. W. Schönfeld. An undecidability result for relation algebras. JSL, 44:111–115, 1979. Refinement in: Gleichungen in der Algebra der binären Relationen. Habilitationsschrift, §5, Minerva Publikation, München 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department Courant Institute of Mathematical Sciences, New York University, 251 Mercer St., 10012, New York, New York

    D. Cantone, V. Cutello & A. Policriti

  2. Dipartimento di Matematica, Università di Catania, Viale A. Doria 6A, 95125, Catania, Italy

    D. Cantone & V. Cutello

  3. Dipartimento di Matematica e Informatica, Università di Udine, Via Zanon 6, 33100, Udine, Italy

    A. Policriti

Authors
  1. D. Cantone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Cutello
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Policriti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cantone, D., Cutello, V., Policriti, A. (1990). Set-theoretic reductions of Hilbert's tenth problem. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '89. CSL 1989. Lecture Notes in Computer Science, vol 440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52753-2_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-52753-2_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52753-4

  • Online ISBN: 978-3-540-47137-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation