English
Related papers

Related papers: A new model for all $C$-sequences are trivial

200 papers

We investigate questions involving Aronszajn trees, square principles, and stationary reflection. We first consider two strengthenings of $\square(\kappa)$ introduced by Brodsky and Rinot for the purpose of constructing $\kappa$-Souslin…

Logic · Mathematics 2016-06-07 Chris Lambie-Hanson

It is proved that every normalized weakly null \sq\ has a sub\sq\ which is convexly unconditional. Further, an Hierarchy of summability methods is introduced and with this we give a complete classification of the complexity of weakly null…

Functional Analysis · Mathematics 2016-09-06 Spiros A. Argyros , S. Merkourakis , A. Tsarpalias

We show that if \kappa\ is a weakly compact cardinal then the embeddability relation on (generalized) trees of size \kappa\ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space 2^\kappa\…

Logic · Mathematics 2013-06-28 Luca Motto Ros

We analyse the complexity of the class of (special) Aronszajn, Suslin and Kurepa trees in the projective hierarchy of the higher Baire-space $\omega_1^{\omega_1}$. First, we will show that none of these classes have the Baire property…

Logic · Mathematics 2019-06-04 Sy-David Friedman , Dániel T. Soukup

In Part I of this series, we presented the microscopic approach to Souslin-tree constructions, and argued that all known $\diamondsuit$-based constructions of Souslin trees with various additional properties may be rendered as applications…

Logic · Mathematics 2021-04-06 Ari Meir Brodsky , Assaf Rinot

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

If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…

Logic · Mathematics 2016-09-07 Ernest Schimmerling , John R. Steel

The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper, as new foundations for the construction of $\kappa$-Souslin trees in a uniform way that does not depend on the nature of the (regular uncountable)…

Logic · Mathematics 2025-09-09 Ari Meir Brodsky , Assaf Rinot , Shira Yadai

Motivated by a question from a recent paper by Gilton, Levine and Stejskalova, we obtain a new characterization of the ideal $J[\kappa]$, from which we confirm that $\kappa$-Souslin trees exist in various models of interest. As a corollary…

Logic · Mathematics 2021-04-20 Assaf Rinot

Nakano's "later" modality, inspired by G\"{o}del-L\"{o}b provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of…

Logic in Computer Science · Computer Science 2015-04-20 Ranald Clouston , Rajeev Goré

We establish a new connection between local and large-scale structure in compactly generated totally disconnected locally compact (t.d.l.c.) groups $G$, finding a sufficient condition for $G$ to have more than one end in terms of its…

Group Theory · Mathematics 2024-02-23 Pierre-Emmanuel Caprace , Timothée Marquis , Colin D. Reid

An inaccessible cardinal kappa is supercompact when (kappa, lambda)-ITP holds for all lambda greater than or equal to kappa. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC…

Logic · Mathematics 2012-05-21 Laura Fontanella

We develop the theory of layered posets, and use the notion of layering to prove a new iteration theorem (Theorem 6): if $\kappa$ is weakly compact then any universal Kunen iteration of $\kappa$-cc posets (each possibly of size $\kappa$) is…

Logic · Mathematics 2019-09-18 Sean D. Cox

In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show that constraint consistency, a notion that has been developed to…

Artificial Intelligence · Computer Science 2011-10-12 J. Culberson , Y. Gao

We prove that if $p$ is a selective ultrafilter then ${\mathbb Q}^{(\kappa)}$ has a $p$-compact group topology without non-trivial convergent sequences, for each infinite cardinal $\kappa =\kappa^\omega$. In particular, this gives the first…

General Topology · Mathematics 2019-04-15 Matheus Koveroff Bellini , Vinicius de Oliveira Rodrigues , Artur Hideyuki Tomita

We produce a highly structured way of associating a simplicial category to a model category which improves on work of Dwyer and Kan and answers a question of Hovey. We show that model categories satisfying a certain axiom are Quillen…

Algebraic Topology · Mathematics 2020-01-13 Charles Rezk , Stefan Schwede , Brooke Shipley

A finite $CW$-complex $X$ is $C$-trivial if for every complex vector bundle $\xi$ over $X$, the total Chern class $c(\xi)=1$. In this note we completely determine when each of the following spaces are $C$-trivial: suspensions of stunted…

Algebraic Topology · Mathematics 2015-08-28 Aniruddha C. Naolekar , Ajay Singh Thakur

Assuming the existence of a strong cardinal $\kappa$ and a measurable cardinal above it, we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any prescribed cofinality, and such that the tree property holds…

Logic · Mathematics 2017-08-08 Mohammad Golshani , Rahman Mohammadpour

We investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are…

Logic · Mathematics 2018-02-06 Gunter Fuchs , Kaethe Minden

We prove a revised version of Laver's indestructibility theorem which slightly improves over the classical result. An application yields the consistency of $(\kappa^+,\kappa)\notcc(\aleph\_1,\aleph\_0)$ when $\kappa$ is supercompact. The…

Logic · Mathematics 2007-05-23 Bernhard Koenig