Skip to main content

On Partially Wellfounded Generic Ultrapowers

  • Chapter
Pillars of Computer Science

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4800))

Abstract

We construct a model without precipitous ideals but so that for each \(\tau< \aleph_3\) there is a normal ideal over \(\aleph_1\) with generic ultrapower wellfounded up to the image of τ.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Donder, H.-D., Koepke, P.: On the consistency strength of ‘Accessible’ Jonsson Cardinals and of the Chang Conjecture, APAL 25, pp. 233–261 (1983)

    Google Scholar 

  2. Foreman, M.: Ideals and Generic Elementary Embeddings, in Handbook of Set Theory (to appear)

    Google Scholar 

  3. Gitik, M.: On normal precipitous ideals, www.math.tau.ac.il/~gitik

  4. Jech, T.: Set Theory, 3rd ed.

    Google Scholar 

  5. Jech, T., Prikry, K.: On ideals of sets and the power set operation. Bull. Amer. Math. Soc. 82(4), 593–595 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  6. Jech, T., Shelah, S.: A note on canonical functions. Israel J. Math. 68, 376–380 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  7. Larson, P., Shelah, S.: Bounding by canonical functions, with CH. J. Math. Logic 3(2), 193–215 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Mitchell, W.: The covering lemma, in Handbook of Set Theory (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Arnon Avron Nachum Dershowitz Alexander Rabinovich

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gitik, M., Magidor, M. (2008). On Partially Wellfounded Generic Ultrapowers. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds) Pillars of Computer Science. Lecture Notes in Computer Science, vol 4800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78127-1_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78127-1_18

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-78127-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics