English
Related papers

Related papers: Forcing More DC Over the Chang Model Using the Tho…

200 papers

We introduce a category whose objects are stationary set preserving complete boolean algebras and whose arrows are complete homomorphisms with a stationary set preserving quotient. We show that the cut of this category at a rank initial…

Logic · Mathematics 2015-07-30 Matteo Viale

Starting from infinitely many supercompact cardinals, we force a model of ZFC where $\aleph_{\omega^2+1}$ satisfies simultaneously a strong principle of reflection, called $\Delta$-reflection, and a version of the square principle, denoted…

Logic · Mathematics 2016-02-04 Laura Fontanella , Yair Hayut

Introducing unfoldable cardinals last year, Andres Villaveces ingeniously extended the notion of weak compactness to a larger context, thereby producing a large cardinal notion, unfoldability, with some of the feel and flavor of weak…

Logic · Mathematics 2007-05-23 Joel David Hamkins

For $f,g\in\omega\ho$ let $\mycfa_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e. for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. $\myc_{f,g}$ is…

Logic · Mathematics 2011-01-25 Jakob Kellner , Saharon Shelah

We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for…

Logic · Mathematics 2022-10-18 Saharon Shelah

We prove a \emph{query complexity} lower bound on rank-one principal component analysis (PCA). We consider an oracle model where, given a symmetric matrix $M \in \mathbb{R}^{d \times d}$, an algorithm is allowed to make $T$ \emph{exact}…

Machine Learning · Computer Science 2017-04-18 Max Simchowitz , Ahmed El Alaoui , Benjamin Recht

Suppose that $T^*$ is an $\omega_1$-Aronszajn tree with no stationary antichain. We introduce a forcing axiom PFA($T^*$) for proper forcings which preserve these properties of $T^*$. We prove that PFA($T^*$) implies many of the strong…

Logic · Mathematics 2020-04-28 John Krueger

Much recent work in cardinal characteristics has focused on generalizing results about $\omega$ to uncountable cardinals by studying analogues of classical cardinal characteristics on the generalized Baire and Cantor spaces $\kappa^\kappa$…

Logic · Mathematics 2021-09-01 Corey Bacal Switzer

We give an exposition of an iteration theorem for iterating $(<\lambda)$-closed stationary $\lambda^+$-cc forcing with supports of size $<\lambda$ and preserving these two properties. We discuss the relation of this theorem with other…

Logic · Mathematics 2026-04-14 Mirna Džamonja

We obtain a small ultrafilter number at $\aleph_{\omega_1}$. Moreover, we develop a version of the overlapping strong extender forcing with collapses which can keep the top cardinal $\kappa$ inaccessible. We apply this forcing to construct…

Logic · Mathematics 2025-12-10 Tom Benhamou , Sittinon Jirattikansakul

Let chi be the minimum cardinal of a subset of 2^omega that cannot be made convergent by multiplication with a single Toeplitz matrix. By an application of creature forcing we show that s<chi is consistent. We thus answer a question by…

Logic · Mathematics 2007-05-23 Heike Mildenberger , Saharon Shelah

We discuss some highlights of our computer-verified proof of the construction, given a countable transitive set-model $M$ of $\mathit{ZFC}$, of generic extensions satisfying $\mathit{ZFC}+\neg\mathit{CH}$ and $\mathit{ZFC}+\mathit{CH}$.…

We improve previous work on the consistency strength of mutually stationary sequences of sets concentrating on points with divergent cofinality building on previous work by Adolf, Cox and Welch. Specifically, we have greatly reduced our…

Logic · Mathematics 2019-08-06 Dominik Adolf

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

Logic · Mathematics 2015-06-09 Ioannis Souldatos

Given any $\lambda\leq\kappa$, we construct a symmetric extension in which there is a set $X$ such that $\aleph(X)=\lambda$ and $\aleph^*(X)=\kappa$. Consequently, we show that $\mathsf{ZF}+$"For all pairs of infinite cardinals…

Logic · Mathematics 2024-08-16 Asaf Karagila , Calliope Ryan-Smith

Manna and Waldinger's theory of substitutions and unification has been verified using the Cambridge LCF theorem prover. A proof of the monotonicity of substitution is presented in detail, as an example of interaction with LCF. Translating…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

This paper is part II of a study on cardinals that are characterizable by a Scott sentence, continuing the work from http://arxiv.org/abs/1007.2426v1. A cardinal $\kappa$ is characterized by a Scott sentence $\phi_M$, if $\phi_M$ has a…

Logic · Mathematics 2017-01-06 Ioannis Souldatos

We consider global analogues of model-theoretic tree properties. The main objects of study are the invariants related to Shelah's tree property $\kappa_{\text{cdt}}(T)$, $\kappa_{\text{sct}}(T)$, and $\kappa_{\text{inp}}(T)$ and the…

Logic · Mathematics 2019-08-13 Nicholas Ramsey

Assuming some large cardinals, a model of ZFC is obtained in which aleph_{omega+1} carries no Aronszajn trees. It is also shown that if lambda is a singular limit of strongly compact cardinals, then lambda^+ carries no Aronszajn trees.

Logic · Mathematics 2009-09-25 Menachem Magidor , Saharon Shelah

We show that in the $\mathbb{P}_{\max}$ extension of a certain Chang-type model of determinacy, if $\kappa\in\{\omega_1, \omega_2, \omega_3\}$, then the restriction of the club filter on $\kappa\cap\mathrm{Cof}(\omega)$ to HOD is an…

Logic · Mathematics 2025-07-01 Navin Aksornthong , Takehiko Gappo , James Holland , Grigor Sargsyan