Skip to main content

More on stationary coding

Part of the Lecture Notes in Mathematics book series (LNM,volume 1182)

Keywords

  • Stationary Code
  • Order Type
  • Winning Strategy
  • Countable Subset
  • Inaccessible Cardinal

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Foreman, M. Magidor and S. Shelah, Martin Maximum, Saturated ideals and non-regular ultrafilters, Annals of Math.

    Google Scholar 

  2. M. Rubin and S. Shelah. Combinatorial problems on trees: Partitions, Δ-systems and large free subsets, Annals of Pure and Applied Logic in press.

    Google Scholar 

  3. S. Shelah, “The existence of coding sets,” A Springer Lecture notes volume.

    Google Scholar 

  4. S. Shelah, A note on cardinal exponentiation, J. of Symb. Logic, 45(1980) 56–66.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. S. Shelah, On successor of singular cardinals, Proc. of the A.S.L. meeting in Mons, Aug. 1978, Logic Colloquium 78 ed. M. Boffa, D. van Dalen and K. McAloon, Studies in Logic and the Foundation of Math. vol.97, North Holland Publishing Co., Amsterdam, 1979, 357–380.

    Google Scholar 

  6. S. Shelah, Classification Theory, North Holland Publishing Co., Amsterdam, 1978.

    MATH  Google Scholar 

  7. S. Shelah, Existence of rigid-like families of abelian p-groups, model theory and Algebra, A memorial tribute to A. Robinson, ed. Saraceno and Weisphenning, Lecture notes in Math 498, Springer-Verlag 1975, 385–402.

    Google Scholar 

  8. S. Shelah, A combinatorial principle and endomorphism rings of p-groups I., Proc. of the 1980/1 Jerusalem model theory year, Israel J. Math.

    Google Scholar 

  9. S. Shelah, A combinatorial principle and endomorphism of abelian groups II, Proc. of the conference on Abelian groups, Iudine, Italy, April 84.

    Google Scholar 

  10. S. Shelah, Proper forcing, Springer lecture notes, 940, 1982.

    Google Scholar 

  11. B. Zwicker, P κ(λ) combinatories 1: Stationary coding Contemporary Mathematics. 31 (1984) 243–259.

    CrossRef  MathSciNet  Google Scholar 

Download references

Authors

Rights and permissions

Reprints and Permissions

Copyright information

© 1986 Springer-Verlag

About this chapter

Cite this chapter

Shelah, S. (1986). More on stationary coding. In: Around Classification Theory of Models. Lecture Notes in Mathematics, vol 1182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0098512

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16448-7

  • Online ISBN: 978-3-540-39788-5

  • eBook Packages: Springer Book Archive