Skip to main content
SpringerLink
Log in

Coding lemmata in L

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

Under the assumption that there exists an elementary embedding(henceforth abbreviated as and in particular under we prove a Coding Lemma for and find certain versions of it which are equivalent to strong regularity of cardinals below . We also prove that a stronger version of the Coding Lemma holds for a stationary set of ordinals below .

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. Perspectives in Mathematical Logic. Springer-Verlag, Berlin Heidelberg, 1975

  2. Becker, H.: More supercompact cardinals from AD. Handwritten Notes-7/24/90, 1990

  3. Becker, H., Jackson, S.: Supercompactness within the projective hierarchy. Preprint, 1–12 (1998)

  4. Appendix: Victoria Delfino Problems II. In: D.A~Martin A. Kechris and J. R Steel, (eds.), Cabal Seminar 81-85, volume 1333 of Lecture Notes in Mathematics, Springer-Verlag, 1988, p. 222

  5. Devlin, K.J.: Constructibility. Perspectives in Mathematical Logic. Springer-Verlag, 1984

  6. Jackson, S.: On λ-regular, cardinals. Handwritten Notes, 1990

  7. Jech, T.: Set Theory. New York: Academic Press, 1978

  8. Kunen, K.: Set Theory. Volume 102 of Studies in Logic and the Foundations of Mathematics. North Holland, 1980

  9. Laver, R.: Implications between strong large cardinal axioms. Ann. Pure and App. Logic 90, 79–90 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Martin, D.A.: Infinite games. In: x, (ed.), Proceedings of the International Congress of Mathematicians, 271–273, 1978

  11. Moschovakis, Y.N.: Descriptive Set Theory. Volume 100 of Studies in Logic and the Foundations of Mathematics. North Holland, 1980

  12. Martin, D.A., Steel, J.: A proof of projective determinacy. J. Am. Math. Soc. 2, 71–125 (1989)

    MathSciNet  Google Scholar 

  13. Rudominer., M.: Mouse sets. Ann. Pure Appl. Logic 87, 1–100 (1997)

    Article  Google Scholar 

  14. Steel, J.R.: Scales in L(ℝ). In: Y. Moschovakis, D. Martin, and A. Kechris, (eds.), Cabal Seminar 79-81, volume 1019 of Lecture Notes in Mathematics, Springer Verlag, Berlin, 107–156 (1983)

  15. Woodin, H.: An AD-like Axiom. Lecture notes written by George Kafkoulis, 1989

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Florida International University, DM 410B, Miami, FL, 33199, USA

    George Kafkoulis

Authors
  1. George Kafkoulis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George Kafkoulis.

Additional information

Mathematics Subject Classification (2000): 03E55

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kafkoulis, G. Coding lemmata in L . Arch. Math. Logic 43, 193–213 (2004). https://doi.org/10.1007/s00153-003-0204-0

Download citation

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-003-0204-0

Keywords

Search

Navigation