Definable well-orders of $H(\omega _2)$ and $GCH$

Journal of Symbolic Logic 77 (4):1101-1121 (2012)
  Copy   BIBTEX

Abstract

Assuming ${2^{{N_0}}}$ = N₁ and ${2^{{N_1}}}$ = N₂, we build a partial order that forces the existence of a well-order of H(ω₂) lightface definable over ⟨H(ω₂), Є⟩ and that preserves cardinal exponentiation and cofinalities.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,654

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On sets of relations definable by addition.James F. Lynch - 1982 - Journal of Symbolic Logic 47 (3):659-668.
Almost everywhere domination.Natasha L. Dobrinen & Stephen G. Simpson - 2004 - Journal of Symbolic Logic 69 (3):914-922.
Consecutive Singular Cardinals and the Continuum Function.Arthur W. Apter & Brent Cody - 2013 - Notre Dame Journal of Formal Logic 54 (2):125-136.
An ordinal partition avoiding pentagrams.Jean A. Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.
Extender based forcings.Moti Gitik & Menachem Magidor - 1994 - Journal of Symbolic Logic 59 (2):445-460.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
On legal order: Some criticism of the received view. [REVIEW]Riccardo Guastini - 2000 - Ethical Theory and Moral Practice 3 (3):263-272.

Analytics

Added to PP
2012-11-03

Downloads
432 (#46,747)

6 months
23 (#124,749)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Citations of this work

Large cardinals and definable well-orders, without the GCH.Sy-David Friedman & Philipp Lücke - 2015 - Annals of Pure and Applied Logic 166 (3):306-324.
Forcing lightface definable well-orders without the GCH.David Asperó, Peter Holy & Philipp Lücke - 2015 - Annals of Pure and Applied Logic 166 (5):553-582.

Add more citations

References found in this work

Set mapping reflection.Justin Tatch Moore - 2005 - Journal of Mathematical Logic 5 (1):87-97.
Coding by club-sequences.David Asperó - 2006 - Annals of Pure and Applied Logic 142 (1):98-114.

Add more references