arXiv math/95022331995-02-15math.LO

The pcf-theorem revisited

Saharon Shelah

发表信息：: Algorithms Combin. 14 (1997), 420-459

英文摘要：

The pcf theorem (of the possible cofinality theory) was proved for reduced products prod_{i< kappa} lambda_i/I, where kappa < min_{i< kappa} lambda_i. Here we prove this theorem under weaker assumptions such as wsat(I)< min_{i< kappa} lambda_i, where wsat(I) is the minimal theta such that kappa cannot be delivered to theta sets notin I (or even slightly weaker condition). We also look at the existence of exact upper bounds relative to <_I (<_I-eub) as well as cardinalities of reduced products and the cardinals T_D(lambda). Finally we apply this to the problem of the depth of ultraproducts (and reduced products) of Boolean algebras

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

PCF: The advanced PCF theorems

This is a revised version of Sh:430, section 6.

2015-12-22math.LO

The A,B,C of pcf: a companion to pcf theory, Part I

This is a survey paper of Shelah's pcf theory. In this part the theory is developed up to the pcf theorem.

1995-12-05math.LO

A Game-Semantic Model of Computation, Revisited: an Automata-Theoretic Perspective

In the previous work, we have given a novel, game-semantic model of computation in an intrinsic, non-inductive and non-axiomatic manner, which is similar to Turing machines but beyond computation on natural numbers, e.g., higher-order computation. As the main theorem of the work, it has been shown that the game-semantic model may execute all the computation of the programming language PCF. The present paper revisits this result from an automata-theoretic perspective: It shows that deterministic non-erasing pushdown automata whose input tape is equipped with simple directed edges between cells …

2019-12-14cs.LOmath.LO

Embedding Cohen algebras using pcf theory

Using a theorem from pcf theory, we show that for any singular cardinal nu, the product of the Cohen forcing notions on kappa, kappa < nu adds a generic for the Cohen forcing notion on nu^+. This solves Problem 5.1 in Miller's list (attributed to Rene David and Sy Friedman).

1995-08-15math.LO

Pcf theory and Woodin cardinals

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 …

2002-11-27math.LO

Lower bounds on coloring numbers from hardness hypotheses in PCF theory

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.

2022-01-27math.LO

更多相关论文收起更多论文

An Extension of Shelah's Trichotomy Theorem

In Sh506, Shelah develops the theory of $\mathrm{pcf}_I(A)$ without the assumption that $|A|<\min (A)$, going so far as to get generators for every $λ\in\mathrm{pcf}_I(A)$ under some assumptions on $I$. Our main theorem is that we can also generalize Shelah's trichotomy theorem to the same setting. Using this, we present a different proof of the existence of generators for $\mathrm{pcf}_I(A)$ which is more in line with the modern exposition. Finally, we discuss some obstacles to further generalizing the classical theory.

2019-04-04math.LO

Representability and Compactness for Pseudopowers

We prove a compactness theorem for pseudopower operations of the form $pp_{Γ(μ,σ)}(μ)$ where $\aleph_0<σ=cf(σ)\leq cf(μ)$. Our main tool is a result that has Shelah's cov vs. pp Theorem as a consequence. We also show that the failure of compactness in other situations has significant consequences for pcf theory, in particular, implying the existence of a progressive set $A$ of regular cardinals for which $pcf(A)$ has an inaccessible accumulation point.

2019-06-21math.LO

The coloring existence theorem revisited

We prove a better coloring theorem for aleph_4 and even aleph_3. This has a general topology consequence.

2019-01-28math.LO

An unpublished theorem of Solovay, revisited

A definable pair of disjoint non-OD sets of reals (hence, indiscernible sets) exists in the Sacks and $E_0$-large generic extensions of the constructible universe $L$.

2020-02-18math.LO

Mitchell's Theorem Revisited

Mitchell's theorem on the approachability ideal states that it is consistent relative to a greatly Mahlo cardinal that there is no stationary subset of $ω_2 \cap \mathrm{cof}(ω_1)$ in the approachability ideal $I[ω_2]$. In this paper we give a new proof of Mitchell's theorem, deriving it from an abstract framework of side condition methods.

2016-11-08math.LO

Compactness in singular cardinals revisited

This is the second combinatorial proof of the compactness theorem for singular from 1977. In fact it gives a somewhat stronger theorem.

2019-01-28math.LO

Conditional probabilities and van Lambalgen theorem revisited

The definition of conditional probability in case of continuous distributions was an important step in the development of mathematical theory of probabilities. How can we define this notion in algorithmic probability theory? In this survey we discuss the developments in this direction trying to explain what are the difficulties and what can be done to avoid them. Almost all the results discussed in this paper have been published (and we provide the references), but we tried to put them into perspective and to explain the proofs in a more intuitive way. We assume that the reader is familiar wit…

2016-07-14math.LO

Postponement of raa and Glivenko's theorem, revisited (extended version)

This article focuses on the technique of postponing the application of the reduction ad absurdum rule (raa) in classical natural deduction. First, it is shown how this technique is connected with two normalization strategies for classical logic: one given by Prawitz, and the other by Seldin. Secondly, a variant of Seldin's strategy for the postponement of raa is proposed, and the similarities with Prawitz's approach are investigated. In particular, it is shown that, as for Prawitz, it is possible to use this variant of Seldin's strategy in order to induce a negative translation from classical …

2017-10-25math.LO

哥德尔不完备定理与反机械论论证：再探讨

Gödel's incompleteness theorem and the Anti-Mechanist Argument: revisited

本文为纪念Krajewski相关论文的特刊而作，补充阐释其基于哥德尔不完备定理的反机械论论证研究，归类相关误解，结合近期进展深入讨论哥德尔析取论题等三个核心问题。

2020-08-05math.LO

Hahn-Banach定理可计算性再探讨

Computability of the Hahn-Banach Theorem Revisited

Universität der Bundeswehr München（德国联邦国防军大学）；University of Cape Town（开普敦大学）

本文研究了Hahn-Banach定理的计算性质，证明其在Banach空间ℓ¹中已达到最大复杂性，并将其与中间值定理及弱Kőnig引理等数学原理建立等价关系。

2026-03-17cs.LOmath.LO

Gács-Kučera's Theorem Revisited by Levin

Leonid Levin (arxiv.org/abs/cs/0503039v14, p.7) published a new (and very nice) proof of Gács-Kučera's theorem that occupies only a few lines when presented in his style. We try to explain more details and discuss the connection of this proof with image randomness theorems, making explicit some result (see Proposition 4) that is implicit in Levin's exposition. Then we review the previous work about the oracle use when reducing a given sequence to another one, and its connection with algorithmic dimension theory.

2023-01-25cs.ITmath.ITmath.LO

有限自由群的近似 II：Ash、Herwig-Lascar 和 Ribes-Zalesskii 定理的重新审视与加强

Finite approximation of free groups II: the Theorems of Ash, Herwig-Lascar and Ribes-Zalesskii -- revisited and strengthened

Fakultät für Mathematik, Universität Wien（维也纳大学数学学院）；Department of Mathematics, Technische Universität Darmstadt（达姆施塔特工业大学数学系）

本文重新审视并加强了 Ash、Herwig-Lascar 和 Ribes-Zalesskii 定理，证明它们在意义上等价，并展示了这些定理的加强版本比经典结果更强大。

2026-08-25math.COmath.GRmath.LO