中文
相关论文

相关论文: Universal Graphs at $\aleph_{\omega_1+1}$ and Set-…

200 篇论文

Starting from a supercompact cardinal we build a model in which $2^{\aleph_{\omega_1}}=2^{\aleph_{\omega_1+1}}=\aleph_{\omega_1+3}$ but there is a jointly universal family of size $\aleph_{\omega_1+2}$ of graphs on $\aleph_{\omega_1+1}$.…

逻辑 · 数学 2016-05-03 Jacob Davis

Vladimir Kanovei \cite{zbMATH01335192} developed the technique of geometric iteration and used it to prove that the perfect set forcing can be iterated with countable supports along any partial order, while preserving $\aleph_1$. In…

逻辑 · 数学 2026-04-14 Mirna Džamonja

We prove that it is consistent that $\aleph_\omega$ is strong limit, $2^{\aleph_\omega}$ is large and the universality number for graphs on $\aleph_{\omega+1}$ is small. The proof uses Prikry forcing with interleaved collapsing.

逻辑 · 数学 2014-08-20 James Cummings , Mirna Džamonja , Charles Morgan

Let $\Gamma^\infty$ be the set of all universally Baire sets of reals. Inspired by recent work of the second author and Nam Trang, we introduce a new technique for establishing generic absoluteness results for models containing…

逻辑 · 数学 2025-04-16 Sandra Müller , Grigor Sargsyan

The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…

逻辑 · 数学 2026-03-16 Curial Gallart

This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…

逻辑 · 数学 2020-08-12 Corey Bacal Switzer

We study the existence and cardinality of universal families for classes of rayless graphs. It is known, by a result of Diestel, Halin, and Vogler, that the class of countable rayless graphs does not admit a countable universal family,…

组合数学 · 数学 2025-12-18 Leandro Fiorini Aurichi , Guilherme Eduardo Pinto

The paper is concerned with the existence of a universal graph at the successor of a strong limit singular mu of cofinality aleph_0. Starting from the assumption of the existence of a supercompact cardinal, a model is built in which for…

逻辑 · 数学 2007-05-23 Mirna Džamonja , Saharon Shelah

We present a direct construction of stationary set preserving forcings that make $\omega$-cofinal all the members of some arbitrary set $\mathcal{K}$ of regular cardinals $\kappa > \omega_1$. In addition, it is made possible to ensure that…

逻辑 · 数学 2025-10-29 Ben De Bondt , Boban Velickovic

We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

逻辑 · 数学 2013-06-25 Saharon Shelah

In a classical paper by Ben-David and Magidor, a model of set theory was exhibited in which $\aleph_{\omega+1}$ carries a uniform ultrafilter that is $\theta$-indecomposable for every uncountable cardinal $\theta<\aleph_\omega$. In this…

逻辑 · 数学 2025-12-18 Sittinon Jirattikansakul , Inbar Oren , Assaf Rinot

Starting from the $\rm{GCH},$ we build a cardinal and $\rm{GCH}$ preserving generic extension of the universe, in which there exists a set $A \subseteq \omega_2$ of size $\aleph_2$ so that every countably infinite subset of $A$ or $\omega_2…

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…

组合数学 · 数学 2021-12-07 G. Arunkumar , Peter J. Cameron , Rajat Kanti Nath , Lavanya Selvaganesh

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

逻辑 · 数学 2026-03-19 Saharon Shelah

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

逻辑 · 数学 2023-01-02 Daisuke Ikegami , Philipp Schlicht

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…

逻辑 · 数学 2016-01-19 Mohammad Golshani

We show: There are pairs of universes V_1 subseteq V_2 and there is a notion of forcing P in V_1 such that the change mentioned in the title occurs when going from V_1[G] to V_2[G] for a P-generic filter G over V_2. We use forcing…

逻辑 · 数学 2007-05-23 Heike Mildenberger , Saharon Shelah

In this work we will study the universal labeling algebra A(Gamma), a related algebra B(Gamma), and their behavior as invariants of layered graphs. We will introduce the notion of an upper vertex-like basis, which allows us to recover…

环与代数 · 数学 2013-12-17 Susan Durst

Motivated by the goal of constructing a model in which there are no $\kappa$-Aronszajn trees for any regular $\kappa>\aleph_1$, we produce a model with many singular cardinals where both the singular cardinals hypothesis and weak square…

逻辑 · 数学 2020-05-22 Omer Ben-Neria , Chris Lambie-Hanson , Spencer Unger
‹ 上一页 1 2 3 10 下一页 ›