English
Related papers

Related papers: NS saturated and $\Delta_1$-definable

200 papers

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

This paper details the construction of a universe where $\Pi^1_3$-uniformization is true, the Continuum Hypothesis holds yet it possesses a $\Delta^1_3$-definable well-order of its reals. The method can be lifted to canonical inner models…

Logic · Mathematics 2025-06-30 Stefan Hoffelner

An $\omega_1$-compact space is a space in which every closed discrete subspace is countable. We give various general conditions under which a locally compact, $\omega_1$-compact space is $\sigma$-countably compact, i.e., the union of…

General Topology · Mathematics 2022-06-07 Peter Nyikos , Lyubomyr Zdomskyy

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

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

Logic · Mathematics 2018-02-15 Gunter Fuchs

This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…

Computational Complexity · Computer Science 2018-04-24 Mark Inman

We characterize nonstandard models of ZF (of arbitrary cardinality) that can be expanded to Goedel-Bernays class theory plus $\Delta^1_1$-Comprehension. We also characterize countable nonstandard models of ZFC that can be expanded to…

Logic · Mathematics 2022-06-27 Ali Enayat

We make use of generalized iterations of Jensen forcing to define a cardinal-preserving generic model of ZF for any $n\ge 1$ and each of the following four Choice hypotheses: (1)…

Logic · Mathematics 2025-12-22 Vladimir Kanovei , Vassily Lyubetsky

We make use of some observations on the core model, for example assuming $V=L [ E ]$, and that there is no inner model with a Woodin cardinal, and $M$ is an inner model with the same cardinals as $V$, then $V=M$. We conclude in this latter…

Logic · Mathematics 2021-10-27 Jouko Väänänen , Philip Welch

A Kaufmann model is an $\omega_1$-like, recursively saturated, rather classless model of $\mathrm{PA}$ or $\mathrm{ZF}$. Such models were constructed by Kaufmann under the combinatorial principle $\diamondsuit_{\omega_1}$ and Shelah showed…

Logic · Mathematics 2022-02-01 Corey Bacal Switzer

A compactum $X\subset \C$ is unshielded if it coincides with the boundary of the unbounded component of $\C\sm X$. Call a compactum $X$ finitely Suslinian if every collection of pairwise disjoint subcontinua of $X$ whose diameters are…

General Topology · Mathematics 2016-01-18 Alexander Blokh , Clinton Curry , Lex Oversteegen

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

Definable stationary sets, and specifically, ordinal definable ones, play a significant role in the study of canonical inner models of set theory and the class HOD of hereditarily ordinal definable sets. Fixing a certain notion of…

Logic · Mathematics 2024-04-19 Omer Ben-Neria , Philipp Lücke

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

Logic · Mathematics 2016-01-15 Saharon Shelah

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

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

We prove that if ZF is consistent then ZFC+GCH is consistent with the following statement: There is for every k<omega a model of cardinality aleph_1 which is L_{infty,omega_1}-equivalent to exactly k non-isomorphic models of cardinality…

Logic · Mathematics 2007-05-23 Saharon Shelah , Pauli Vaisanen

We analyze the hereditarily ordinal definable sets $\operatorname{HOD}$ in $M_n(x)[g]$ for a Turing cone of reals $x$, where $M_n(x)$ is the canonical inner model with $n$ Woodin cardinals build over $x$ and $g$ is generic over $M_n(x)$ for…

Logic · Mathematics 2021-01-19 Sandra Müller , Grigor Sargsyan

$\Delta$-spaces have been defined by a natural generalization of a classical notion of $\Delta$-sets of reals to Tychonoff topological spaces; moreover, the class $\Delta$ of all $\Delta$-spaces consists precisely of those $X$ for which the…

General Topology · Mathematics 2023-08-01 Arkady Leiderman , Paul Szeptycki

We introduce exacting cardinals and a strengthening of these, ultraexacting cardinals. These are natural large cardinals defined equivalently as weak forms of rank-Berkeley cardinals, strong forms of J\'onsson cardinals, or in terms of…

Logic · Mathematics 2025-09-17 Juan P. Aguilera , Joan Bagaria , Philipp Lücke