English
Related papers

Related papers: More Constructions for Boolean algebras

200 papers

If cf(kappa) = kappa, kappa^+< cf(lambda) = \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…

Logic · Mathematics 2008-06-03 Saharon Shelah

Suppose lambda is a singular cardinal of uncountable cofinality kappa. For a model M of cardinality lambda, let No(M) denote the number of isomorphism types of models N of cardinality lambda which are L_{infty lambda}-equivalent to M. In…

Logic · Mathematics 2016-09-07 Saharon Shelah , Pauli Väisänen

$\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…

Logic · Mathematics 2024-03-27 Miloš S. Kurilić

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

Logic · Mathematics 2009-09-25 Saharon Shelah

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

Let T be the family of open subsets of a topological space (not necessarily Hausdorff or even T_0). We prove that if T has a base of cardinality <= mu, lambda <= mu < 2^lambda, lambda strong limit of cofinality aleph_0, then T has…

Logic · Mathematics 2016-09-06 Saharon Shelah

Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We…

Logic · Mathematics 2012-08-14 M. Malliaris , S. Shelah

Let inv denote the cardinal invariants Depth^+ and Length^+ on Boolean algebras. For many singular cardinals we create a strict inequality between the product of the inv values and the inv of the product algebra. The proof holds in ZFC.

Rings and Algebras · Mathematics 2020-01-01 Shimon Garti , Saharon Shelah

Assuming 0^sharp does not exist, kappa is an uncountable cardinal and for all cardinals lambda with kappa <= lambda < kappa^{+ omega}, 2^lambda = lambda^+, we present a ``mini-coding'' between kappa and kappa^{+ omega}. This allows us to…

Logic · Mathematics 2016-09-06 Saharon Shelah , Lee Stanley

We prove that for every singular cardinal mu of cofinality omega, the complete Boolean algebra compP_mu(mu) contains as a complete subalgebra an isomorphic copy of the collapse algebra Comp Col(omega_1,mu^{aleph_0}). Consequently, adding a…

Logic · Mathematics 2007-05-23 Menachem Kojman , Saharon Shelah

We construct Boolean Algebras answering questions of Monk on cardinal invariants. The results are proved in ZFC (rather than giving consistency results). We deal with the existence of superatomic Boolean Algebras with ``few automorphisms'',…

Logic · Mathematics 2007-05-23 Saharon Shelah

Suppose that lambda = mu^+. We consider two aspects of the square property on subsets of lambda. First, we have results which show e.g. that for aleph_0 <= kappa =cf (kappa)< mu, the equality cf([mu]^{<= kappa}, subseteq)= mu is a…

Logic · Mathematics 2016-09-06 Mirna Džamonja , 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…

Logic · Mathematics 2014-05-06 Dan Hathaway

We show in ZFC, that the depth of ultraproducts of Boolean Algebras may be bigger than the ultraproduct of the depth of those Boolean Algebras.

Logic · Mathematics 2007-05-23 Saharon Shelah

We give a simplified proof of a theorem of M. Rabus and S. Shelah claiming that for each cardinal mu there is a c.c.c Boolean algebra with topological density mu.

Logic · Mathematics 2007-05-23 Lajos Soukup

We investigate in ZFC what can be the family of large enough cardinals mu in which an a.e.c. K is categorical or even just solvable. We show that for not few cardinals lambda<mu there is a superlimit model in K_lambda. Moreover, our main…

Logic · Mathematics 2008-08-25 Saharon Shelah

If kappa is strongly compact, lambda > kappa is regular, then (2^{< lambda})^+ --> (lambda+eta)^2_theta holds for eta,theta<kappa.

Logic · Mathematics 2007-05-23 Saharon Shelah

We show that the Depth^+ of an ultraproduct of Boolean Algebras, can not jump over the Depth^+ of every component by more than one cardinality. We can have, consequently, similar results for the Depth invariant.

Logic · Mathematics 2018-02-06 Shimon Garti , Saharon Shelah

Given two infinite cardinals $\kappa$ and $\lambda$, we introduce and study the notion of a $\kappa$-barely independent family over $\lambda.$ We provide some conditions under which these types of families exist. In particular, we relate…

Logic · Mathematics 2025-07-24 Jorge Antonio Cruz Chapital

We compare the forcing related properties of a complete Boolean algebra B with the properties of the convergences $\lambda_s$ (the algebraic convergence) and $\lambda_{ls}$ on B generalizing the convergence on the Cantor and Aleksandrov…

General Topology · Mathematics 2018-09-27 Miloš S. Kurilić , Aleksandar Pavlović