中文
相关论文

相关论文: An almost Kurepa Suslin tree with strongly non-sat…

200 篇论文

The paper is devoted to a study of certain fixed point properties, and their relatives, in the context of full automorphism groups of countable rooted trees. Namely, we study Serre's property (FA'), also called unsplittability, property…

群论 · 数学 2011-10-21 Maciej Malicki

We answer a question from Raghavan and Stepr{\=a}ns' paper on weakly tight families by showing that $\mathfrak{s} = {\mathfrak{s}}_{\omega, \omega}$. Then we use this to construct a completely separable maximal almost disjoint family under…

逻辑 · 数学 2019-08-15 Heike Mildenberger , Dilip Raghavan , Juris Steprāns

We study the relationship between a $\kappa$-Souslin tree $T$ and its reduced powers $T^\theta/\mathcal U$. Previous works addressed this problem from the viewpoint of a single power $\theta$, whereas here, tools are developed for…

逻辑 · 数学 2018-11-28 Ari Meir Brodsky , Assaf Rinot

In this paper we aim to compare Kurepa trees and Aronszajn trees. Moreover, we analyze the affect of large cardinal assumptions on this comparison. Using the the method of walks on ordinals, we will show it is consistent with ZFC that there…

逻辑 · 数学 2023-10-10 Hossein Lamei Ramandi , Stevo Todorcevic

In this paper we investigate the problem of the distributivity of Kurepa trees. We show that it is consistent that there are Kurepa trees and for every Kurepa tree there is a small forcing notion which adds a branch to it without collapsing…

逻辑 · 数学 2024-01-02 Itamar Giron , Yair Hayut

We prove that every weakly square compact cardinal is a strong limit cardinal. We also study Aronszajn trees with no uncountable finitely branching subtrees, characterizing them in terms of being Lindel\"of with respect to a particular…

逻辑 · 数学 2023-05-26 Pedro E. Marun

Definitions of dense linear orders (with/without endpoints), separable linear orders, complete linear orders, the countable chain condition for linear orders, a Suslin line/Suslin tree and Suslin's problem Statement and proof of Cantor's…

数论 · 数学 2025-08-22 Trey Smith , Aksel Ozer

We construct a model of set theory in which there exists a Suslin tree and satisfies that any two normal Aronszajn trees, neither of which contains a Suslin subtree, are club isomorphic. We also show that if $S$ is a free normal Suslin…

逻辑 · 数学 2025-04-16 John Krueger

A forest is a generalization of a tree, and here we consider the Aronszajn and Suslin properties for forests. We focus on those forests satisfying coherence, a local smallness property. We show that coherent Aronszajn forests can be…

逻辑 · 数学 2019-01-07 Monroe Eskew

Using ideas from Shelah's recent proof that a completely separable maximal almost disjoint family exists when $\c < {\aleph}_{\omega}$, we construct a weakly tight family under the hypothesis $\s \leq \b < {\aleph}_{\omega}$. The case when…

逻辑 · 数学 2019-08-15 Dilip Raghavan , Juris Steprāns

The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures for tree shares are hard to implement due to a lack of a systematic theoretical…

计算机科学中的逻辑 · 计算机科学 2020-10-19 Xuan-Bach Le , Aquinas Hobor , Anthony W. Lin

We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…

逻辑 · 数学 2008-10-30 Bernhard Irrgang

Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this paper, we investigate connections between variations of the…

逻辑 · 数学 2023-03-03 Chris Lambie-Hanson , Šárka Stejskalová

We give two consistent constructions of trees $T$ whose finite power $T^{n+1}$ is sharply different from $T^n$: 1. An $\aleph_1$-tree $T$ whose interval topology $X_T$ is perfectly normal, but $(X_T)^2$ is not even countably metacompact. 2.…

逻辑 · 数学 2026-04-22 Ari Meir Brodsky , Assaf Rinot , Shira Yadai

We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…

逻辑 · 数学 2019-08-15 Chris Lambie-Hanson , Assaf Rinot

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…

逻辑 · 数学 2013-09-03 Heike Mildenberger , Saharon Shelah

A basic statement in graph theory is that every inclusion-maximal forest is connected, i.e. a tree. Using a definiton for higher dimensional forests by Graham and Lovasz and the connectivity-related notion of tightness for hypergraphs…

组合数学 · 数学 2011-09-16 Heidi Gebauer , Anna Gundert , Robin A. Moser , Yoshio Okamoto

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…

逻辑 · 数学 2023-10-31 Miloš S. Kurilić

We characterize those countable rooted trees whose full automorphism group has uncountable strong cofinality or contains an open subgroup with ample generics.

群论 · 数学 2011-10-21 Maciej Malicki

We prove that it is consistent that there exists a Kurepa tree $T$ such that ${}^{\omega_1}2$ is a continuous image of the topological space $[T]$ consisting of all cofinal branches of $T$ with respect to the cone topologies. This result…

逻辑 · 数学 2025-07-03 John Krueger