English
Related papers

Related papers: Suslin trees, the bounding number, and partition r…

200 papers

Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…

Logic · Mathematics 2026-05-07 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…

Logic · Mathematics 2016-09-06 Saharon Shelah

Working under large cardinal assumptions, we study the Borel-reducibility between equivalence relations modulo restrictions of the non-stationary ideal on some fixed cardinal $\kappa$. We show the consistency of…

Logic · Mathematics 2017-08-10 David Asperó , Tapani Hyttinen , Vadim Kulikov , Miguel Moreno

We generalize to the relations $(\lambda, \mu) \stackrel{\kappa}{\Rightarrow} (\lambda', \mu')$ and $\alm (\lambda, \mu) \stackrel{\kappa}{\Rightarrow} \alm (\lambda', \mu')$ some results obtained in Parts II and IV. We also present a…

Logic · Mathematics 2009-03-30 Paolo Lipparini

Our goal is to study the pseudo-intersection and tower numbers on uncountable regular cardinals, whether these two cardinal characteristics are necessarily equal, and related problems on the existence of gaps. First, we prove that either…

In this paper we analyze the connection between some properties of partially strongly compact cardinals: the completion of filters of certain size and instances of the compactness of $\mathcal{L}_{\kappa,\kappa}$. Using this equivalence we…

Logic · Mathematics 2018-09-18 Yair Hayut

For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…

Logic · Mathematics 2026-05-14 Mohammad Golshani , Grigorii Stepanov , Reihane Zoghifard

An inaccessible cardinal $\kappa$ is supercompact when $(\kappa, \lambda)$-ITP holds for all $\lambda\geq \kappa.$ We prove that if there is a model of $\ZFC$ with two supercompact cardinals, then there is a model of \ZFC where…

Logic · Mathematics 2011-12-15 Laura Fontanella

We prove the consistency of a singular cardinal $\lambda$ with small value of the ultrafilter number $u_\lambda$, and arbitrarily large value of $2^\lambda$.

Logic · Mathematics 2012-11-09 Shimon Garti , Saharon Shelah

Let C denote any of the following cardinal characteristics of Boolean algebras: incomparability, spread, character, pi-character, hereditary Lindelof number, hereditary density. It is shown to be consistent that there exists a sequence…

Logic · Mathematics 2007-05-23 Saharon Shelah , Otmar Spinas

Let omega be the first infinite ordinal (or the set of all natural numbers) with the usual order <. In section 1 we show that, assuming the consistency of a supercompact cardinal, there may exist an ultrapower of omega, whose cardinality is…

Logic · Mathematics 2009-09-25 Renling Jin , Saharon Shelah

Billey et al. [arXiv:1507.04976] have recently discovered a surprisingly simple formula for the number $a_n(\sigma)$ of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) with $n\geq 1$ leaves, fixed (for the…

Combinatorics · Mathematics 2016-03-08 Éric Fusy

We study the influence of the existence of large cardinals on the existence of wellorderings of power sets of infinite cardinals $\kappa$ with the property that the collection of all initial segments of the wellordering is definable by a…

Logic · Mathematics 2017-04-04 Philipp Lücke , Philipp Schlicht

A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…

Logic · Mathematics 2023-10-31 Miloš S. Kurilić

For a graph consider the pairs of disjoint matchings which union contains as many edges as possible, and define a parameter $\alpha$ which eqauls the cardinality of the largest matching in those pairs. Also, define $\betta$ to be the…

Discrete Mathematics · Computer Science 2009-09-29 R. R. Kamalian , V. V. Mkrtchyan

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

Logic · Mathematics 2007-05-23 Saharon Shelah

A study is carried out of the elementary theory of quotients of symmetric groups in a similar spirit to [Sh:24]. Apart from the trivial and alternating subgroups, the normal subgroups of the full symmetric group S(mu) on an infinite…

Logic · Mathematics 2009-09-25 John Truss , Saharon Shelah

We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…

Logic · Mathematics 2026-05-05 Radek Honzik

We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than $\omega_1$ and $-\omega_1$, answering a question of J. Baumgartner. This is done by a Jensen-type iteration,…

Logic · Mathematics 2018-03-13 Dániel T. Soukup

We give two results on guessing unbounded subsets of lambda^+. The first is a positive result and applies to the situation of lambda regular and at least equal to aleph_3, while the second is a negative consistency result which applies to…

Logic · Mathematics 2007-05-23 Mirna Džamonja , Saharon Shelah
‹ Prev 1 3 4 5 6 7 10 Next ›