Saharon Shelah
This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras), measuring prod_{i<kappa}f(i) by a family of ideals and a family of sequences <B_i:i<kappa> with |B_i|<mu_i, and finally we deal with the existence of strongly almost disjoint families.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Suppose that there is a measurable cardinal. If \aleph_ωis a strong limit cardinal, but the power of \aleph_ωis bigger than \aleph_{ω_1}, then there is an inner model with a Woodin cardinal. Modulo the need of the measurable cardinal this answers a question of Gitik and Mitchell.
From large cardinals we show the consistency of normal, fine, $κ$-complete $λ$-dense ideals on $\mathcal{P}_κ(λ)$ for successor $κ$. We explore the interplay between dense ideals, cardinal arithmetic, and squares, answering some open questions of Foreman.
Part A: A revised version of the guide in "Cardinal Arithmetic" ([Sh:g]), with corrections and expanded to include later works. Part B: Corrections to [Sh:g]. Part C: Contains some revised proof and improved theorems. Part D: Contains a list of relevant references.
We study the effects of piece selection principles on cardinal arithmetic (Shelah style). As an application, we discuss questions of Abe and Usuba. In particular, we show that if $λ\geq 2^κ$, then (a) $I_{κ, λ}$ is not $(λ, 2)$-distributive, and (b) $I_{κ, λ}^+ \rightarrow (I_{κ, λ}^+)^2_ω$ does not hold.
We present a survey of some results of the pcf-theory and their applications to cardinal arithmetic. We review basics notions (in section 1), briefly look at history in section 2 (and some personal history in section 3). We present main results on pcf in section 5 and describe applications to cardinal arithmetic in section 6. The limitations on independence proofs are discussed in section 7, and in section 8 we discuss the status of two axioms that arise in the new setting. Applications to other areas are found in section 9.
We continue the investigations in the author's book on cardinal arithmetic, assuming some knowledge of it. We deal with the cofinality of (S_{<= aleph_0}(kappa), subseteq) for kappa real valued measurable (Section 3), densities of box products (Section 5,3), prove the equality cov(lambda, lambda, theta^+,2)=pp(lambda) in more cases even when cf(lambda)= aleph_0 (Section 1), deal with bounds of pp(lambda) for lambda limit of inaccessible (Section 4) and give proofs to various claims I was sure I had already written but did not find (Section 6).
If cf(kappa) = kappa, kappa^+< cf(lambda) = λ, then there is a stationary subset S of {delta<lambda:cf(delta)=kappa} in I[lambda]. Moreover, we can find <C_delta :delta in S>, C_delta a club of lambda, otp(C_delta)=kappa, guessing clubs and for each alpha<lambda we have: {C_delta \cap alpha: alpha \in nacc(C_delta)} has cardinality <lambda. Also, we prove that e.g. there is a stationary subset of S_{<aleph_1}(lambda) of cardinality cf(S_{<aleph_1}(lambda),subseteq) Then we prove the existence of nice filters when instead being normal filters on omega_1 they are normal filters with larger domai…
Finite sets, mappings, cardinals, and arithmetic in intuitionistic New Foundations
本文探讨了直觉新基础中有限集、幂集、映射、有限基数及其运算的理论，提出修正后的构造方法，探讨基数运算的可能性及算术溢出问题。
The $κ$-density of a cardinal $μ\geκ$ is the least cardinality of a dense collection of $κ$-subsets of $μ$ and is denoted by $\mathcal D(μ,κ)$. The Singular Density Hypothesis (SDH) for a singular cardinal $μ$ of cofinality $cfμ=κ$ is the equation $\mathcal D(μ,κ)=μ^+$. The Generalized Density Hypothesis (GDH) for $μ$ and $λ$ such that $λ\leμ$ is: $\mathcal D(μ,λ)=μ$ if $cfμ\not=cfλ$ and $\mathcal D(μ,λ)=μ^+$ if $cfμ=cfλ$. Density is shown to satisfy Silver's theorem. The most important case is: Theorem 2.6. If $κ=cfκ<θ=cfμ<μ$ and the set of cardinals $λ<μ$ of cofinality $κ$ that satisfy the \…
In this paper, we consider certain cardinals in ZF (set theory without AC, the Axiom of Choice). In ZFC (set theory with AC), given any cardinals C and D, either C <= D or D <= C. However, in ZF this is no longer so. For a given infinite set A consider Seq(A), the set of all sequences of A without repetition. We compare |Seq(A)|, the cardinality of this set, to |P(A)|, the cardinality of the power set of A. What is provable about these two cardinals in ZF? The main result of this paper is that ZF |- for all A: |Seq(A)| not= |P(A)| and we show that this is the best possible result. Furthermore,…
Andrew Wiles' Proof of Fermat's Last Theorem, As Expected, Does Not Require a Large Cardinal Axiom. A Discussion of Colin McLarty's "The Large Structures of Grothendieck Founded on Finite-Order Arithmetic"
本文探讨了 Fermat 大定理的证明是否依赖大基数公理，指出 Colin McLarty 证明了 Grothendieck 的大工具可建立在有限阶算术强度的 ZFC 片段上，从而消除了该证明依赖强于 ZFC 基础的表象。
We look at an old conjecture of A. Tarski on cardinal arithmetic and show that if a counterexample exists, then there exists one of length omega_1 + omega .
Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this paper, we investigate connections between variations of the Guessing Model Property and cardinal arithmetic, broadly construed. We improve upon results of Viale and Krueger by proving that a weakening of the Guessing Model Property implies Shelah's Strong Hypothesis. We also prove that, though the Guessing Model Property is known not to put an upper bound on the size of the continuum, it does imply that $2^{ω_1}$ is a…
In this paper we investigate some properties of first order theories which prevent them from having universal models under certain cardinal arithmetic assumptions. Our results give a new syntactical condition, oak property, which is a sufficient condition for a theory not to have universal models in cardinality lambda when certain cardinal arithmetic assumptions implying the failure of GCH (and close to the failure of SCH) hold.
We give an application of our extender based Radin forcing to cardinal arithmetic. Using a preparation forcing and interleaving of Cohen and Levy forcings in the normal Radin sequence we get a model with a power function having a fixed finite gap on all cardinals.
For cardinals lambda, kappa, theta we consider the class of graphs of cardinality lambda which has no subgraph which is (kappa, theta)-complete bipartite graph. The question is whether in such a class there is a universal one under (weak) embedding. We solve this problem completely under GCH. Under various assumptions mostly related to cardinal arithmetic we prove nonexistence of universals for this problem and some related ones.
We investigate pseudopowers of singular cardinals, and show that deduce some consequences for cardinal arithmetic. For example, we show that in {\sf ZFC} that $$\cov(μ,μ,θ,σ)=\cov(μ,μ,(\cfμ)^+,σ)+\cov(μ,μ,θ,σ^+)$$ whenever $\aleph_1\leqσ=\cf(σ)<\cf(μ)<θ<μ$, and use recent work of Gitik to show that both summands in the equation are required.
Force a set model of $Z_3$ + Harrington's Principle
本文在存在remarkable基数且其上有弱不可达基数的假设下，通过无需重塑的集合力迫方法，构造了满足三阶算术（$Z_3$）加Harrington原理（HP）的集合模型。
We show that some cardinal arithmetic configurations related to the negation of the Shelah Weak Hypothesis and natural from the forcing point of view are impossible.
We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all bounded X subset aleph_{|alpha|^+}, M_n^#(X) exists. Theorem B: Let kappa be a singular cardinal of uncountable cofinality. If {alpha<kappa| 2^alpha=alpha^+} is stationary as well as co-stationary then for all n< omega and for all bounded X subset kappa, M_n^#(X) exists. Theorem A answers a question of Gitik and Mitchell, and Theorem B yields a lower bound for an …
Under some cardinal arithmetic assumptions, we prove that every stationary subset of lambda of a right cofinality has the weak diamond. This is a strong negation of uniformization. We then deal with a weaker version of the weak diamond- colouring restrictions. We then deal with semi- saturated (normal) filters.
We prove that the statement "for every infinite cardinal nu, every graph with list chromatic nu has coloring number at most beth_omega (nu)" proved by Kojman [6] using the RGCH theorem [11] implies the RGCG theorem via a short forcing argument. Similarly, a better upper bound than beth_omega (nu) in this statement implies stronger forms of the RGCH theorem hold, whose consistency and the consistency of their negations are wide open. Thus, the optimality of Kojman's upper bound is a purely cardinal arithmetic problem, and, as discussed below, is hard to decide.
Using GCH, we force the following: There are continuum many simple cardinal characteristics with pairwise different values.
We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number of subalgebras is not smaller than the number of endomorphisms, and other related inequalities. Lastly we deal with the obtainment of the supremum of the cardinalities of sets of pairwise incomparable elements of a Boolean algebra.
We prove two general results about the preservation of extendible and $C^{(n)}$-extendible cardinals under a wide class of forcing iterations (Theorems 5.4 and 7.5). As applications we give new proofs of the preservation of Vopěnka's Principle and $C^{(n)}$-extendible cardinals under Jensen's iteration for forcing the GCH, previously obtained by Brooke-Taylor and Tsaprounis, res\-pectively. We prove that $C^{(n)}$-extendible cardinals are preserved by forcing with standard Easton-support iterations for any possible $Δ_2$-definable behaviour of the power-set function on regular cardinals. We sh…
Answering two questions of D. Fremlin [Real-valued measurable cardinals, in Set Theory of the Reals, H. Judah ed. 1993, 151-305 ] we show the following: (1) If c is real-valued measurable then the Maharam type of (c,P(c),sigma) is 2^c. (2) It is consistent to have k real-valued measurable but for every submodel V_1 with k measurable in it there are no k reals which are random over V_1.
We show that for $Π_2$-properties of second or third order arithmetic as formalized in appropriate natural signatures the apparently weaker notion of forcibility overlaps with the standard notion of consistency (assuming large cardinal axioms). Among such $Π_2$-properties we mention: the negation of the Continuum hypothesis, Souslin Hypothesis, the negation of Whitehead's conjecture on free groups, the non-existence of outer automorphisms for the Calkin algebra, etc... In particular this gives an a posteriori explanation of the success forcing (and forcing axioms) met in producing models of su…
We apply the recently developed technology of cofinality spectrum problems to prove a range of theorems in model theory. First, we prove that any model of Peano arithmetic is $λ$-saturated iff it has cofinality $\geq λ$ and the underlying order has no $(κ, κ)$-cuts for regular $κ< λ$. Second, assuming instances of GCH, we prove that $SOP_2$ characterizes maximality in the interpretability order $\trianglelefteq^*$, settling a prior conjecture and proving that $SOP_2$ is a real dividing line. Third, we establish the beginnings of a structure theory for $NSOP_2$, proving that $NSOP_2$ can be cha…
More separations of cardinal characteristics of the strong measure zero ideal
本文通过引入一种新的力迫性质，在有限支撑迭代后控制零测集理想的可加性，从而回答了 Brendle 等人提出的若干公开问题。
We extend prior results of Cody-Eskew, showing the consistency of GCH with the statement that for all regular cardinals $κ\leq λ$, where $κ$ is the successor of a regular cardinal, there is a rigid saturated ideal on $\mathcal{P}_κλ$. We also show the consistency of some instances of rigid saturated ideals on $\mathcal{P}_κλ$ where $κ$ is the successor of a singular cardinal.
Motivated by recent results and questions of D. Raghavan and S. Shelah, we present ZFC theorems on the bounding and various almost disjointness numbers, as well as on reaping and dominating families on uncountable, regular cardinals. We show that if $κ=λ^+$ for some $λ\geq ω$ and $\mathfrak b(κ)=κ^+$ then $\mathfrak a_e(κ)=\mathfrak a_p(κ)=κ^+$. If, additionally, $2^{<λ}=λ$ then $\mathfrak a_g(κ)=κ^+$ as well. Furthermore, we prove a variety of new bounds for $\mathfrak d(κ)$ in terms of $\mathfrak r(κ)$, including $\mathfrak d(κ)\leq \mathfrak r_σ(κ)\leq \mathrm{cof}([\mathfrak r(κ)]^ω)$, and…
The inner model problem for supercompact cardinals, one of the central open problems in modern set theory, asks whether there is a canonical model of set theory with a supercompact cardinal. The problem is closely related to the more precise question of the equiconsistency of strongly compact cardinals and supercompact cardinals. This dissertation approaches these two problems abstractly by introducing a principle called the Ultrapower Axiom which is expected to hold in all known canonical models of set theory. By investigating the consequences of the Ultrapower Axiom under the hypothesis that…
We establish a coloring theorem for successors of a singular cardinals, and use it prove that for any such cardinal $μ$, we have $μ^+\nrightarrow[μ^+]^2_{μ^+}$ if and only if $μ^+\nrightarrow[μ^+]^2_θ$ for arbitrarily large $θ<μ$.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。