Sy-David Friedman

We present here an approach to the fine structure of L based solely on elementary model theoretic ideas, and illustrate its use in a proof of Global Square in L. We thereby avoid the Lévy hierarchy of formulas and the subtleties of master codes and projecta, introduced by Jensen [3] in the original form of the theory. Our theory could appropriately be called ”Hyperfine Structure Theory”, as we make use of a hierarchy of structures and hull operations which refines the traditional Lα -or Jα-sequences with their Σn-hull operations.§1. Introduction. In 1938, K. Gödel defined the model L of set theory to show the relative consistency of Cantor's Continuum Hypothesis. L is defined as a unionof initial segments which satisfy: L0 = ∅, Lλ = ∪α

An Easton function is a monotone function C from infinite regular cardinals to cardinals such that C has cofinality greater than α for each infinite regular cardinal α. Easton showed that assuming GCH, if C is a definable Easton function then in some cofinality-preserving extension, C=2α for all infinite regular cardinals α. Using “generic modification”, we show that over the ground model L, models witnessing Easton’s theorem can be obtained as inner models of L[0#], for Easton functions which are L-definable with parameters at most . And using a gap 1 morass, we obtain an inner model of L[0#] with the same cofinalities as L in which is a strong limit cardinal and equals

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphism relation, which as an equivalence relation on graphs (or on any class of countable structures consisting of the models of a sentence of L ω ₁ ω ) is far from complete (see [5, 2]). In this article we strengthen the results of [5] by showing that not only does bi-embeddability give rise to analytic equivalence relations which are complete under Borel reducibility, but in fact any analytic equivalence relation is Borel equivalent to such a relation. This result and the techniques introduced answer questions raised in [5] about the comparison between isomorphism and bi-embeddability. Finally, as in [5] our results apply not only to classes of countable structures defined by sentences of ω ₁ ω , but also to discrete metric or ultrametric Polish spaces, compact metrizable topological spaces and separable Banach spaces, with various notions of embeddability appropriate for these classes, as well as to actions of Polish monoids

An important technique in large cardinal set theory is that of extending an elementary embedding j: M → N between inner models to an elementary embedding j*: M[G] → N[G*] between generic extensions of them. This technique is crucial both in the study of large cardinal preservation and of internal consistency. In easy cases, such as when forcing to make the GCH hold while preserving a measurable cardinal (via a reverse Easton iteration of α-Cohen forcing for successor cardinals α), the generic G* is simply generated by the image of G. But in difficult cases, such as in Woodin's proof that a hypermeasurable is sufficient to obtain a failure of the GCH at a measurable, a preliminary version of G* must be constructed (possibly in a further generic extension of M[G]) and then modified to provide the required G*. In this article we use perfect trees to reduce some difficult cases to easy ones, using fusion as a substitute for distributivity. We apply our technique to provide a new proof of Woodin's theorem as well as the new result that global domination at inaccessibles (the statement that d (κ) is less than 2κ for inaccessible κ, where d (κ) is the dominating number at κ) is internally consistent, given the existence of 0#

We study the spectrum of forcing notions between the iterations of σ-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of α-proper forcings for indecomposable countable ordinals α, the Axiom A forcings and forcings completely embeddable into an iteration of a σ-closed followed by a ccc forcing. For the latter class, we present an equivalent characterization in terms of Baumgartnerʼs Axiom A. This resolves a conjecture of Baumgartner from the 1980s. We also study the bounded forcing axioms for the hierarchy of α-proper forcings. Following ideas of Shelah we separate them for distinct countable indecomposable ordinals.

There have been numerous results showing that a measurable cardinal κ can carry exactly α normal measures in a model of GCH, where a is a cardinal at most κ⁺⁺. Starting with just one measurable cardinal, we have [9] (for α = 1), [10] (for α = κ⁺⁺, the maximum possible) and [1] (for α = κ⁺, after collapsing κ⁺⁺) . In addition, under stronger large cardinal hypotheses, one can handle the remaining cases: [12] (starting with a measurable cardinal of Mitchell order α ) , [2] (as in [12], but where κ is the least measurable cardinal and α is less than κ, starting with a measurable of high Mitchell order) and [11] (as in [12], but where κ is the least measurable cardinal, starting with an assumption weaker than a measurable cardinal of Mitchell order 2). In this article we treat all cases by a uniform argument, starting with only one measurable cardinal and applying a cofinality-preserving forcing. The proof uses κ-Sacks forcing and the "tuning fork" technique of [8]. In addition, we explore the possibilities for the number of normal measures on a cardinal at which the GCH fails

The Infinite Time Turing Machine model [8] of Hamkins and Kidder is, in an essential sense, a "Σ₂-machine" in that it uses a Σ₂ Liminf Rule to determine cell values at limit stages of time. We give a generalisation of these machines with an appropriate Σ n rule. Such machines either halt or enter an infinite loop by stage ζ(n) = df μζ(n)[∃Σ(n) > ζ(n) L ζ(n) ≺ Σn L Σ(n) ], again generalising precisely the ITTM case. The collection of such machines taken together computes precisely those reals of the least model of analysis

We present a new partial order for directly forcing morasses to exist that enjoys a significant homogeneity property. We then use this forcing in a reverse Easton iteration to obtain an extension universe with morasses at every regular uncountable cardinal, while preserving all n-superstrong, hyperstrong and 1-extendible cardinals. In the latter case, a preliminary forcing to make the GCH hold is required. Our forcing yields morasses that satisfy an extra property related to the homogeneity of the partial order; we refer to them as mangroves and prove that their existence is equivalent to the existence of morasses. Finally, we exhibit a partial order that forces universal morasses to exist at every regular uncountable cardinal, and use this to show that universal morasses are consistent with n-superstrong, hyperstrong, and 1-extendible cardinals. This all contributes to the second author’s outer model programme, the aim of which is to show that L-like principles can hold in outer models which nevertheless contain large cardinals.

The fact that “natural” theories, i.e. theories which have something like an “idea” to them, are almost always linearly ordered with regard to logical strength has been called one of the great mysteries of the foundation of mathematics. However, one easily establishes the existence of theories with incomparable logical strengths using self-reference . As a result, PA+Con is not the least theory whose strength is greater than that of PA. But still we can ask: is there a sense in which PA+Con is the least “natural” theory whose strength is greater than that of PA? In this paper we exhibit natural theories in strength strictly between PA and PA+Con by introducing a notion of slow consistency

For sentences $\phi$ of $L_{\omega_{1},\omega}$, we investigate the question of absoluteness of $\phi$ having models in uncountable cardinalities. We first observe that having a model in $\aleph_{1}$ is an absolute property, but having a model in $\aleph_{2}$ is not as it may depend on the validity of the continuum hypothesis. We then consider the generalized continuum hypothesis context and provide sentences for any $\alpha\in\omega_{1}\setminus\{0,1,\omega\}$ for which the existence of a model in $\aleph_{\alpha}$ is nonabsolute . Finally, we present a complete sentence for which model existence in $\aleph_{3}$ is nonabsolute

The results herein form part of a larger project to characterize the classification properties of the class of submodels of a homogeneous stable diagram in terms of the solvability (in the sense of [1]) of the potential isomorphism problem for this class of submodels. We restrict ourselves to locally saturated submodels of the monster model m of some power π. We assume that in Gödel's constructible universe , π is a regular cardinal at least the successor of the first cardinal in which is stable. We show that the collection of pairs of submodels in as above which are potentially isomorphic with respect to certain cardinal-preserving extensions of is equiconstructible with 0 # . As 0 # is highly "transcendental" over , this provides a very strong statement to the effect that potential isomorphism for this class of models not only fails to be set-theoretically absolute, but is of high (indeed of the highest possible) complexity. The proof uses a novel method that does away with the need for a linear order on the skeleton

There are two standard ways to establish consistency in set theory. One is to prove consistency using inner models, in the way that Gödel proved the consistency of GCH using the inner model L. The other is to prove consistency using outer models, in the way that Cohen proved the consistency of the negation of CH by enlarging L to a forcing extension L[G].But we can demand more from the outer model method, and we illustrate this by examining Easton's strengthening of Cohen's result:Theorem 1. There is a forcing extensionL[G] of L in which GCH fails at every regular cardinal.Assume that the universe V of all sets is rich in the sense that it contains inner models with large cardinals. Then what is the relationship between Easton's model L[G] and V? In particular, are these models compatible, in the sense that they are inner models of a common third model? If not, then the failure of GCH at every regular cardinal is consistent only in a weak sense, as it can only hold in universes which are incompatible with the universe of all sets. Ideally, we would like L[G] to not only be compatible with V, but to be an inner model of V.We say that a statement is internally consistent iff it holds in some inner model, under the assumption that there are innermodels with large cardinals.