English
Related papers

Related papers: Subcomplete forcing, trees and generic absolutenes…

200 papers

It is well known that the completeness theorem for $\mathrm{L}_{\omega_1\omega}$ fails with respect to Tarski semantics. Mansfield showed that it holds for $\mathrm{L}_{\infty\infty}$ if one replaces Tarski semantics with boolean valued…

Logic · Mathematics 2023-05-16 Juan M. Santiago , Matteo Viale

We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…

Logic · Mathematics 2019-12-03 Matteo Viale

In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.

Logic · Mathematics 2022-02-18 Rahman Mohammadpour

With the help of various square principles, we obtain results concerning the consistency strength of several statements about trees containing ascent paths, special trees, and strong chain conditions. Building on a result that shows that…

Logic · Mathematics 2019-02-20 Chris Lambie-Hanson , Philipp Lücke

We generalize the diamond principle and its variants using the notion of stationarity in trees introduced by Brodsky in [Brodsky, A. M., A theory of stationary trees and the balanced Baumgartner--Hajnal--Todorcevic theorem for trees. The…

Logic · Mathematics 2026-02-17 Osvaldo Guzmán , Carlos López-Callejas

Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…

Logic · Mathematics 2025-02-05 Thomas Gilton

It is consistent that there exists a Souslin tree $T$ such that after forcing with it, $T$ becomes an almost Souslin Kurepa tree. This answers a question of Zakrzewski.

Logic · Mathematics 2015-10-13 Mohammad Golshani

Two-dimensional version of the classical Mycielski theorem says that for every comeager or conull set $X\subseteq [0,1]^2$ there exists a perfect set $P\subseteq [0,1]$ such that $P\times P\subseteq X\cup \Delta$. We consider…

General Topology · Mathematics 2019-05-23 Marcin Michalski , Robert Rałowski , Szymon Żeberski

Recently, we have shown that satisfiability for $\mathsf{ECTL}^*$ with constraints over $\mathbb{Z}$ is decidable using a new technique. This approach reduces the satisfiability problem of $\mathsf{ECTL}^*$ with constraints over some…

Logic in Computer Science · Computer Science 2015-02-25 Claudia Carapelle , Shiguang Feng , Alexander Kartzow , Markus Lohrey

In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…

Logic · Mathematics 2024-12-30 Rahman Mohammadpour , 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…

Logic · Mathematics 2025-09-03 Jorge Antonio Cruz Chapital , Osvaldo Guzman , Stevo Todorcevic

We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below omega^omega. Moreover, we make…

Logic in Computer Science · Computer Science 2015-07-01 Martin Huschenbett , Alexander Kartzow , Jiamou Liu , Markus Lohrey

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…

Logic · Mathematics 2008-10-30 Bernhard Irrgang

We provide a general preservation theorem for preserving selective independent families along countable support iterations. The theorem gives a general framework for a number of results in the literature concerning models in which the…

Logic · Mathematics 2022-08-23 Vera Fischer , Corey Bacal Switzer

We construct a model in which all $C$-sequences are trivial, yet there exists a $\kappa$-Souslin tree with full vanishing levels. This answers a question of Lambie-Hanson and Rinot, and provides an optimal combination of compactness and…

Logic · Mathematics 2025-04-10 Assaf Rinot , Zhixing You , Jiachen Yuan

We introduce bounded category forcing axioms for well-behaved classes $\Gamma$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{\lambda_\Gamma^+}$ modulo…

Logic · Mathematics 2021-01-11 David Aspero , Matteo Viale

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…

Group Theory · Mathematics 2011-10-21 Maciej Malicki

We show that under certain circumstances wide Aronszajn trees can be specialized iteratively without adding reals. We then use this fact to study forcing axioms compatible with CH and list some open problems.

Logic · Mathematics 2020-05-29 Corey Bacal Switzer

This paper studies structural consequences of supercompactness of $\omega_1$ under $\sf{ZF}$. We show that the Axiom of Dependent Choice $(\sf{DC})$ follows from "$\omega_1$ is supercompact". "$\omega_1$ is supercompact" also implies that…

Logic · Mathematics 2019-04-04 Daisuke Ikegami , Nam Trang

We investigate fragments of generic absoluteness principles known as Maximality Principles. We determine the consistency strength of $\Sigma_n$-$\mathsf{MP}(\mathbb R)$ and $\Pi_n$-$\mathsf{MP}(\mathbb R)$, the boldface Maximality Principle…

Logic · Mathematics 2025-08-25 Takehiko Gappo , Andreas Lietz
‹ Prev 1 4 5 6 7 8 10 Next ›