The space CS(R) has a unique “Borel structure” in the following sense. Note that there is a natural mapping from R¥ onto CS(R}; namely, taking ranges. We can combine this with any Borel bijection from R onto R¥ in order to get a “preferred” surjection F:R ® CS(R).

We show that from a supercompact cardinal $\kappa$, there is a forcing extension $V[G]$ that has a symmetric inner model $N$ in which $\mathrm {ZF}+\lnot\mathrm {AC}$ holds, $\kappa$ and $\kappa^{+}$ are both singular, and the continuum function at $\kappa$ can be precisely controlled, in the sense that the final model contains a sequence of distinct subsets of $\kappa$ of length equal to any predetermined ordinal. We also show that the above situation can be collapsed to obtain a model of (...) $\mathrm {ZF}+\lnot\mathrm {AC}_{\omega}$ in which either $\aleph_{1}$ and $\aleph_{2}$ are both singular and the continuum function at $\aleph_{1}$ can be precisely controlled, or $\aleph_{\omega}$ and $\aleph_{\omega+1}$ are both singular and the continuum function at $\aleph_{\omega}$ can be precisely controlled. Additionally, we discuss a result in which we separate the lengths of sequences of distinct subsets of consecutive singular cardinals $\kappa$ and $\kappa^{+}$ in a model of $\mathrm {ZF}$. Some open questions concerning the continuum function in models of $\mathrm {ZF}$ with consecutive singular cardinals are posed. (shrink)

It is shown to be consistent with set theory that every set of reals of size ℵ1 is null yet there are ℵ1 planes in Euclidean 3-space whose union is not null. Similar results will be obtained for other geometric objects. The proof relies on results from harmonic analysis about the boundedness of certain harmonic functions and a measure theoretic pigeonhole principle.

In the book Cardinal Invariants on Boolean Algebras by J. Donald Monk many such cardinal functions are defined and studied. Among them several are generalizations of well known cardinal characteristics of the continuum. Alongside a long list of open problems is given. Focusing on half a dozen of those cardinal invariants some of those problems are given an answer here, which in most of the cases is a definitive one. Most of them can be divided (...) in two groups. The problems of the first group ask about the change on those cardinal functions when going from a given infinite Boolean algebra to its simple extensions, while in the second group the comparison is between a couple of given infinite Boolean algebras and their free product. (shrink)

Given a cofinal cardinal function $h\in {}^{\kappa }\kappa $ for $\kappa $ inaccessible, we consider the dominating h-localisation number, that is, the least cardinality of a dominating set of h-slaloms such that every $\kappa $ -real is localised by a slalom in the dominating set. It was proved in [3] that the dominating localisation numbers can be consistently different for two functions h (the identity function and the power function). We will construct a $\kappa ^+$ -sized family of (...) functions h and their corresponding localisation numbers, and use a ${\leq }\kappa $ -supported product of a cofinality-preserving forcing to prove that any simultaneous assignment of these localisation numbers to cardinals above $\kappa $ is consistent. This answers an open question from [3]. (shrink)

Different analyses of complex cardinal numerals have been proposed in Generative Grammar. This article provides an analysis of these expressions based on the Strong Minimalist Thesis, according to which the derivations of linguistic expressions are generated by a simple combinatorial operation, applying in accord with principles external to the language faculty. The proposed derivations account for the asymmetrical structure of additive and multiplicative complexes and for the instructions they provide to the external systems for their interpretation. They harmonize with (...) those of coordinate nouns, and thus offer a unified Minimalist account of their core properties. Firstly, the empirical problem addressed is stated. Secondly, the theoretical framework is presented. Thirdly, Minimalist derivations for additive and multiplicative complexes are provided. Fourthly, the proposed derivations are contrasted with derivations not relying on the Strong Minimalist Thesis. Lastly, consequences for linguistic theory are identified as well as questions open to further inquiry. (shrink)

Noetherian type and Noetherian π-type are two cardinal functions which were introduced by Peregudov in 1997, capturing some properties studied earlier by the Russian School. Their behavior has been shown to be akin to that of the cellularity, that is the supremum of the sizes of pairwise disjoint non-empty open sets in a topological space. Building on that analogy, we study the Noetherian π-type of κ-Suslin Lines, and we are able to determine it for every κ up to (...) the first singular cardinal. We then prove a consequence of Changʼs Conjecture for ℵω regarding the Noetherian type of countably supported box products which generalizes a result of Lajos Soukup. We finish with a connection between PCF theory and the Noetherian type of certain Pixley–Roy hyperspaces. (shrink)

One manifestation of argumentation is in critical discussions where people genuinely strive cooperatively to achieve critical decisions. Hence, argumentation can be recognized as the process of advancing, supporting, modifying, and criticizing claims so that appropriate decision makers may grant or deny adherence. This audience-centered definition holds the assumption that the participants must willingly engage in public debate and discussion, and their arguments must function to open a critical space and keep it open. This essay investigates `ideological pronouncement,' a kind of (...) rhetoric that undermines and limits the possibility of critical discussion among target audiences, as an enemy of sound argumentation. First, the essential characteristics of sound argumentation are explained. Next, the typical characteristics of ideological rhetoric are described. At the same time, the Cardinal Principles of the National Entity of Japan, a Japanese wartime moral education textbook, is examined as a paradigm case of ideological rhetoric. Third, three key pronouncements of the Cardinal Principles are outlined and discussed. Finally, implications from the critical discussion are drawn. (shrink)

We give some results concerning various generalized continuum cardinals. The results answer some natural questions which have arisen in preparing a new edition of 5. To make the paper self-contained we define all of the cardinal functions that enter into the theorems here. There are many problems concerning these new functions, and we formulate some of the more important ones.

§1. Introduction. Among the most remarkable discoveries in set theory in the last quarter century is the rich structure of the arithmetic of singular cardinals, and its deep relationship to large cardinals. The problem of finding a complete set of rules describing the behavior of the continuum function 2ℵα for singular ℵα's, known as the Singular Cardinals Problem, has been attacked by many different techniques, involving forcing, large cardinals, inner models, and various combinatorial methods. The work on the singular cardinals (...) problem has led to many often surprising results, culminating in a beautiful theory of Saharon Shelah called the pcf theory. The most striking result to date states that if 2ℵn < ℵω for every n = 0, 1, 2, …, then 2ℵω < ℵω4.In this paper we present a brief history of the singular cardinals problem, the present knowledge, and an introduction into Shelah's pcf theory. In Sections 2, 3 and 4 we introduce the reader to cardinal arithmetic and to the singular cardinals problems. Sections 5, 6, 7 and 8 describe the main results and methods of the last 25 years and explain the role of large cardinals in the singular cardinals problem. In Section 9 we present an outline of the pcf theory.§2. The arithmetic of cardinal numbers. Cardinal numbers were introduced by Cantor in the late 19th century and problems arising from investigations of rules of arithmetic of cardinal numbers led to the birth of set theory. The operations of addition, multiplication and exponentiation of infinite cardinal numbers are a natural generalization of such operations on integers. Addition and multiplication of infinite cardinals turns out to be simple: when at least one of the numbers κ, λ is infinite then both κ + λ and κ·λ are equal to max {κ, λ}. In contrast with + and ·, exponentiation presents fundamental problems. In the simplest nontrivial case, 2κ represents the cardinal number of the power set P, the set of all subsets of κ. (Here we adopt the usual convention of set theory that the number κ is identified with a set of cardinality κ, namely the set of all ordinal numbers smaller than κ. (shrink)

In this paper we continue the line of work initiated in “Building iteration trees”. It is shown that the existence of a certain kind of iteration tree of height ω is equivalent to the existence of a cardinal δ that is Woodin with respect to functions in the next admissible.

We discuss in the paper the following problem: Given a function in a given Baire class, into "how many" (in terms of cardinal numbers) functions of lower classes can it be decomposed? The decomposition is understood here in the sense of the set-theoretical union.

Unfoldable cardinals are preserved by fast function forcing and the Laver-like preparations that fast functions support. These iterations show, by set-forcing over any model of ZFC, that any given unfoldable cardinal κ can be made indestructible by the forcing to add any number of Cohen subsets to κ.

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)

Under the assumption that δ is a Woodin cardinal and GCH holds, I show that if F is any class function from the regular cardinals to the cardinals such that (1) ${\kappa < {\rm cf}(F(\kappa))}$ , (2) ${\kappa < \lambda}$ implies ${F(\kappa) \leq F(\lambda)}$ , and (3) δ is closed under F, then there is a cofinality-preserving forcing extension in which 2 γ = F(γ) for each regular cardinal γ < δ, and in which δ remains Woodin. Unlike (...) the analogous results for supercompact cardinals [Menas in Trans Am Math Soc 223:61–91, (1976)] and strong cardinals [Friedman and Honzik in Ann Pure Appl Logic 154(3):191–208, (2008)], there is no requirement that the function F be locally definable. I deduce a global version of the above result: Assuming GCH, if F is a function satisfying (1) and (2) above, and C is a class of Woodin cardinals, each of which is closed under F, then there is a cofinality-preserving forcing extension in which 2 γ = F(γ) for all regular cardinals γ and each cardinal in C remains Woodin. (shrink)

This paper attempts to present and organize several problems in the theory of Singular Cardinals. The most famous problems in the area (bounds for the ℶ-function at singular cardinals) are well known to all mathematicians with even a rudimentary interest in set theory. However, it is less well known that the combinatorics of singular cardinals is a thriving area with results and problems that do not depend on a solution of the Singular Cardinals Hypothesis. We present here an annotated collection (...) of representative problems with some references. Where the problems are novel, attribution is attempted and it is noted where money is attached to particular problems. Three closely related themes are represented in these problems: stationary sets and stationary set reflection, variations of square and approachability, and the singular cardinals hypothesis. Underlying many of them are ideas from Shelah's PCF theory. Important subthemes were mutual stationarity, Aronszajn trees, and superatomic Boolean Algebras. The author notes considerable overlap between this paper and the unpublished report submitted to the Banff Center for the Workshop on Singular Cardinals Combinatorics, May 1–5, 2004. (shrink)

I analyze the hierarchy of large cardinals between a supercompact cardinal and an almost-huge cardinal. Many of these cardinals are defined by modifying the definition of a high-jump cardinal. A high-jump cardinal is defined as the critical point of an elementary embedding j:V→M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${j: V \to M}$$\end{document} such that M is closed under sequences of length sup{j|f:κ→κ}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sup\{{j\,|\,f: \kappa \to \kappa}\}}$$\end{document}. (...) Some of the other cardinals analyzed include the super-high-jump cardinals, almost-high-jump cardinals, Shelah-for-supercompactness cardinals, Woodin-for-supercompactness cardinals, Vopěnka cardinals, hypercompact cardinals, and enhanced supercompact cardinals. I organize these cardinals in terms of consistency strength and implicational strength. I also analyze the superstrong cardinals, which are weaker than supercompact cardinals but are related to high-jump cardinals. Among the results, I highlight the following. Vopěnka cardinals are the same as Woodin-for-supercompactness cardinals.There are no excessively hypercompact cardinals.Furthermore, I prove some results relating high-jump cardinals to forcing, as well as analyzing Laver functions for super-high-jump cardinals. (shrink)

A mass problem is a set of functions$\omega \to \omega $. For mass problems${\mathcal {C}}, {\mathcal {D}}$, one says that${\mathcal {C}}$is Muchnik reducible to${\mathcal {D}}$if each function in${\mathcal {C}}$is computed by a function in${\mathcal {D}}$. In this paper we study some highness properties of Turing oracles, which we view as mass problems. We compare them with respect to Muchnik reducibility and its uniform strengthening, Medvedev reducibility.For$p \in [0,1]$let${\mathcal {D}}(p)$be the mass problem of infinite bit sequencesy(i.e.,$\{0,1\}$-valued functions) such that (...) for each computable bit sequencex, the bit sequence$ x {\,\leftrightarrow\,} y$has asymptotic lower density at mostp(where$x {\,\leftrightarrow\,} y$has a$1$in positionniff$x(n) = y(n)$). We show that all members of this family of mass problems parameterized by a realpwith$0 p$for each computable setx. We prove that the Medvedev (and hence Muchnik) complexity of the mass problems${\mathcal {B}}(p)$is the same for all$p \in (0, 1/2)$, by showing that they are Medvedev equivalent to the mass problem of functions bounded by${2^{2}}^{n}$that are almost everywhere different from each computable function.Next, together with Joseph Miller, we obtain a proper hierarchy of the mass problems of type$\text {IOE}$: we show that for any order functiongthere exists a faster growing order function$h $such that$\text {IOE}(h)$is strictly above$\text {IOE}(g)$in the sense of Muchnik reducibility.We study cardinal characteristics in the sense of set theory that are analogous to the highness properties above. For instance,${\mathfrak {d}} (p)$is the least size of a setGof bit sequences such that for each bit sequencexthere is a bit sequenceyinGso that$\underline \rho (x {\,\leftrightarrow\,} y)>p$. We prove within ZFC all the coincidences of cardinal characteristics that are the analogs of the results above. (shrink)

We reexamine some of the classic problems connected with the use of cardinal utility functions in decision theory, and discuss Patrick Suppes's contributions to this field in light of a reinterpretation we propose for these problems. We analytically decompose the doctrine of ordinalism, which only accepts ordinal utility functions, and distinguish between several doctrines of cardinalism, depending on what components of ordinalism they specifically reject. We identify Suppes's doctrine with the major deviation from ordinalism that conceives of (...) utility functions as representing preference differences, while being non- etheless empirically related to choices. We highlight the originality, promises and limits of this choice-based cardinalism. (shrink)

In 2002, Yorioka introduced the σ-ideal ${{\mathcal {I}}_f}$ for strictly increasing functions f from ω into ω to analyze the cofinality of the strong measure zero ideal. For each f, we study the cardinal coefficients (the additivity, covering number, uniformity and cofinality) of ${{\mathcal {I}}_f}$.

Remarkable cardinals were introduced by Schindler, who showed that the existence of a remarkable cardinal is equiconsistent with the assertion that the theory of L\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${L}$$\end{document} is absolute for proper forcing :176–184, 2000). Here, we study the indestructibility properties of remarkable cardinals. We show that if κ is remarkable, then there is a forcing extension in which the remarkability of κ becomes indestructible by all <κ-closed ≤κ-distributive forcing and all two-step iterations (...) of the form Add∗R˙\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${Add*\dot{\mathbb R}}$$\end{document}, where R˙\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\dot{\mathbb R}}$$\end{document} is forced to be <κ-closed and ≤κ-distributive. In the process, we introduce the notion of a remarkable Laver function and show that every remarkable cardinal carries such a function. We also show that remarkability is preserved by the canonical forcing of the GCH. (shrink)

We study cardinal invariants of systems of meager hereditary families of subsets of ω connected with the collapse of the continuum by Sacks forcing S and we obtain a cardinal invariant yω such that S collapses the continuum to yω and y ≤ yω ≤ b. Applying the Baumgartner-Dordal theorem on preservation of eventually narrow sequences we obtain the consistency of y = yω < b. We define two relations $\leq _{0}^{\ast}$ and $\leq _{1}^{\ast}$ on the set $(^{\omega}\omega)_{{\rm (...) Fin}}$ of finite-to-one functions which are Tukey equivalent to the eventual dominance relation of functions such that if $\germ{F}\subseteq (^{\omega}\omega)_{Fin}$ is $\leq _{1}^{\ast}$ -unbounded, well-ordered by $\leq _{1}^{\ast}$ , and not $\leq _{0}^{\ast}$ -dominating, then there is a nonmeager p-ideal. The existence of such a system F follows from Martin's axiom. This is an analogue of the results of [3], [9, 10] for increasing functions. (shrink)

We prove from suitable large cardinal hypotheses that the least weakly compact cardinal can be unfoldable, weakly measurable and even nearly θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\theta}$$\end{document}-supercompact, for any desired θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\theta}$$\end{document}. In addition, we prove several global results showing how the entire class of weakly compactcardinals, a proper class, can be made to coincide with the class of unfoldable cardinals, with the class of weakly measurable (...) cardinals or with the class of nearly θκ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\theta_\kappa}$$\end{document}-supercompact cardinals κ\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}, for nearly any desired function κ↦θκ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa\mapsto\theta_\kappa}$$\end{document}. These results answer several questions that had been open in the literature and extend to these large cardinals the identity-crises phenomenon, first identified by Magidor with the strongly compact cardinals. (shrink)

We propose developing the theory of consequences of morasses relevant in mathematical applications in the language alternative to the usual one, replacing commonly used structures by families of sets originating with Velleman’s neat simplified morasses called 2-cardinals. The theory of related trees, gaps, colorings of pairs and forcing notions is reformulated and sketched from a unifying point of view with the focus on the applicability to constructions of mathematical structures like Boolean algebras, Banach spaces or compact spaces. The paper is (...) dedicated to the memory of Jim Baumgartner whose seminal joint paper :109–129, 1987) with Saharon Shelah provided a critical mass in the theory in question. A new result which we obtain as a side product is the consistency of the existence of a function \ with the appropriate \-version of property \ for regular \ satisfying \. (shrink)

In his "Grundgesetze", Frege hints that prior to his theory that cardinal numbers are objects he had an "almost completed" manuscript on cardinals. Taking this early theory to have been an account of cardinals as second-level functions, this paper works out the significance of the fact that Frege's cardinal numbers is a theory of concept-correlates. Frege held that, where n > 2, there is a one—one correlation between each n-level function and an n—1 level function, and a (...) one—one correlation between each first-level function and an object. Applied to cardinals, the correlation offers new answers to some perplexing features of Frege's philosophy. It is shown that within Frege's concept-script, a generalized form of Hume's Principle is equivalent to Russell's Principle ofion — a principle Russell employed to demonstrate the inadequacy of definition by abstraction. Accordingly, Frege's rejection of definition of cardinal number by Hume's Principle parallels Russell's objection to definition by abstraction. Frege's correlation thesis reveals that he has a way of meeting the structuralist challenge that it is arithmetic, and not a privileged progression of objects, that matters to the finite cardinals. (shrink)

We show how the use of a Laver function in the proof of the consistency, relative to the existence of a supercompact cardinal, of both the Proper Forcing Axiom and the Semiproper Forcing Axiom can be eliminated via the use of lottery sums of the appropriate partial orderings.

In [1] it was shown that if κ is a strong partition cardinal, then every function from [κ ]κ to [κ ]κ is continuous almost everywhere. In this investigation, we explore whether such functions are differentiable or integrable in any sense. Some of them are.

We show that under certain large cardinal requirements there is a generic extension in which the power function behaves differently on different stationary classes. We achieve this by doing an Easton support iteration of the Radin on extenders forcing.

• We define a notion of order of indiscernibility type of a structure by analogy with Mitchell order on measures; we use this to define a hierarchy of strong axioms of infinity defined through normal filters, the α-weakly Erdős hierarchy. The filters in this hierarchy can be seen to be generated by sets of ordinals where these indiscernibility orders on structures dominate the canonical functions.• The limit axiom of this is that of greatly Erdős and we use it to (...) calibrate some strengthenings of the Chang property, one of which, CC+, is equiconsistent with a Ramsey cardinal, and implies that where K is the core model built with non-overlapping extenders — if it is rigid, and others which are a little weaker. As one corollary we have:TheoremIf then there is an inner model with a strong cardinal. • We define an α-Jónsson hierarchy to parallel the α-Ramsey hierarchy, and show that κ being α-Jónsson implies that it is α-Ramsey in the core model. (shrink)

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V “ZFC + Ω is the least inaccessible limit of measurable limits of supercompact cardinals + ƒ : Ω → 2 is a function”, then there is a partial ordering P V so that for , There is a proper class of compact cardinals + (...) If ƒ = 0, then the αth compact cardinal is not supercompact + If ƒ = 1, then the αth compact cardinal is supercompact”. We then prove a generalized version of this theorem assuming κ is a supercompact limit of supercompact cardinals and ƒ : κ → 2 is a function, and we derive as corollaries of the generalized version of the theorem the consistency of the least measurable limit of supercompact cardinals being the same as the least measurable limit of nonsupercompact strongly compact cardinals and the consistency of the least supercompact cardinal being a limit of strongly compact cardinals. (shrink)

We define what it means for a function on ω1 to be a collapsing function for λ and show that if there exists a collapsing function for +, then there is no precipitous ideal on ω1. We show that a collapsing function for ω2 can be added by forcing. We define what it means to be a weakly ω1-Erdös cardinal and show that in L[E], there is a collapsing function for λ iff λ is less than the least weakly (...) ω1-Erdös cardinal. As a corollary to our results and a theorem of Neeman, the existence of a Woodin limit of Woodin cardinals does not imply the existence of precipitous ideals on ω1. We also show that the following statements hold in L[E]. The least cardinal λ with the Chang property ↠ is equal to the least ω1-Erdös cardinal. In particular, if j is a generic elementary embedding that arises from non-stationary tower forcing up to a Woodin cardinal, then the minimum possible value of j is the least ω1-Erdös cardinal. (shrink)

A function f from ω1 to the ordinals is called a canonical function for an ordinal α if f represents α in any generic ultrapower induced by forcing with math formula. We introduce here a method for coding sets of ordinals using canonical functions from ω1 to ω1. Combining this approach with arguments from, we show, assuming the Continuum Hypothesis, that for each cardinal κ there is a forcing construction preserving cardinalities and cofinalities forcing that every subset of (...) κ is an element of the inner model math formula. (shrink)

Modern microeconomic theory is based on a foundation of ordinal preference relations. Good textbooks stress that cardinal utility functions are artificial constructions of convenience, and that economics does not attribute any meaning to “utils.” However, we argue that despite this official position, in practice mainstream economists rely on techniques that assume the validity of cardinal utility. Doing so has turned mainstream economic theorizing into an exercise of reductionism of objects down to the preferences of ‘ideal type’ subjects.

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)

Assume [Formula: see text]. If [Formula: see text] is an ordinal and X is a set of ordinals, then [Formula: see text] is the collection of order-preserving functions [Formula: see text] which have uniform cofinality [Formula: see text] and discontinuous everywhere. The weak partition properties on [Formula: see text] and [Formula: see text] yield partition measures on [Formula: see text] when [Formula: see text] and [Formula: see text] when [Formula: see text]. The following almost everywhere continuity properties for (...) class='Hi'>functions on partition spaces with respect to these partition measures will be shown. For every [Formula: see text] and function [Formula: see text], there is a club [Formula: see text] and a [Formula: see text] so that for all [Formula: see text], if [Formula: see text] and [Formula: see text], then [Formula: see text]. For every [Formula: see text] and function [Formula: see text], there is an [Formula: see text]-club [Formula: see text] and a [Formula: see text] so that for all [Formula: see text], if [Formula: see text] and [Formula: see text], then [Formula: see text]. The previous two continuity results will be used to distinguish the cardinalities of some important subsets of [Formula: see text]. [Formula: see text]. [Formula: see text]. [Formula: see text]. It will also be shown that [Formula: see text] has the Jónsson property: For every [Formula: see text], there is an [Formula: see text] with [Formula: see text] so that [Formula: see text]. (shrink)

We prove two theorems which in a certain sense show that the number of normal measures a measurable cardinal κ can carry is independent of a given fixed behavior of the continuum function on any set having measure 1 with respect to every normal measure over κ . First, starting with a model V ⊨ “ZFC + GCH + o = δ*” for δ* ≤ κ+ any finite or infinite cardinal, we force and construct an inner model N (...) ⊆ V [G] so thatN ⊨ “ZF + [DCδ] + ¬ACκ + κ carries exactly δ* normal measures + 2δ = δ++ on a set having measure 1 with respect to every normal measure over κ”.There is nothing special about 2δ = δ here, and other stated values for the continuum function will be possible as well. Then, starting with a modelV ⊨ “ZFC + GCH + κis supercompact”,we force and construct models of AC in which, roughly speaking, regardless of the specified behavior of the continuum function below κ on any set having measure 1 with respect to every normal measure over κ, κ can in essence carry any number of normal measures δ* ≥ κ++. (shrink)

The history of productivity of the κ-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every regular cardinal κ > א1, the principle □ is equivalent to the existence of a certain strong coloring c : [κ]2 → κ for which the family of fibers T is a nonspecial κ-Aronszajn tree. The theorem follows from an (...) analysis of a new characteristic function for walks on ordinals, and implies in particular that if the κ-chain condition is productive for a given regular cardinal κ > א1, then κ is weakly compact in some inner model of ZFC. This provides a partial converse to the fact that if κ is a weakly compact cardinal, then the κ-chain condition is productive. (shrink)

Since then we have been engaged in the development of such results of greater relevance to mathematical practice. In January, 1997 we presented some new results of this kind involving what we call “jump free” classes of finite functions. This Jump Free Theorem is treated in section 2.

For a set M, let \\) denote the set of all finite sequences which can be formed with elements of M, and let \ denote the set of all 2-element subsets of M. Furthermore, for a set A, let Open image in new window denote the cardinality of A. It will be shown that the following statement is consistent with Zermelo–Fraenkel Set Theory \: There exists a set M such that Open image in new window and no function Open image (...) in new window is finite-to-one. (shrink)

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that κ, λ are infinite cardinals such that κ++ + ≤ λ, κ<κ = κ and 2κ = κ+, and η is an ordinal with κ+ ≤ η < κ++ and cf = κ+. Then, in some cardinal-preserving generic extension there is a superatomic Boolean algebra equation image such that equation image, equation image for every α < η and equation image. Especially, equation image and equation (...) image can be cardinal sequences of superatomic Boolean algebras. (shrink)

Understanding what numbers are means knowing several things. It means knowing how counting relates to numbers (called the cardinal principle or cardinality); it means knowing that each number is generated by adding one to the previous number (called the successor function or succession), and it means knowing that all and only sets whose members can be placed in one-to-one correspondence have the same number of items (called exact equality or equinumerosity). A previous study (Sarnecka & Carey, 2008) linked children's (...) understanding of cardinality to their understanding of succession for the numbers five and six. This study investigates the link between cardinality and equinumerosity for these numbers, finding that children either understand both cardinality and equinumerosity or they understand neither. This suggests that cardinality and equinumerosity (along with succession) are interrelated facets of the concepts five and six, the acquisition of which is an important conceptual achievement of early childhood. (shrink)

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)

In the context of today.s moral and ecological crisis, and the accelerated advance of information and communication technologies, when human beings intensively experience their own fragility, a major question is that of well-being. That raises the issue of moral health, which represents, in an axiological and normative sense, a basis for the human being to find proper opportunities for remaking and protecting the beingness' equilibrium in face of a variety of risks in a society of excesses. We consider that a (...) significant element of moral health lies in the old Greek value of sophrosýne. In this essay, we highlight its meaning and role. We do this by reviving the core of a wise learning coming from Ancient philosophy about one of the moral excellences. Sophrosýne is approached as a necessary factor in human well-being; it is pursued in the prophylactic and therapeutic potential for the maintenance of human health; finally, it is developed inits fundamental action of allowing happiness in a well-functioning and self-fulfilling life of the human being. (shrink)

It is shown to be consistent that the reals are covered by ℵ1 meagre sets yet there is a Baire class 1 function which cannot be covered by fewer than ℵ2 continuous functions. A new cardinal invariant is introduced which corresponds to the least number of continuous functions required to cover a given function. This is characterized combinatorially. A forcing notion similar to, but not equivalent to, superperfect forcing is introduced.