Forcing lightface definable well-orders without the CGH

David Aspero; Peter Holy; Philipp Luecke

doi:10.1016/j.apal.2014.11.010

Forcing lightface definable well-orders without the CGH

David Aspero
, Peter Holy
, Philipp Luecke

Algebra, Number Theory, Logic, and Representations (ANTLR)

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

27 Downloads (Pure)

Abstract

For any given uncountable cardinal \(\kappa\) with \(\kappa^{{<}\kappa}=\kappa\), we present a forcing that is \(<\kappa\)-directed closed, has the \(\kappa^+\)-c.c. and introduces a lightface definable well-order of \(H(\kappa^+)\). We use this to define a global iteration that does this for all such \(\kappa\) simultaneously and is capable of preserving the existence of many large cardinals in the universe.

Original language	English
Pages (from-to)	553–582
Number of pages	30
Journal	Annals of Pure and Applied Logic
Volume	166
Issue number	5
Early online date	29 Dec 2014
DOIs	https://doi.org/10.1016/j.apal.2014.11.010
Publication status	Published - May 2015

Keywords

Definable well-orders
Forcing
Large cardinals

Access to Document

10.1016/j.apal.2014.11.010

lf_submittedSubmitted manuscript, 1.07 MB

David Aspero
- D.Asperouea.acuk
- School of Engineering, Mathematics and Physics - Associate Professor in Pure Mathematics
- Algebra, Number Theory, Logic, and Representations (ANTLR) - Member
Person: Research Group Member, Academic, Teaching and Research

Cite this

@article{ca58501d926e4acb809e39475e431acb,

title = "Forcing lightface definable well-orders without the CGH",

abstract = "For any given uncountable cardinal \textbackslash{}(\textbackslash{}kappa\textbackslash{}) with \textbackslash{}(\textbackslash{}kappa\textasciicircum{}\{\{<\}\textbackslash{}kappa\}=\textbackslash{}kappa\textbackslash{}), we present a forcing that is \textbackslash{}(<\textbackslash{}kappa\textbackslash{})-directed closed, has the \textbackslash{}(\textbackslash{}kappa\textasciicircum{}+\textbackslash{})-c.c. and introduces a lightface definable well-order of \textbackslash{}(H(\textbackslash{}kappa\textasciicircum{}+)\textbackslash{}). We use this to define a global iteration that does this for all such \textbackslash{}(\textbackslash{}kappa\textbackslash{}) simultaneously and is capable of preserving the existence of many large cardinals in the universe.",

keywords = "Definable well-orders, Forcing, Large cardinals",

author = "David Aspero and Peter Holy and Philipp Luecke",

year = "2015",

month = may,

doi = "10.1016/j.apal.2014.11.010",

language = "English",

volume = "166",

pages = "553–582",

journal = "Annals of Pure and Applied Logic",

issn = "0168-0072",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - Forcing lightface definable well-orders without the CGH

AU - Aspero, David

AU - Holy, Peter

AU - Luecke, Philipp

PY - 2015/5

Y1 - 2015/5

N2 - For any given uncountable cardinal \(\kappa\) with \(\kappa^{{<}\kappa}=\kappa\), we present a forcing that is \(<\kappa\)-directed closed, has the \(\kappa^+\)-c.c. and introduces a lightface definable well-order of \(H(\kappa^+)\). We use this to define a global iteration that does this for all such \(\kappa\) simultaneously and is capable of preserving the existence of many large cardinals in the universe.

AB - For any given uncountable cardinal \(\kappa\) with \(\kappa^{{<}\kappa}=\kappa\), we present a forcing that is \(<\kappa\)-directed closed, has the \(\kappa^+\)-c.c. and introduces a lightface definable well-order of \(H(\kappa^+)\). We use this to define a global iteration that does this for all such \(\kappa\) simultaneously and is capable of preserving the existence of many large cardinals in the universe.

KW - Definable well-orders

KW - Forcing

KW - Large cardinals

U2 - 10.1016/j.apal.2014.11.010

DO - 10.1016/j.apal.2014.11.010

M3 - Article

SN - 0168-0072

VL - 166

SP - 553

EP - 582

JO - Annals of Pure and Applied Logic

JF - Annals of Pure and Applied Logic

IS - 5

ER -

Forcing lightface definable well-orders without the CGH

Abstract

Keywords

Access to Document

Profiles

David Aspero

Cite this