Skip to main content
SpringerLink
Log in

A characterization ofR-maximal sets

  • Published:
Archiv für mathematische Logik und Grundlagenforschung Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Bibliography

  1. Lachlan, A.H.: On the lattice of recursively enumerable sets. Trans. Amer. Math. Soc.130, 1–37 (1968).

    Google Scholar 

  2. Rabin, M.O.: A simple method for undecidability proofs, Proceedings of the 1964 International Congress for Logic, Methodology, and Philosophy of Science, Jerusalem, 1964. North-Holland Publ. Co., Amsterdam, pp. 58–68.

    Google Scholar 

  3. Rogers, H., Jr.: Theory of recursive functions and effective computability. McGraw-Hill, New York, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Iowa, Iowa City, Iowa, USA

    Donald A. Alton

Authors
  1. Donald A. Alton
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This manuscript was prepared while the author was supported by NSF grant GJ-33168.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alton, D.A. A characterization ofR-maximal sets. Arch math Logik 17, 35–36 (1975). https://doi.org/10.1007/BF02280810

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation