Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/42082
Title: Large cardinals and resurrection axioms
Author: Tsaprounis, Konstantinos
Director: Bagaria, Joan
Keywords: Nombres cardinals
Números cardinales
Cardinal numbers
Lògica matemàtica
Lógica matemática
Mathematical logic
Issue Date: 14-Dec-2012
Publisher: Universitat de Barcelona
Abstract: In the current dissertation we work in set theory and we study both various large cardinal hierarchies and issues related to forcing axioms and generic absoluteness. The necessary preliminaries may be found, as it should be anticipated, in the first chapter. In Chapter 2, we study several C(n) - cardinals as introduced by J. Bagaria (cf. [1]). In the context of an elementary embedding associated with some fixed C(n) - cardinal, and under adequate assumptions, we derive consistency (upper) bounds for the large cardinal notion at hand; in particular, we deal with the C(n) - versions of tallness, superstrongness, strongness, supercompactness, and extendibility. As far as the two latter notions are concerned, we further study their connection, giving an equivalent formulation of extendibility as well. We also consider the cases of C(n) -Woodin and of C(n) – strongly compact cardinals which were not studied in [1] and we get characterizations for them in terms of their ordinary counterparts. In Chapter 3, we briefly discuss the interaction of C(n) – cardinals with the forcing machinery, presenting some applications of ordinary techniques. In Chapter 4, we turn our attention to extendible cardinals; by a combination of methods and results from Chapter 2, we establish the existence of apt Laver functions for them. Although the latter was already known (cf. [2]), it is proved from a fresh viewpoint, one which nicely ties with the material of Chapter 5. We also argue that in the case of extendible cardinals one cannot use such Laver functions in order to attain indestructibility results. Along the way, we give an additional characterization of extendibility, and we, moreover, show that the global GCH can be forced while preserving such cardinals. In Chapter 5, we focus on the resurrection axioms as they are introduced by J.D. Hamkins and T. Johnstone (cf. [3]). Initially, we consider the class of stationary preserving posets and, assuming the (consistency of the) existence of an extendible cardinal, we obtain a model in which the resurrection axiom for this class holds. By analysing the proof of the previous result, we are led to much stronger forms of resurrection for which we introduce a family of axioms under the general name “Unbounded Resurrection”. We then prove that the consistency of these axioms follows from that of (the existence of) an extendible cardinal and that, for the appropriate classes of posets, they are strengthenings of the forcing axioms PFA and MM. We furthermore consider several implications of the unbounded resurrection axioms (e.g., their effect on the continuum, for the classes of c.c.c. and of sygma- closed posets) together with their connection with the corresponding ones of [3]. Finally, we also establish some consistency lower bounds for such axioms, mainly by deriving failures of (weak versions of) squares. We conclude our current mathematical quest with a few final remarks and a small list of open questions, followed by an Appendix on extenders and (some of) their applications. References [1] Bagaria, J., C (n)–cardinals. In Archive Math. Logic, Vol. 51 (3–4), pp. 213–240, 2012. [2] Corazza, P., Laver sequences for extendible and super–almost–huge cardinals. In J. Symbolic Logic, Vol. 64 (3), pp. 963–983, 1999. [3] Johnstone, T., Notes to “The Resurrection Axioms”. Unpublished notes (2009).
URI: http://hdl.handle.net/2445/42082
Appears in Collections:Tesis Doctorals - Departament - Lògica, Història i Filosofia de la Ciència

Files in This Item:
File Description SizeFormat 
01.TSAPROUNIS_PhD_THESIS.pdf1.15 MBAdobe PDFView/Open
02.TSAPROUNIS_THESIS_ADDENDUM.pdf109.5 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons