We show that for all natural numbers n, the theory “ZF + DC $_{\aleph_n}$ + $\aleph_{\omega}$ is a Rowbottom cardinal carrying a Rowbottom filter” has the same consistency strength as the theory “ZFC + There exists a measurable cardinal”. In addition, we show that the theory “ZF + $\aleph_{\omega_1}$ is an ω 2-Rowbottom cardinal carrying an ω 2-Rowbottom filter and ω 1 is regular” has the same consistency strength as the theory “ZFC + There exist ω 1 measurable cardinals”. (...) We also discuss some generalizations of these results. (shrink)

We introduce a natural two-cardinal version of Bagaria’s sequence of derived topologies on ordinals. We prove that for our sequence of two-cardinal derived topologies, limit points of sets can be characterized in terms of a new iterated form of pairwise simultaneous reflection of certain kinds of stationary sets, the first few instances of which are often equivalent to notions related to strong stationarity, which has been studied previously in the context of strongly normal ideals. The non-discreteness of these (...) two-cardinal derived topologies can be obtained from certain two-cardinal indescribability hypotheses, which follow from local instances of supercompactness. Additionally, we answer several questions posed by the first author, Holy and White on the relationship between Ramseyness and indescribability in both the cardinal context and in the two-cardinal context. (shrink)

We examine combinatorial aspects and consistency strength properties of almost Ramsey cardinals. Without the Axiom of Choice, successor cardinals may be almost Ramsey. From fairly mild supercompactness assumptions, we construct a model of ZF + ${\neg {\rm AC}_\omega}$ in which every infinite cardinal is almost Ramsey. Core model arguments show that strong assumptions are necessary. Without successors of singular cardinals, we can weaken this to an equiconsistency of the following theories: “ZFC + There is (...) a proper class of regular almost Ramsey cardinals”, and “ZF + DC + All infinite cardinals except possibly successors of singular cardinals are almost Ramsey”. (shrink)

We show that the predicate “x is the power set of y” is ‐definable, if V = L[E] is an extender model constructed from a coherent sequences of extenders, provided that there is no inner model with a Woodin cardinal. Here is a predicate true of just the infinite cardinals. From this we conclude: the validities of second order logic are reducible to, the set of validities of the Härtig quantifier logic. Further we show that if no L[E] (...) model has a cardinal strong up to one of its ℵ‐fixed points, and, the Löwenheim number of this logic, is less than the least weakly inaccessible δ, then (i) is a limit of measurable cardinals of K, and (ii) the Weak Covering Lemma holds at δ. (shrink)

Building on the work of Schimmerling [Coherent sequences and threads, Adv. Math.216 89–117] and Steel [PFA implies AD L, J. Symbolic Logic70 1255–1296], we show that the failure of square principle at a singular strong limit cardinal implies that there is a nontame mouse. The proof presented is the first inductive step beyond L of the core model induction that is aimed at getting a model of ADℝ + "Θ is regular" from the failure of square at a singular (...) strong limit cardinal or PFA. (shrink)

Assuming the existence of a measurable cardinal, we define a hierarchy of Ramsey cardinals and a hierarchy of normal filters. We study some combinatorial properties of this hierarchy. We show that this hierarchy is absolute with respect to the Dodd-Jensen core model, extending a result of Mitchell which says that being Ramsey is absolute with respect to the core model.

We investigate, in ZFC, the behavior of abstract elementary classes categorical in many successive small cardinals. We prove for example that a universal $\mathbb {L}_{\omega _1, \omega }$ sentence categorical on an end segment of cardinals below $\beth _\omega $ must be categorical also everywhere above $\beth _\omega $. This is done without any additional model-theoretic hypotheses and generalizes to the much broader framework of tame AECs with weak amalgamation and coherent sequences.

In set theory without the axiom of choice (AC), we study the relative strength of the principle “No decreasing sequence of cardinals,” that is, “There is no function f on ω such that |f(n+1)|<|f(n)| for all n∈ω” (NDS) with regard to its position in the hierarchy of weak choice principles. We establish the following results: (1) The Boolean prime ideal theorem plus countable choice does not imply NDS in ZF; (2) “Every non-well-orderable set has a well-orderable partition into (...) denumerable sets” (Dℵ0) plus the axiom of choice for well-ordered families of nonempty finite sets does not imply NDS ∨ “The axiom of choice for countable families of nonempty countable sets” in ZFA; and (3) The axiom of choice for well-ordered families of nonempty sets, each of cardinality not greater than or equal to 2ℵ0, does not imply NDS ∨ “countable union theorem” in ZFA. The above results answer corresponding questions left open in works by Howard and Rubin (1998) and Howard and Tachtsis (2016). We also show the following: (4) “Every non-well-orderable set has a well-orderable partition into infinite well-orderable sets” (Dw) is strictly weaker than D ℵ0 in ZFA. This resolves an open problem from Keremedis and Tachtsis (2003). (shrink)

Let denote the class of all cardinal sequences of length α associated with compact scattered spaces. Also put If λ is a cardinal and α λ1>>λn−1 and ordinals α0,…,αn−1 such that α=α0++αn−1 and where each .The proofs are based on constructions of universal locally compact scattered spaces.

We prove that for [Formula: see text] and [Formula: see text] there is a forcing extension with exactly n near-coherence classes of non-principal ultrafilters. We introduce localized versions of Matet forcing and we develop Ramsey spaces of names. The evaluation of some of the new forcings is based on a relative of Hindman’s theorem due to Blass 1987.

We extend the construction of a global square sequence in extender models from Zeman [8] to a construction of coherent non-threadable sequences and give a characterization of stationary reflection at inaccessibles similar to Jensen’s characterization in L.

In set theory without the Axiom of Choice, we investigate the set-theoretic strength of the principle NDS which states that there is no function f on the set ω of natural numbers such that for everyn ∈ ω, f ≺ f, where for sets x and y, x ≺ y means that there is a one-to-one map g : x → y, but no one-to-one map h : y → x. It is a long standing open problem whether NDS implies (...) AC. In this paper, among other results, we show that NDS is a strong axiom by establishing that ACLO ↛ NDS in ZFA set theory. The latter result provides a strongly negative answer to the question of whether “every Dedekind-finite set is finite” implies NDS addressed in G. H. Moore “Zermelo’s Axiom of Choice. Its Origins, Development, and Influence” and in P. Howard–J. E. Rubin “Consequences of the Axiom of Choice”. We also prove that ACWO ↛ NDS in ZF and that “for all infinite cardinals m, m + m = m” ↛ NDS in ZFA. (shrink)

We prove that, in any fine structural extender model with Jensen’s λ-indexing, there is a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square(\kappa^{+})}$$\end{document} -sequence if and only if there is a pair of stationary subsets of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa^{+} \cap {\rm {cof}}( < \kappa)}$$\end{document} without common reflection point of cofinality \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${ < \kappa}$$\end{document} which, in turn, is equivalent to the existence of (...) a family of size \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${ < \kappa}$$\end{document} of stationary subsets of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa^{+} \cap {\rm {cof}}( < \kappa)}$$\end{document} without common reflection point of cofinality \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${ < \kappa}$$\end{document}. By a result of Burke/jensen, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square_\kappa}$$\end{document} fails whenever \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa}$$\end{document} is a subcompact cardinal. Our result shows that in extender models, it is still possible to construct a canonical \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square(\kappa^{+})}$$\end{document} -sequence where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa}$$\end{document} is the first subcompact. (shrink)

We attempt to make a connection between the sequences of measures used to define Radin forcing and the coherent sequences of extenders which are the basis of modern inner model theory. We show that in certain circumstances we can read off sequences of measures as defined by Radin from coherent sequences of extenders, and that we can define Radin forcing directly from a coherent extender sequence and a sequence of ordinals; this generalises Mitchell's construction of (...) Radin forcing from a coherent sequence of measures. (shrink)

We prove that if GCH holds and τ = 〈κα : α < η 〉 is a sequence of infinite cardinals such that κα ≥ |η | for each α < η, then there is a cardinal-preserving partial order that forces the existence of a scattered Boolean space whose cardinal sequence is τ.

We improve on results and constructions by Apter, Dimitriou, Gitik, Hayut, Karagila, and Koepke concerning large cardinals, ultrafilters, and cofinalities without the axiom of choice. In particular, we show the consistency of the following statements from certain assumptions: the first supercompact cardinal can be the first uncountable regular cardinal, all successors of regular cardinals are Ramsey, every sequence of stationary sets in is mutually stationary, an infinitary Chang conjecture holds for the cardinals, and all are (...) singular. In each of the cases, our results either weaken the hypotheses or strengthen the conclusions of known proofs. (shrink)

Prediction is more than testing established theory by examining whether the prediction matches the data. To show this, I examine the practices of a community of scientists, known as threaders, who are attempting to predict the final, folded structure of a protein from its primary structure, i.e., its amino acid sequence. These scientists employ a careful and deliberate methodology of prediction. A key feature of the methodology is calibration. They calibrate in order to construct better models. The construction leads (...) to knowledge of how to construct or build an object. Thus, prediction serves a cognitive goal of model construction and not just model or theory testing. The kind of knowledge that results is relevantly different than theoretical knowledge. (shrink)

We consider maximal almost disjoint families of block subspaces of countable vector spaces, focusing on questions of their size and definability. We prove that the minimum infinite cardinality of such a family cannot be decided in ZFC and that the “spectrum” of cardinalities of mad families of subspaces can be made arbitrarily large, in analogy to results for mad families on ω. We apply the author’s local Ramsey theory for vector spaces [32] to give partial results concerning their definability.

Fitness is a central concept in evolutionary theory. Just as it is central to biological evolution, so, it seems, it should be central to cultural evolutionary theory. But importing the biological fitness concept to CET is no straightforward task—there are many features unique to cultural evolution that make this difficult. This has led some theorists to argue that there are fundamental problems with cultural fitness that render it hopelessly confused. In this essay, we defend the coherency of cultural fitness against (...) those who call it into doubt. (shrink)

We present an approach to forcing with finite sequences of models that uses models of two types. This approach builds on earlier work of Friedman and Mitchell on forcing to add clubs in cardinals larger than $\aleph_{1}$, with finite conditions. We use the two-type approach to give a new proof of the consistency of the proper forcing axiom. The new proof uses a finite support forcing, as opposed to the countable support iteration in the standard proof. The distinction is (...) important since a proof using finite supports is more amenable to generalizations to cardinals greater than $\aleph_{1}$. (shrink)

We present a downward Löwenheim-Skolem theorem which transfers downward formulas from L ∞,ω to L κ +, ω . The simplest instance is: Theorem 1. Let $\lambda > \kappa$ be infinite cardinals, and let L be a similarity type of cardinality κ at most. For every L-structure M of cardinality λ and every $X \subseteq M$ there exists a model $N \prec M$ containing the set X of power |X| · κ such that for every pair of finite sequences (...) a, b ∈ N $\langle N, \mathbf{a}\rangle \equiv_{\| N \|^+,\omega} \langle N, \mathbf{b}\rangle \Leftrightarrow \langle M, \mathbf{a}\rangle \equiv_{\infty,\omega} \langle M, \mathbf{b}\rangle.$ The following theorem is an application: Theorem 2. Let $\lambda , and suppose χ is a Ramsey cardinal greater than λ. If T has the (χ, L κ +, ω -unsuperstability property, then T has the (χ, L λ +, ω )-unsuperstability property. (shrink)

We write for the cardinality of the set of finite sequences of a set which is of cardinality. With the Axiom of Choice (), for every infinite cardinal where is the cardinality of the permutations on a set which is of cardinality. In this paper, we show that “ for every cardinal ” is provable in and this is the best possible result in the absence of. Similar results are also obtained for : the cardinality of the set of finite (...) sequences without repetition of a set which is of cardinality. (shrink)

For a set x, let S(x) be the set of all permutations of x. We prove by the method of permutation models that the following statements are consistent with ZF: (1) There is an infinite set x such that |p(x)|<|S(x)|<|seq^1-1(x)|<|seq(x)|, where p(x) is the powerset of x, seq(x) is the set of all finite sequences of elements of x, and seq^1-1(x) is the set of all finite sequences of elements of x without repetition. (2) There is a Dedekind infinite set (...) x such that |S(x)|<|[x]^3| and such that there exists a surjection from x onto S(x). (3) There is an infinite set x such that there is a finite-to-one function from S(x) into x. (shrink)

We introduce the class of unshreddable theories, which contains the simple and NIP theories, and prove that such theories have exactly saturated models in singular cardinals, satisfying certain set-theoretic hypotheses. We also give criteria for a theory to have singular compactness.

For a set x, let ${\cal S}\left$ be the set of all permutations of x. We prove in ZF several results concerning this notion, among which are the following: For all sets x such that ${\cal S}\left$ is Dedekind infinite, $\left| {{{\cal S}_{{\rm{fin}}}}\left} \right| < \left| {{\cal S}\left} \right|$ and there are no finite-to-one functions from ${\cal S}\left$ into ${{\cal S}_{{\rm{fin}}}}\left$, where ${{\cal S}_{{\rm{fin}}}}\left$ denotes the set of all permutations of x which move only finitely many elements. For all sets (...) x such that ${\cal S}\left$ is Dedekind infinite, $\left| {{\rm{seq}}\left} \right| < \left| {{\cal S}\left} \right|$ and there are no finite-to-one functions from ${\cal S}\left$ into seq, where seq denotes the set of all finite sequences of elements of x. For all infinite sets x such that there exists a permutation of x without fixed points, there are no finite-to-one functions from ${\cal S}\left$ into x. For all sets x, $|{[x]^2}| < \left| {{\cal S}\left} \right|$. (shrink)

One of the numerous characterizations of a Ramsey cardinal κ involves the existence of certain types of elementary embeddings for transitive sets of size κ satisfying a large fragment of ZFC. We introduce new large cardinal axioms generalizing the Ramsey elementary embeddings characterization and show that they form a natural hierarchy between weakly compact cardinals and measurable cardinals. These new axioms serve to further our knowledge about the elementary embedding properties of smaller large cardinals, in (...) particular those still consistent with V = L. (shrink)

Subtle cardinals were first introduced in a paper by Jensen and Kunen [JK]. They show that ifκis subtle then ◇κholds. Subtle cardinals also play an important role in [B1], where Baumgartner proposed that certain large cardinal properties should be considered as properties of their associated normal ideals. He shows that in the case of ineffables, the ideals are particularly useful, as can be seen by the following theorem,κis ineffable if and only ifκis subtle andΠ½-indescribableandthe subtle andΠ½-indescribable ideals cohere, (...) i.e. they generate a proper, normal ideal.In this paper we examine properties of subtle cardinals and consider methods of forcing that destroy the property of subtlety while maintaining other properties. The following is a list of results.1) We relativize the following two facts about subtle cardinals:i) ifκisn-subtle then {α<κ:αis notn-subtle} isn-subtle, andii) ifκis -subtle then {α<κ:αisn-subtle} is in the -subtle filter to subsets ofκ:i′) ifAis ann-subtle subset ofκthen {α ϵ A:A∩αis notn-subtle} isn-subtle, andii′) ifAis an -subtle subset ofκthen {α ϵ A:A∩αisn-subtle} is -subtle.2) We show that although a stationary limit of subtles is subtle, a subtle limit of subtles is not necessarily 2-subtle.3) In §3 we use the technique of forcing to turn a subtle cardinal into aκ-Mahlo cardinal that is no longer subtle.4) In §4 we extend the results of §3 by showing how to turn an -subtle cardinal into ann-subtle cardinal that is no longer -subtle. (shrink)

The purpose of this paper was to provide an example from phenomenological research of moving from rich descriptive interview data to coherent revelatory descriptions employing empathic bridges within the narrative structure of storytelling. We used transcribed data from two interviews concerning recovery from severe mental illness: one with an American woman in her early thirties, and the other with a Swedish man in his mid-thirties. Five investigators analyzed the transcribed data into individual first-person narrative descriptions according to existing empirical (...) phenomenological methods including an independent reading, identification of themes relevant to processes of recovery from severe mental illness, temporal ordering of themes meaningfully reflecting the sequence of the recounted events, and consensus development. Our findings support the use of empathic bridges as a methodological tool with the narrative structure of firstperson storytelling, as well as the viability and importance of employing this tool to better understand processes of recovery for persons with severe mental illness. (shrink)

Attacks on religious doctrines are often characterized as a form of bigotry and traditional analyses of the concept support this view. I argue that regarding such attacks as bigotry is inconsistent with a variety of contemporary moral attitudes and social goals. I offer an improved account of when we should ascribe bigotry – one that is more coherent with views on tolerance and the importance of open debate. This account focuses upon the justification for hostile attitudes and also limits (...) the target of bigoted thought to persons, not to doctrines, religious or otherwise. I argue that while it is indeed possible to adopt bigoted attitudes toward people classified on the basis of their religious beliefs, it is not possible to hold bigoted attitudes against the beliefs themselves. (shrink)

We consider the existence of coherent families of finite-to-one functions on countable subsets of an uncountable cardinal κ. The existence of such families for κ implies the existence of a winning 2-tactic for player TWO in the countable-finite game on κ. We prove that coherent families exist on κ = ωn, where n ∈ ω, and that they consistently exist for every cardinal κ. We also prove that iterations of Axiom A forcings with countable supports are Axiom A.

Organismal death is foundational to the evolution of life, and many biological concepts such as natural selection and life history strategy are so fashioned only because individuals are mortal. Organisms, irrespective of their organization, are composed of basic functional units—cells—and it is our understanding of cell death that lies at the heart of most general explanatory frameworks for organismal mortality. Cell death can be exogenous, arising from transmissible diseases, predation, or other misfortunes, but there are also endogenous forms of death (...) that are sometimes the result of adaptive evolution. These endogenous forms of death—often labeled programmed cell death, PCD—originated in the earliest cells and are maintained across the tree of life. Here, we consider two problematic issues related to PCD (and cell mortality generally). First, we trace the original discoveries of cell death from the nineteenth century and place current conceptions of PCD in their historical context. Revisions of our understanding of PCD demand a reassessment of its origin. Our second aim is thus to structure the proposed origin explanations of PCD into coherent arguments. In our analysis we argue for the evolutionary concept of PCD and the viral defense-immunity hypothesis for the origin of PCD. We suggest that this framework offers a plausible account of PCD early in the history of life, and also provides an epistemic basis for the future development of a general evolutionary account of mortality. (shrink)

In the Critique of Pure Reason, Kant presents the Principle of Anticipations of Perception as follows: ‘In all appearances the real, which is an object of the sensation, has intensive magnitude, i.e., a degree.’ This paper defends the tenability and coherence of Kant’s argument by solving three prominent difficulties identified by commentators. Firstly, on my interpretation, the schema of the category of ‘limitation’ presents an infinite sphere of possible realities, which provides the transcendental basis for the Principle. Secondly, I take (...) Kant’s otherwise problematic examples of intensive magnitudes to show how we determine a degree according to an ordinal sequence that is constituted by cardinal quantities. Thirdly, I distinguish in Kant’s writings the categorical continuity concerning the a priori principle and the empirical continuity concerning a posteriori sensations. While the former is necessary, the latter is merely possible; but we must nevertheless assume the latter as a cognitive aim. (shrink)

In [4], Kunen used iterated ultrapowers to show that ifUis a normalκ-complete nontrivial ultrafilter on a cardinalκthenL[U], the class of sets constructive fromU, has only the ultrafilterU∩L[U] and this ultrafilter depends only onκ. In this paper we extend Kunen's methods to arbitrary sequencesUof ultrafilters and obtain generalizations of these results. In particular we answer Problem 1 of Kunen and Paris [5] which asks whether the number of ultrafilters onκcan be intermediate between 1 and 22κ. If there is a normalκ-complete ultrafilterUonκsuch (...) that {α <κ: α is measurable} ∈Uthen there is an inner model with exactly two normal ultrafilters onκ, and ifκis super-compact then there are inner models havingκ+ +,κ+or any cardinal less than or equal toκnormal ultrafilters.These methods also show that several properties ofLwhich had been shown to hold forL[U] also hold forL[U]: using an idea of Silver we show that inL[U] the generalized continuum hypothesis is true, there is a Souslin tree, and there is awell-ordering of the reals. In addition we generalize a result of Kunen to characterize the countaby complete ultrafilters ofL[U]. (shrink)

We use exact saturation to study the complexity of unstable theories, showing that a variant of this notion called pseudo-elementary class (PC)-exact saturation meaningfully reflects combinatorial dividing lines. We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum of a countable stable theory and, additionally, that simple unstable theories have PC-exact saturation at singular cardinals satisfying mild set-theoretic hypotheses. This had previously been (...) open even for the random graph. We characterize supersimplicity of countable theories in terms of having PC-exact saturation at singular cardinals of countable cofinality. We also consider the local analog of PC-exact saturation, showing that local PC-exact saturation for singular cardinals of countable cofinality characterizes supershort theories. (shrink)

We study model theoretic tree properties and their associated cardinal invariants. In particular, we obtain a quantitative refinement of Shelah’s theorem for countable theories, show that [Formula: see text] is always witnessed by a formula in a single variable and that weak [Formula: see text] is equivalent to [Formula: see text]. Besides, we give a characterization of [Formula: see text] via a version of independent amalgamation of types and apply this criterion to verify that some examples in the literature are (...) indeed [Formula: see text]. (shrink)

Assuming the existence of suitable large cardinals, we show it is consistent that the Provability logic $\mathbf {GL}$ is complete with respect to the filter sequence of normal measures. This result answers a question of Andreas Blass from 1990 and a related question of Beklemishev and Joosten.

We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem. Suppose κ is a singular strong limit cardinal and 2κ λ where λ is not the successor of a cardinal of cofinality at most κ. If cf > ω then it follows that o λ, and if cf = ωthen either o λ or {α: K o α+n} is confinal in κ for (...) each n ε ω.We also prove several results which extend or are related to this result, notably Theorem. If 2ω ω1 then there is a sharp for a model with a strong cardinal.In order to prove these theorems we give a detailed analysis of the sequences of indiscernibles which come from applying the covering lemma to nonoverlapping sequences of extenders. (shrink)

The countable sequences of cardinals which arise as cardinal sequences of superatomic Boolean algebras were characterized by La Grange on the basis of ZFC set theory. However, no similar characterization is available for uncountable cardinal sequences. In this paper we prove the following two consistency results:Ifθ = 〈κ α :α <ω 1〉 is a sequence of infinite cardinals, then there is a cardinal-preserving notion of forcing that changes cardinal exponentiation and forces the existence of a superatomic Boolean (...) algebraB such that θ is the cardinal sequence ofB.Ifκ is an uncountable cardinal such thatκ <κ =κ andθ = 〈κ α :α <κ +〉 is a cardinal sequence such thatκ α ≥κ for everyα <κ + andκ α =κ for everyα <κ + such that cf(α)<κ, then there is a cardinal-preserving notion of forcing that changes cardinal exponentiation and forces the existence of a superatomic Boolean algebraB such that θ is the cardinal sequence ofB. (shrink)

We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formula over the ordinals.

In this paper I discuss the foundations of a formal theory of coherent and conservative belief change that is (a) suitable to be used as a method for constructing iterated changes of belief, (b) sensitive to the history of earlier belief changes, and (c) independent of any form of dispositional coherence. I review various ways to conceive the relationship between the beliefs actually held by an agent and her belief change strategies (that also deal with potential belief sets), show (...) the problems they suffer from, and suggest that belief states should be represented by unary revision functions that take sequences of inputs. Three concepts of coherence implicit in current theories of belief change are distinguished: synchronic, diachronic and dispositional coherence. Diachronic coherence is essentially identified with what is known as conservatism in epistemology. The present paper elaborates on the philosophical motivation of the general framework; formal details and results are provided in a companion paper. (shrink)

In this article we characterize all those sequences of cardinals of length ω1 which are cardinal sequences of some compact scattered space . This extends the similar results from [R. La Grange, Concerning the cardinal sequence of a Boolean algebra, Algebra Universalis, 7 307–313] for such sequences of countable length. For ordinals between ω1 and ω2 we can only give a sufficient condition for a sequence of that length to be a cardinal sequence of a compact (...) scattered space. This condition is, arguably, the most one can expect in ZFC. In any case, ours is a significant extension of the sufficient conditions given in [J.C. Martinez, A consistency result on thin-tall superatomic Boolean algebras, Proc. Amer. Math. Soc. 115 473–477] and [J. Bagaria, Locally generic Boolean algebras and cardinal sequences, Algebra Universalis 47 283–302]. (shrink)

We introduce insertion domains that support the placement of new, higher, vertices into finite trees. We prove that every nonincreasing insertion domain has an element with simple structural properties in the style of classical Ramsey theory. This result is proved using standard large cardinal axioms that go well beyond the usual axioms for mathematics. We also establish that this result cannot be proved without these large cardinal axioms. We also introduce insertion rules that specify the placement of new, higher, (...) vertices into finite trees. We prove that every insertion rule greedily generates a tree with these same structural properties; and every decreasing insertion rule generates (or admits) a tree with these same structural properties. It is also necessary and sufficient to use the same large cardinals (in the precise sense of Corollary D.25). The results suggest new areas of research in discrete mathematics called "Ramsey tree theory" and "greedy Ramsey theory" which demonstrably require more than the usual axioms for mathematics. (shrink)