Skip to main content
SpringerLink
Log in

Definable Ramsey and definable Erdös ordinals

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

Abstract

This paper studies the relation between definable Ramsey ordinals and constructible sets which have a certain set of indiscernibles. It is shown that an ordinal κ is Σ1-Ramsey if and only if κ is ∑ω-Ramsey. Similar results are obtained for definable Erdös ordinals.

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

Similar content being viewed by others

References

  1. Barwise, J.: Admissible sets and structures. Berlin, Heidelberg, New York: Springer 1975.

    Google Scholar 

  2. Baumgartner, J.E., Galvin, F.: Generalized Erdös cardinals and 0#. Ann. Math. Logic15, 289–313 (1978).

    Article  Google Scholar 

  3. Boos, W.: Lectures on large cardinal axioms. In: Logic Conference Kiel 1974. Lecture Notes in Mathematics, Vol. 499. Berlin, Heidelberg, New York: Springer 1975.

    Google Scholar 

  4. Devlin, K.: Aspects of constructibility. In: Lecture Notes in Mathematics, Vol. 354. Berlin, Heidelberg, New York: Springer 1973.

    Google Scholar 

  5. Devlin, K.: An introduction to the fine structure of the constructible hierarchy (Results of Ronald Jensen). In: Fenstad, J.E., Hinman, P.G. (eds.): Generalized recursion theory. Amsterdam: North-Holland 1974.

    Google Scholar 

  6. Drake, F.R.: Set theory, an introduction to large cardinals. Amsterdam: North-Holland 1974.

    Google Scholar 

  7. Gloede, K.: Ordinals with partition properties and the constructible hierarchy. Arch. math. Logik18, 135–164 (1972).

    Google Scholar 

  8. Jensen, R., Karp, C.: Primitive recursive set functions. Proc. Symp. Pure Math. XIII, Part 1. Am. Math. Soc. 1971, pp. 143–176.

  9. Kranakis, E.: Partition and reflection properties of admissible ordinals. Ann. Math. Logic22, 213–242 (1982).

    Article  Google Scholar 

  10. Silver, J.: Some applications of model theory in set theory. Ann. Math. Logic3, 45–110 (1971).

    Article  Google Scholar 

  11. Simpson, S.: Short course on admissible recursion theory. In: Fenstad, J.E., Gandy, R.O., Sacks, G.E. (eds.): Generalized recursion theory. II. Amsterdam: North-Holland 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut der Universität, Im Neuenheimer Feld 288/294, D-6900, Heidelberg 1, Germany

    Evangelos Kranakis

Authors
  1. Evangelos Kranakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Most of this paper is contained in a chapter of the author's doctoral dissertation at the University of Minnesota under the guidance of Professor Wayne Richter to whom the author expresses his deepest appreciation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kranakis, E. Definable Ramsey and definable Erdös ordinals. Arch math Logik 23, 115–128 (1983). https://doi.org/10.1007/BF02023018

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation