§0. Preface. There has been an expectation that the endgame of the more tenacious problems raised by the Los Angeles ‘cabal’ school of descriptive set theory in the 1970's should ultimately be played out with the use of inner model theory. Questions phrased in the language of descriptive set theory, where both the conclusions and the assumptions are couched in terms that only mention simply definable sets of reals, and which have proved resistant to purely descriptive set theoretic arguments, may (...) at last find their solution through the connection between determinacy and large cardinals.Perhaps the most striking example was given by [24], where the core model theory was used to analyze the structure of HOD and then show that all regular cardinals below ΘL are measurable. John Steel's analysis also settled a number of structural questions regarding HODL, such as GCH.Another illustration is provided by [21]. There an application of large cardinals and inner model theory is used to generalize the Harrington-Martin theorem that determinacy implies )determinacy.However, it is harder to find examples of theorems regarding the structure of the projective sets whose only known proof from determinacy assumptions uses the link between determinacy and large cardinals. We may equivalently ask whether there are second order statements of number theory that cannot be proved under PD–the axiom of projective determinacy–without appealing to the large cardinal consequences of the PD, such as the existence of certain kinds of inner models that contain given types of large cardinals. (shrink)

We address ZFC inequalities between some cardinal invariants of the continuum, which turned out to be true in spite of strong expectations given by [11].

Using an idea developed in joint work with Shelah, we show how to redefine Laver's notion of forcing making a supercompact cardinal $\kappa$ indestructible under $\kappa$-directed closed forcing to give a new proof of the Kimchi-Magidor Theorem in which every compact cardinal in the universe satisfies certain indestructibility properties. Specifically, we show that if K is the class of supercompact cardinals in the ground model, then it is possible to force and construct a generic extension in which the only strongly (...) compact cardinals are the elements of K or their measurable limit points, every $\kappa \in K$ is a supercompact cardinal indestructible under $\kappa$-directed closed forcing, and every $\kappa$ a measurable limit point of K is a strongly compact cardinal indestructible under $\kappa$-directed closed forcing not changing $\wp$. We then derive as a corollary a model for the existence of a strongly compact cardinal $\kappa$ which is not $\kappa^+$ supercompact but which is indestructible under $\kappa$-directed closed forcing not changing $\wp and remains non-$\kappa^+$ supercompact after such a forcing has been done. (shrink)

The current paper proves the results announced in [5]. We isolate a new large cardinal concept, "remarkability." Consistencywise, remarkable cardinals are between ineffable and ω-Erdos cardinals. They are characterized by the existence of "O # -like" embeddings; however, they relativize down to L. It turns out that the existence of a remarkable cardinal is equiconsistent with L(R) absoluteness for proper forcings. In particular, said absoluteness does not imply Π 1 1 determinacy.

We extend Shelah's first many model result to show that an unstable theory has 2 κ many non-permutation group isomorphic models of size κ, where κ is an uncountable regular cardinal.

We present two ways in which the model L(R) is canonical assuming the existence of large cardinals. We show that the theory of this model, with ordinal parameters, cannot be changed by small forcing; we show further that a set of ordinals in V cannot be added to L(R) by small forcing. The large cardinal needed corresponds to the consistency strength of AD L (R); roughly ω Woodin cardinals.

We show: The procedure mentioned in the title is often impossible. It requires at least an inner model with a measurable cardinal. The consistency strength of changing b and d from a regular κ to some regular δ < κ is a measurable of Mitchell order δ. There is an application to Cichon's diagram.

In this paper we will present a simple condition for an ideal to be nowhere precipitous. Through this condition we show nowhere precipitousness of fundamental ideals onPkλ, in particular the non-stationary idealNSkλunder cardinal arithmetic assumptions.In this sectionIdenotes a non-principal ideal on an infinite setA. LetI+=PA/I(ordered by inclusion as a forcing notion) andI∣X= {Y⊂A:Y⋂X∈I}, which is also an ideal onAforX∈I+. We refer the reader to [8, Section 35] for the general theory of generic ultrapowers associated with an ideal. We recallIis said (...) to be precipitous if ⊨I+“Ult(V, Ġ) is well-founded” [9].The central notion of this paper is a strong negation of precipitousness [1]:Definition.Iis nowhere precipitous ifI∣Xis not precipitous for everyX∈ I+i.e., ⊨I+“Ult(V, Ġ) is ill-founded.”It is useful to characterize nowhere precipitousness in terms of infinite games (see [11, Section 27]). Consider the following gameG(I) between two players, Nonempty and Empty [5]. Nonempty and Empty alternately chooseXn∈I+andYn∈I+respectively so thatXn⊃Yn⊃n+1. After ω moves, Empty wins the game if⋂n<ωXn=⋂n<ωYn= Ø.See [5, Theorem 2] for a proof of the following characterization.Proposition.I is nowhere precipitous if and only if Empty has a winning strategy in G(I). (shrink)

In this paper we show that it is consistent with ZFC that the cardinality of every maximal cofinitary group of Sym(ω) is strictly greater than the cardinal numbers o and a.

This paper discusses a sequence of extensions ofNFU, Jensen's improvement of Quine's set theory “New Foundations” (NF) of [16].The original theoryNFof Quine continues to present difficulties. After 60 years of intermittent investigation, it is still not known to be consistent relative to any set theory in which we have confidence. Specker showed in [20] thatNFdisproves Choice (and so proves Infinity). Even if one assumes the consistency ofNF, one is hampered by the lack of powerful methods for proofs of consistency and (...) independence such as are available for use withZFC; very clever work has been done with permutation methods, starting with [18] and [5], and exemplified more recently by [14], but permutation methods can only be applied to show the consistency or independence of unstratified sentences (see the definition ofNFUbelow for a definition of stratification). For example, there is no method available to determine whether the assertion “the continuum can be well-ordered” is consistent with or independent ofNF. There is one substantial independence result for an assertion with nontrivial stratified consequences, using metamathematical methods: this is Orey's proof of the independence of the Axiom of Counting fromNF(see below for a statement of this axiom).We mention these difficulties only to reassure the reader of their irrelevance to the present work. Jensen's modification of “New Foundations” (in [13]), which was to restrict extensionality to sets, allowing many non-sets (urelements) with no elements, has almost magical effects. (shrink)

The Martin-Steel coarse inner model theory is employed in obtaining new results in descriptive set theory. $\underset{\sim}{\Pi}$ determinacy implies that for every thin Σ 1 2 equivalence relation there is a Δ 1 3 real, N, over which every equivalence class is generic--and hence there is a good Δ 1 2 (N ♯ ) wellordering of the equivalence classes. Analogous results are obtained for Π 1 2 and Δ 1 2 quasilinear orderings and $\underset{\sim}{\Pi}^1_2$ determinacy is shown to imply that (...) every Π 1 2 prewellorder has rank less than $\underset{\sim}{\delta}^1_2$. (shrink)

Small forcing always ruins the indestructibility of an indestructible supercompact cardinal. In fact, after small forcing, any cardinal κ becomes superdestructible--any further <κ--closed forcing which adds a subset to κ will destroy the measurability, even the weak compactness, of κ. Nevertheless, after small forcing indestructible cardinals remain resurrectible, but never strongly resurrectible.

Applying the seed concept to Prikry tree forcing P μ , I investigate how well P μ preserves the maximality property of ordinary Prikry forcing and prove that P μ Prikry sequences are maximal exactly when μ admits no non-canonical seeds via a finite iteration. In particular, I conclude that if μ is a strongly normal supercompactness measure, then P μ Prikry sequences are maximal, thereby proving, for a large class of measures, a conjecture of W. Hugh Woodin's.

If ω n has the tree property for all $2 \leq n and $2^{ , then for all X ∈ H ℵ ω and $n exists.

A definition of nonstandard universe which gets over the limitation to the finite levels of the cumulative hierarchy is proposed. Though necessarily nonwellfounded, nonstandard universes are arranged in strata in the likeness of superstructures and allow a rank function taking linearly ordered values. Nonstandard universes are also constructed which model the whole ZFC theory without regularity and satisfy the κ-saturation property.

Before one can construct scales of minimal complexity in the Real Core Model, K(R), one needs to develop the fine-structure theory of K(R). In this paper, the fine structure theory of mice, first introduced by Dodd and Jensen, is generalized to that of real mice. A relative criterion for mouse iterability is presented together with two theorems concerning the definability of this criterion. The proof of the first theorem requires only fine structure; whereas, the second theorem applies to real mice (...) satisfying AD and follows from a general definability result obtained by abstracting work of John Steel on L(R). In conclusion, we discuss several consequences of the work presented in this paper relevant to two issues: the complexity of scales in K(R) and the strength of the theory ZF + AD + ¬ DC R. (shrink)

Let λ ≤ κ be infinite cardinals and let Ω be a set of cardinality κ. The bounded permutation group B λ (Ω), or simply B λ , is the group consisting of all permutations of Ω which move fewer than λ points in Ω. We say that a permutation group G acting on Ω is a supplement of B λ if B λ G is the full symmetric group on Ω. In [7], Macpherson and Neumann claimed to have classified (...) all supplements of bounded permutation groups. Specifically, they claimed to have proved that a group G acting on the set Ω is a supplement of B λ if and only if there exists $\Delta \subset \Omega$ with $|\Delta| such that the setwise stabiliser G {Δ} acts as the full symmetric group on $\Omega\setminus\Delta$ . However I have found a mistake in their proof. The aim of this paper is to examine conditions under which Macpherson and Neumann's claim holds, as well as conditions under which a counterexample can be constructed. In the process we will discover surprising links with cardinal arithmetic and Shelah's recently developed pcf theory. (shrink)

Martin's axiom is equivalent to the statement that the universe is absolute under ccc forcing extensions for Σ 1 sentences with a subset of $\kappa, \kappa , as a parameter.

We show the consistency, relative to a supercompact cardinal, of the least measurable cardinal being both strongly compact and fully Laver indestructible. We also show the consistency, relative to a supercompact cardinal, of the least strongly compact cardinal being somewhat supercompact yet not completely supercompact and having both its strong compactness and degree of supercompactness fully Laver indestructible.

Combining techniques of the first author and Shelah with ideas of Magidor, we show how to get a model in which, for fixed but arbitrary finite n, the first n strongly compact cardinals κ 1 ,..., κ n are so that κ i for i = 1,..., n is both the i th measurable cardinal and κ + i supercompact. This generalizes an unpublished theorem of Magidor and answers a question of Apter and Shelah.

We show that all posets of uniform density ℵ 1 may have to add a Cohen real and develop some forcing machinery for obtaining this sort of result.

We study a generalization of the splitting number s to uncountable cardinals. We prove that $\mathfrak{s}(\kappa) > \kappa^+$ for a regular uncountable cardinal κ implies the existence of inner models with measurables of high Mitchell order. We prove that the assumption $\mathfrak{s}(\aleph_\omega) > \aleph_{\omega + 1}$ has a considerable large cardinal strength as well.

The relationship between killing ideals and adding reals by forcings is analysed.

It is proved consistent that there be a proper σ-ideal ℑ on ω 1 and an ℵ 1 -preserving poset P such that $\mathbb{P} \Vdash$ the σ-ideal generated by ℑ̌ is not proper.

This paper discusses six formalization techniques, of varying strengths, for extending a formal system based on traditional mathematical logic. The purpose of these formalization techniques is to simulate the introduction of new syntactic constructs, along with associated semantics for them. We show that certain techniques (among the six) subsume others. To illustrate sharpness, we also consider a selection of constructs and show which techniques can and cannot be used to introduce them. The six studied techniques were selected on the basis (...) of actual practice in logic and computing. They do not form an exhaustive list. (shrink)

We develop the theory of partial satisfaction relations for structures that may be proper classes and define a satisfaction predicate ($\models^*$) appropriate to such structures. We indicate the utility of this theory as a framework for the development of the metatheory of first-order predicate logic and set theory, and we use it to prove that for any recursively enumerable extension $\Theta$ of ZF there is a finitely axiomatizable extension $\Theta'$ of GB that is a conservative extension of $\Theta$. We also (...) prove a conservative extension result that justifies the use of $\models^*$ to characterize ground models for forcing constructions. (shrink)

We consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using their theory of circular definitions as those notions universally definable over the next stable set. We give a simplified account of varied revision sequences-as a generalised algorithmic theory of truth. This enables something of a unification with the Kripkean theory of truth using supervaluation schemes.

Ifκis a measurable cardinal, let us say that a measure onκis aκ-complete nonprincipal ultrafilter onκ. IfUis a measure onκ, letjUbe the canonical elementary embedding ofVinto its Ultrapower UltU. Ifxis a set, say thatUmovesxwhenjU≠x; say thatκmovesxwhen some measure onκmovesx. Recall Kunen's lemma : “Every ordinal is moved only by finitely many measurable cardinals.” Kunen's proof and Fleissner's proof are essentially nonconstructive.The following proposition can be proved by using elementary facts about iterated ultrapowers.Proposition.Let ‹Un: n ∈ ω› be a sequence of measures (...) on a strictly increasing sequence ‹κn: n ∈ ω› of measurable cardinals. Let U = ‹ Wα: α < ω2›, where Wωm + n= Um. Then, for each θ inUltU,if E is the support of θ inUltU,then, for all m ∈ ω, Ummoves θ iff E ∩ [ωm, ω)≠ ∅. (shrink)

The following problem is studied: How large and how small can the Löwenheim and Hanf numbers of unbounded logics be in relation to the most common large cardinals? The main result is that the Löwenheim number of the logic with the Härtig-quantifier can be consistently put in between any two of the first weakly inaccessible, the first weakly Mahlo, the first weakly compact, the first Ramsey, the first measurable and the first supercompact cardinals.

We try to answer the question which is the “right” foundation of mathematics, second order logic or set theory. Since the former is usually thought of as a formal language and the latter as a first order theory, we have to rephrase the question. We formulate what we call the second order view and a competing set theory view, and then discuss the merits of both views. On the surface these two views seem to be in manifest conflict with each (...) other. However, our conclusion is that it is very difficult to see any real difference between the two. We analyze a phenomenon we call internal categoricity which extends the familiar categoricity results of second order logic to Henkin models and show that set theory enjoys the same kind of internal categoricity. Thus the existence of non-standard models, which is usually taken as a property of first order set theory, and categoricity, which is usually taken as a property of second order axiomatizations, can coherently coexist when put into their proper context. We also take a fresh look at complete second order axiomatizations and give a hierarchy result for second order characterizable structures. Finally we consider the problem of existence in mathematics from both points of view and find that second order logic depends on what we call large domain assumptions, which come quite close to the meaning of the axioms of set theory. (shrink)

We initiate a systematic investigation of the abstract elementary classes that have amalgamation, satisfy tameness, and are stable in some cardinal. Assuming the singular cardinal hypothesis, we prove a full characterization of the stability cardinals, and connect the stability spectrum with the behavior of saturated models.We deduce that if a class is stable on a tail of cardinals, then it has no long splitting chains. This indicates that there is a clear notion of superstability in this framework.We also present an (...) application to homogeneous model theory: for [Formula: see text] a homogeneous diagram in a first-order theory [Formula: see text], if [Formula: see text] is both stable in [Formula: see text] and categorical in [Formula: see text] then [Formula: see text] is stable in all [Formula: see text]. (shrink)

An instance of Stratified Comprehension ∀x₁ … ∀x n ∃y∀x (x ∈ y ↔ φ(x, x₁, …, x n )) is called strictly impredicative iff, under minimal stratification, the type of x is 0. Using the technology of forcing, we prove that the fragment of NF based on strictly impredicative Stratified Comprehension is consistent. A crucial part in this proof, namely showing genericity of a certain symmetric filter, is due to Robert Solovay. As a bonus, our interpretation also satisfies some (...) instances of Stratified Comprehension which are not strictly impredicative. For example, it verifies existence of Frege natural numbers. Apparently, this is a new subsystem of NF shown to be consistent. The consistency question for the whole theory NF remains open (since 1937). (shrink)

We give an overview of a research line concentrated on finding to which extent compactness fails at the level of first uncountable cardinal and to which extent it could be recovered on some other perhaps not so large cardinal. While this is of great interest to set theorists, one of the main motivations behind this line of research is in its applicability to other areas of mathematics. We give some details about this and we expose some possible directions for further (...) research. (shrink)

This article introduces finitist set theory (FST) and shows how it can be applied in modeling finite nested structures. Mereology is a straightforward foundation for transitive chains of part-whole relations between individuals but is incapable of modeling antitransitive chains. Traditional set theories are capable of modeling transitive and antitransitive chains of relations, but due to their function as foundations of mathematics they come with features that make them unnecessarily difficult in modeling finite structures. FST has been designed to function as (...) a practical tool in modeling transitive and antitransitive chains of relations without suffering from difficulties of traditional set theories, and a major portion of the functionality of discrete mereology can be incorporated in FST. This makes FST a viable collection theory in ontological modeling. (shrink)

In this paper we shall answer some questions in the set theory of L, the universe of all sets constructible from the reals. In order to do so, we shall assume ADL, the hypothesis that all 2-person games of perfect information on ω whose payoff set is in L are determined. This is by now standard practice. ZFC itself decides few questions in the set theory of L, and for reasons we cannot discuss here, ZFC + ADL yields the most (...) interesting “completion” of the ZFC-theory of L.ADL implies that L satisfies “every wellordered set of reals is countable”, so that the axiom of choice fails in L. Nevertheless, there is a natural inner model of L, namely HODL, which satisfies ZFC.. The superscript “L” indicates, here and below, that the notion in question is to be interpreted in L.) HODL is reasonably close to the full L, in ways we shall make precise in § 1. The most important of the questions we shall answer concern HODL: what is its first order theory, and in particular, does it satisfy GCH?These questions first drew attention in the 70's and early 80's. (shrink)

It is shown that if κ is an uncountable successor cardinal in L[ 0 ♯ ], then there is a normal tree T ∈ L [ 0 ♯ ] of height κ such that $0^\sharp \not\in L\lbrack\mathbf{T}\rbrack$ . Yet T is $ -distributive in L[ 0 ♯ ]. A proper class version of this theorem yields an analogous L[ 0 ♯ ]-definable tree such that distinct branches in the presence of 0 ♯ collapse the universe. A heretofore unutilized method for (...) constructing in L[ 0 ♯ ] generic objects for certain L-definable forcings and "exotic sequences", combinatorial principles introduced by C. Gray, are used in constructing these trees. (shrink)