中文
相关论文

相关论文: The pcf-theorem revisited

200 篇论文

We deal with several pcf problems; we characterize another version of exponentiation: number of kappa-branches in a tree with lambda nodes, deal with existence of independent sets in stable theories, possible cardinality of ultraproduct,…

逻辑 · 数学 2016-09-07 Saharon Shelah

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…

逻辑 · 数学 2016-09-06 Saharon Shelah

The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing…

逻辑 · 数学 2013-07-24 Moti Gitik , Saharon Shelah

Suppose $\kappa$ is a regular cardinal and $\bar a=\langle \mu_i: i<\kappa \rangle$ is a non-decreasing sequence of regular cardinals. We study the set of possible cofinalities of cuts Pcut$(\bar a)=\{(\lambda_1, \lambda_2):$ for some…

逻辑 · 数学 2025-01-20 Mohammad Golshani

We prove the consistency of irr(prod limits_{i<kappa}B_i/D)< prod limits_{i<kappa}irr(B_i)/D, where D is an ultrafilter on kappa and each B_i is a Boolean Algebra. This solves the last problem of this form from the Monk's list of problems,…

逻辑 · 数学 2007-05-23 Saharon Shelah

We show a new proof for the fact that when $\kappa$ and $\lambda$ are infinite cardinals satisfying $\lambda ^ \kappa = \lambda$, the cofinality of the set of all functions from $\lambda$ to $\kappa$ ordered by everywhere domination is…

逻辑 · 数学 2014-05-06 Dan Hathaway

$\mathop{\rm rp}\nolimits ({\mathbb B})$ denotes the reduced power ${\mathbb B}^\omega /\Phi$ of a Boolean algebra ${\mathbb B}$, where $\Phi$ is the Fr\'{e}chet filter $\Phi$ on $\omega$. We investigate iterated reduced powers…

逻辑 · 数学 2024-03-27 Miloš S. Kurilić

We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show…

逻辑 · 数学 2009-09-25 Saharon Shelah

We characterize the situation of small cardinality for a product of cardinals divided by an ultrafilter. We develop the notion of weak normality. We include an application to Boolean Algebras.

逻辑 · 数学 2018-04-24 Shimon Garti , 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),…

逻辑 · 数学 2007-05-23 Saharon Shelah

We address a number of problems on Boolean Algebras. For example, we construct, in ZFC, for any BA B, and cardinal kappa BAs B_1,B_2 extending B such that the depth of the free product of B_1,B_2 over B is strictly larger than the depths of…

逻辑 · 数学 2016-09-06 Saharon Shelah

A classical theorem of Malykhin says that if $\{X_\alpha:\alpha\leq\kappa\}$ is a family of compact spaces such that $t(X_\alpha)\leq \kappa$, for every $\alpha\leq\kappa$, then $t\left( \prod_{\alpha\leq \kappa} X_\alpha \right)\leq…

一般拓扑 · 数学 2023-07-14 Mikołaj Krupski

This paper makes significant progress towards resolving a conjecture relating strong forcing axioms like $PFA$ and the derived model at a limit of Woodin cardinals $\kappa$. In particular, using a concept called Covering Matrices, we show…

逻辑 · 数学 2026-02-20 Derek Levinson , Nam Trang , Trevor Wilson

Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…

逻辑 · 数学 2016-09-07 Bradd Hart , Ehud Hrushovski , Michael C. Laskowski

The original theme of the paper is the existence proof of ``there is < eta_alpha : alpha < lambda > which is a (lambda,J)-sequence for < I_i:i<delta >, a sequence of ideals. This can be thought of as in a generalization to Luzin sets and…

逻辑 · 数学 2016-09-07 Saharon Shelah

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…

逻辑 · 数学 2014-11-11 Moti Gitik , Ralf Schindler , Saharon Shelah

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…

逻辑 · 数学 2008-02-03 Saharon Shelah

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 $\kappa$ is a singular strong limit cardinal and…

逻辑 · 数学 2016-09-06 Moti Gitik , William Mitchell

We prove a compactness theorem for pseudopower operations of the form $pp_{\Gamma(\mu,\sigma)}(\mu)$ where $\aleph_0<\sigma=cf(\sigma)\leq cf(\mu)$. Our main tool is a result that has Shelah's cov vs. pp Theorem as a consequence. We also…

逻辑 · 数学 2019-06-25 Todd Eisworth

A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating…

计算机科学中的逻辑 · 计算机科学 2013-04-01 Antonio Bucciarelli , Alberto Carraro , Antonino Salibra
‹ 上一页 1 2 3 10 下一页 ›