English
Related papers

Related papers: Specializing trees and answer to a question of Wil…

200 papers

We give an affirmative answer to a conjecture proposed by Tevelev in characteristic 0 case: any variety contains a sch\"on very affine open subvariety. Also we show that any fan supported on the tropicalization of a sch\"on very affine…

Algebraic Geometry · Mathematics 2009-02-13 Mark Luxton , Zhenhua Qu

We prove that successors of singular limits of strongly compact cardinals have the strong tree property. We also prove that aleph_{omega+1} can consistently satisfy the strong tree property.

Logic · Mathematics 2013-01-28 Laura Fontanella

We show that $\mathsf{PFA}$ implies that the tightness $t(X_\delta)$ of the $G_\delta$-modification of a Fr\'echet $\alpha_1$-space $X$ is at most $\omega_1$, while $\Box(\kappa)$ implies that there is a Fr\'echet $\alpha_1$-space with…

General Topology · Mathematics 2019-10-24 William Chen-Mertens , Paul J. Szeptycki

Assume $\lambda$ is a singular limit of $\eta$ supercompact cardinals, where $\eta \leq \lambda$ is a limit ordinal. We present two forcing methods for making $\lambda^+$ the successor of the limit of the first $\eta$ measurable cardinals…

Logic · Mathematics 2016-10-19 Mohammad Golshani

We present natural constructions of trees and gaps using a quite general construction scheme. In particular, we solve a natural problem about $(\omega_1, \omega_1)$-gaps. As it is well known $(\omega_1, \omega_1)$-gaps can sometimes be…

Logic · Mathematics 2016-08-16 Fulgencio Lopez , Stevo Todorcevic

Larman showed that any closed subset of the plane with uncountable vertical cross-sections has aleph_1 disjoint Borel uniformizing sets. Here we show that Larman's result is best possible: there exist closed sets with uncountable…

Logic · Mathematics 2021-02-09 Howard Becker , Randall Dougherty

Consider the following heuristic for building a decision tree for a function $f : \{0,1\}^n \to \{\pm 1\}$. Place the most influential variable $x_i$ of $f$ at the root, and recurse on the subfunctions $f_{x_i=0}$ and $f_{x_i=1}$ on the…

Data Structures and Algorithms · Computer Science 2019-11-19 Guy Blanc , Jane Lange , Li-Yang Tan

From many supercompact cardinals, we show that it is consistent for the tree property to hold at many small successors of singular cardinals, each with a different cofinality. In particular, we construct a model in which the tree property…

Logic · Mathematics 2025-02-05 William Adkisson

A classical problem, raised by Fuchs in 1960, asks to classify the abelian groups which are groups of units of some rings. In this paper, we consider the case of finitely generated abelian groups, solving Fuchs' problem for such group with…

Commutative Algebra · Mathematics 2024-06-04 I. Del Corso , L. Stefanello

This paper presents the main results in my Ph.D. thesis. In what follows several proofs of SCH are presented introducing a family of covering properties which implies both SCH and the failure of various forms of square. These covering…

Logic · Mathematics 2007-05-23 Matteo Viale

Strong reflection principles with the reflection cardinal $\leq\aleph_1$ or $<2^{\aleph_0}$ imply that the size of the continuum is either $\aleph_1$ or $\aleph_2$ or very large. Thus, the stipulation, that a strong reflection principle…

Logic · Mathematics 2020-09-08 Sakaé Fuchino , André Ottenbreit Maschio Rodrigues

Smallish large cardinals $\kappa$ are often characterized by the existence of a collection of filters on $\kappa$, each of which is an ultrafilter on the subsets of $\kappa$ of some transitive $\mathrm{ZFC}^-$-model of size $ \kappa$. We…

Logic · Mathematics 2021-05-14 Erin Carmody , Victoria Gitman , Miha E. Habič

By forcing with $\mathbb{P}_{\rm max}$ over strong models of determinacy, we obtain models where different square principles at $\omega_2$ and $\omega_3$ fail. In particular, we obtain a model of $2^{\aleph_0}=2^{\aleph_1}=\aleph_2 +…

We give some sufficient and necessary conditions on a forcing notion Q for preserving the forcing notion ([omega]^{aleph_0},supseteq^*) is proper. They cover many reasonable forcing notions.

Logic · Mathematics 2018-01-16 Saharon Shelah

We construct a model in which the tree property holds in $\aleph_{\omega + 1}$ and it is destructible under $\text{Col}(\omega, \omega_1)$. On the other hand we discuss some cases in which the tree property is indestructible under small or…

Logic · Mathematics 2019-04-30 Yair Hayut , Menachem Magidor

The class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the…

We construct a generic extension in which the aleph_2 nd canonical function on aleph_1 exists.

Logic · Mathematics 2009-09-25 Thomas Jech , Saharon Shelah

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any…

Combinatorics · Mathematics 2024-12-18 Aldo Kiem , Olaf Parczyk , Christoph Spiegel

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

It is consistent that \[ \aleph_1 < \mathrm{add}(\mathrm{Null}) < \mathrm{add}(\mathrm{Meager})= \mathfrak{b} < \mathrm{cov}(\mathrm{Null}) < \mathrm{non}(\mathrm{Meager}) < \mathrm{cov}(\mathrm{Meager}) = 2^{\aleph_0}. \] Assuming four…

Logic · Mathematics 2020-01-27 Jakob Kellner , Saharon Shelah , Anda Ramona Tanasie
‹ Prev 1 8 9 10 Next ›