English
Related papers

Related papers: Cicho\'n's maximum

200 papers

The collection of branches (maximal linearly ordered sets of nodes) of the tree ${}^{<\omega}\omega$ (ordered by inclusion) forms an almost disjoint family (of sets of nodes). This family is not maximal -- for example, any level of the tree…

Logic · Mathematics 2009-09-25 Thomas E. Leathrum

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 give a combinatorial characterization of countable submaximal subspaces of $2^\kappa$. Using a parametrized version of Mathias forcing, we prove that there exists a countable submaximal subspace of $2^{\omega_1}$ whilst…

General Topology · Mathematics 2021-12-08 César Corral

Let P be a distinguished unary predicate and K= {M: M a model of cardinality aleph_n with P^M of cardinality aleph_0}. We prove that consistently for n=4, for some countable first order theory T we have: T has no model in K whereas every…

Logic · Mathematics 2007-05-23 Saharon Shelah

For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum matching and the largest matching in those pairs. It is…

Discrete Mathematics · Computer Science 2009-03-03 A. V. Tserunyan

The following results are proved: (a) In a model obtained by adding aleph_2 Cohen reals, there is always a c.c.c. complete Boolean algebra without the weak Freese-Nation property. (b) Modulo the consistency strength of a supercompact…

Logic · Mathematics 2007-05-23 Sakaé Fuchino , Stefan Geschke , Saharon Shelah , Lajos Soukup

For bipartite graphs the NP-completeness is proved for the problem of existence of maximum matching which removal leads to a graph with given lower(upper)bound for the cardinality of its maximum matching.

Discrete Mathematics · Computer Science 2008-03-08 R. R. Kamalian , V. V. Mkrtchyan

We show, assuming the consistency of one measurable cardinal, that it is consistent for there to be exactly kappa+ many normal measures on the least measurable cardinal kappa. This answers a question of Stewart Baldwin. The methods…

Logic · Mathematics 2007-05-23 Arthur W. Apter , James Cummings , Joel David Hamkins

An abelian group is said to be aleph_1-free if all its countable subgroups are free. Our main result is: If R is a ring with R^+ free and |R|<lambda <= 2^{aleph_0}, then there exists an aleph_1-free abelian group G of cardinality lambda…

Logic · Mathematics 2007-05-23 Rüdiger Göbel , Saharon Shelah

Jech proved that every partially ordered set can be embedded into the cardinals of some model of $ZF$. We extend this result to show that every partially ordered set can be embedded into the cardinals of some model of $ZF+DC_{<\kappa}$ for…

Logic · Mathematics 2014-06-17 Asaf Karagila

We introduce the notion of weakly extendible cardinals and show that these cardinals are characterized in terms of weak compactness of second order logic. The consistency strength and largeness of weakly extendible cardinals are located…

Logic · Mathematics 2023-01-06 Sakaé Fuchino , Hiroshi Sakai

For a regular cardinal $\kappa$, a formula of the modal $\mu$-calculus is $\kappa$-continuous in a variable x if, on every model, its interpretation as a unary function of x is monotone and preserves unions of $\kappa$-directed sets. We…

Logic in Computer Science · Computer Science 2023-06-22 Maria João Gouveia , Luigi Santocanale

We study the generalized dominating number $\mathfrak{d}_{\mu}$ at a singular cardinal $\mu$ of cofinality $\kappa$. We show two lower bounds: in ZFC, $\mathrm{cf}([\mu]^\kappa,\subseteq) \leq \mathfrak{d}_{\mu}$, and under mild…

Logic · Mathematics 2025-08-19 Yusuke Hayashi

For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…

Combinatorics · Mathematics 2022-12-06 Jie Ma , Tianchi Yang

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…

Logic · Mathematics 2016-09-06 Moti Gitik , William Mitchell

For a given positive integer t we consider graphs having maximal independent sets of precisely t distinct cardinalities and restrict our attention to those that have no vertices of degree one. In the situation when t is four or larger and…

Combinatorics · Mathematics 2011-10-20 Bert L. Hartnell , Douglas F. Rall

We introduce a natural generalization of Borel's Conjecture. For each infinite cardinal number $\kappa$, let {\sf BC}$_{\kappa}$ denote this generalization. Then ${\sf BC}_{\aleph_0}$ is equivalent to the classical Borel conjecture.…

Logic · Mathematics 2012-07-06 Fred Galvin , Marion Scheepers

We prove that, e.g., if mu >cf(mu)= aleph_0 and mu>2^{aleph_0} and every stationary family of countable subsets of mu^+ reflect in some subset of mu^+ of cardinality aleph_1, then the SCH for mu^+ (moreover, for mu^+, any scale for mu^+ has…

Logic · Mathematics 2007-09-30 Saharon Shelah

An elegant but elementary result of Wolff from 1921, when interpreted in terms of Banach algebras, shows that it is possible to find a sequence of distinct characters $\phi_n$ on the disc algebra and an $\ell_1$ sequence of complex numbers…

Functional Analysis · Mathematics 2014-12-25 J. F. Feinstein

We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of…

Logic · Mathematics 2022-09-07 Saharon Shelah
‹ Prev 1 8 9 10 Next ›