English
Related papers

Related papers: Piece selection and cardinal arithmetic

200 papers

In this note we answer the following question of Grinblat: Is it consistent that for some set X, cov(NULL restriction X)=lambda is a weakly inaccessible cardinal (so X not null of course) while cov(meagre) is small, say it is aleph_1.

Logic · Mathematics 2007-05-23 Saharon Shelah

We introduce a simple extension of the $\lambda$-calculus with pairs---called the distributive $\lambda$-calculus---obtained by adding a computational interpretation of the valid distributivity isomorphism $A \Rightarrow (B\wedge C)\ \…

Logic in Computer Science · Computer Science 2020-10-23 Beniamino Accattoli , Alejandro Díaz-Caro

We prove two $\mathrm{ZFC}$ inequalities between cardinal invariants. The first inequality involves cardinal invariants associated with an analytic P-ideal, in particular the ideal of subsets of $\omega$ of asymptotic density $0$. We obtain…

Logic · Mathematics 2015-05-26 Dilip Raghavan , Saharon Shelah

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

Logic · Mathematics 2016-01-15 Saharon Shelah

The main result of this paper is to show that, if $\kappa$ is the smallest real-valued measurable cardinal not greater than $ 2^{\aleph_0}$, then there exists a complete metric space of cardinality not greater than $ 2^{\kappa}$ admitting a…

Logic · Mathematics 2020-12-22 Ryszard Frankiewicz , Joanna Jureczko

We continue the study of computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a…

Logic · Mathematics 2020-09-03 Nikolay Bazhenov , Stefan Vatev

We prove a theorem on iterated forcing that can be used for preservation of $\aleph_2$ and $\aleph_1$ in iterations with supports of size $\aleph_1$ of forcings that have amalgamation properties similar to those present in the perfect set…

Logic · Mathematics 2026-03-24 Mirna Džamonja

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,…

Logic · Mathematics 2016-09-07 Saharon Shelah

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

Logic · Mathematics 2026-03-19 Saharon Shelah

We point out a gap in Shelah's proof of the following result: $\mathbf{Claim}$ Let $K$ be an abstract elementary class categorical in unboundedly many cardinals. Then there exists a cardinal $\lambda$ such that whenever $M, N \in K$ have…

Logic · Mathematics 2015-10-19 Will Boney , Sebastien Vasey

Let $G$, $H$ be groups and $\kappa$ be a cardinal. A bijection $f:G\to H$ is caled on asymorphism if, for any $X\in[G]^{<\kappa}$, $Y\in[H]^{<\kappa}$, there exist $X'\in[G]^{<\kappa}$, $Y'\in[H]^{<\kappa}$ such that for all $x\in G$ and…

Group Theory · Mathematics 2016-03-01 Igor Protasov , Serhii Slobodianiuk

This is part I of a study on cardinals that are characterizable by Scott sentences. Building on [3], [6] and [1] we study which cardinals are characterizable by a Scott sentence $\phi$, in the sense that $\phi$ characterizes $\kappa$, if…

Logic · Mathematics 2016-02-10 Ioannis Souldatos

For $\kappa$ a regular uncountable cardinal, the higher Baire and Cantor spaces ${}^\kappa\kappa$ and ${}^\kappa2$ (endowed with the ${<}\kappa$-box topology) have been relatively well-studied, but less is known about the case where…

Logic · Mathematics 2026-05-12 Yusuke Hayashi , Tristan van der Vlugt

Working in the context of restricted forms of the Axiom of Choice, we consider the problem of splitting the ordinals below $\lambda$ of cofinality $\theta$ into $\lambda$ many stationary sets, where $\theta < \lambda$ are regular cardinals.…

Logic · Mathematics 2010-03-15 Paul Larson , Saharon Shelah

Motivated by two open questions about two-cardinal tree properties, we introduce and study generalized narrow system properties. The first of these questions asks whether the strong tree property at a regular cardinal $\kappa \geq \omega_2$…

Logic · Mathematics 2023-04-06 Chris Lambie-Hanson

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…

Logic · Mathematics 2016-09-07 Bradd Hart , Ehud Hrushovski , Michael C. Laskowski

We use Shelah's theory of possible cofinalities in order to solve a problem about ultrafilters. THEOREM. Suppose that $ \lambda $ is a singular cardinal, $ \lambda ' < \lambda $, and the ultrafilter $D$ is $ \kappa $-decomposable for all…

Logic · Mathematics 2009-04-05 Paolo Lipparini

We prove the consistency of the following statement: for some kappa<2^{aleph_0}, there is a kappa-complete ideal on kappa such that the Boolean algebra P(kappa)/I is sigma-centered and there are Q-sets of reals.

Logic · Mathematics 2007-05-23 Saharon Shelah

We give Woodin's original proof that if there exists a $(\kappa+2)-$strong cardinal $\kappa,$ then there is a generic extension of the universe in which $\kappa=\aleph_\omega,$ $GCH$ holds below $\aleph_\omega$ and…

Logic · Mathematics 2016-01-19 Mohammad Golshani

We prove that in the product of kappa many Boolean algebras we cannot find an independent set of more than 2^kappa elements solving a problem of Monk (earlier it was known that we cannot find more than 2^{2^kappa} but can find 2^kappa).

Logic · Mathematics 2016-09-06 Saharon Shelah