Skip to main content

A General Setting for the Pointwise Investigation of Determinacy

  • Conference paper
Logic and Its Applications (ICLA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5378))

Included in the following conference series:

  • 546 Accesses

Abstract

It is well-known that if we assume a large class of sets of reals to be determined then we may conclude that all sets in this class have certain regularity properties: we say that determinacy implies regularity properties classwise. In [Lö05] the pointwise relation between determinacy and certain regularity properties (namely the Marczewski-Burstin algebra of arboreal forcing notions and a corresponding weak version) was examined.

An open question was how this result extends to topological forcing notions whose natural measurability algebra is the class of sets having the Baire property. We study the relationship between the two cases, and using a definition which adequately generalizes both the Marczewski-Burstin algebra of measurability and the Baire property, prove results similar to [Lö05].

We also show how this can be further generalized for the purpose of comparing algebras of measurability of various forcing notions.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bartoszyński, T., Judah, H.: Set Theory, On the Structure of the Real Line. A K Peters (1995)

    Google Scholar 

  2. Brendle, J.: Strolling Through Paradise. Fundamenta Mathematicae 148, 2643–2674 (1995)

    MathSciNet  MATH  Google Scholar 

  3. Brendle, J., Löwe, B.: Solovay-type characterizations for forcing-algebras. The Journal of Symbolic Logic 64, 1307–1323 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ellentuck, E.: A new proof that analytic sets are Ramsey. Journal of Symbolic Logic 39, 163–165 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ikegami, D.: Forcing Absoluteness and Regularity Properties (manuscript, 2008)

    Google Scholar 

  6. Jech, T.: Multiple Forcing. Cambridge University Press, Cambridge (1986)

    MATH  Google Scholar 

  7. Kanamori, A.: The Higher Infinite, Large Cardinals in Set Theory from Their Beginnings. Springer, Berlin (2004)

    MATH  Google Scholar 

  8. Löwe, B.: The pointwise view of determinacy: arboreal forcings, measurability, and weak measurability. Rocky Mountain Journal of Mathematics 35, 1233–1249 (2005)

    Google Scholar 

  9. Solovay, R.M.: A model of set theory in which every set of reals is Lebesgue measurable. Annals of Mathematics Ser. 2 92, 1–56 (1970)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khomskii, Y. (2008). A General Setting for the Pointwise Investigation of Determinacy. In: Ramanujam, R., Sarukkai, S. (eds) Logic and Its Applications. ICLA 2009. Lecture Notes in Computer Science(), vol 5378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92701-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92701-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92700-6

  • Online ISBN: 978-3-540-92701-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics