English
Related papers

Related papers: Clarifying ordinals

200 papers

We show that it is not provable in ZFC that any two countable elementarily equivalent structures have isomorphic ultrapowers relative to some ultrafilter on omega .

Logic · Mathematics 2008-02-03 Saharon Shelah

Uniform metastable convergence is a weak form of uniform convergence for a family of sequences. In this paper we explore the way that metastable convergence stratifies into a family of notions indexed by countable ordinals. We give two…

Logic · Mathematics 2017-10-03 Henry Towsner

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

Logic · Mathematics 2021-02-18 Filippo Calderoni , Heike Mildenberger , Luca Motto Ros

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…

Logic · Mathematics 2007-05-23 Bernhard Koenig

The logic L^1_\theta introduced in [Sh:797]; it is the maximal logic below L_theta theta in which a well ordering is not definable. We investigate it for theta a compact cardinal. We prove it satisfies several parallel of classical theorems…

Logic · Mathematics 2021-08-10 Saharon Shelah

Let $A$ be a set and $f:A\rightarrow A$ a bijective function. Necessary and sufficient conditions on $f$ are determined which makes it possible to endow $A$ with a binary operation $*$ such that $(A,*)$ is a cyclic group and $f\in…

Group Theory · Mathematics 2018-10-18 B-E de Klerk , JH Meyer , J Szigeti , L van Wyk

We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $G\not\subseteq K$, or (ii)…

Combinatorics · Mathematics 2024-05-02 Alistair Benford , Louis DeBiasio , Paul Larson

It is proved to be consistent relative to a measurable cardinal that there is a uniform ultrafilter on the real numbers which is generated by fewer than the maximum possible number of sets. It is also shown to be consistent relative to a…

Logic · Mathematics 2019-04-05 Dilip Raghavan , Saharon Shelah

Given a cardinal $\lambda$, category forcing axioms for $\lambda$-suitable classes $\Gamma$ are strong forcing axioms which completely decide the theory of the Chang model $\mathcal C_\lambda$, modulo generic extensions via forcing notions…

Logic · Mathematics 2018-05-23 David Aspero , Matteo Viale

Given a forcing notion $P$ that forces certain values to several classical cardinal characteristics of the reals, we show how we can compose $P$ with a collapse (of a cardinal $\lambda>\kappa$ to $\kappa$) such that the composition still…

Logic · Mathematics 2020-06-19 Martin Goldstern , Jakob Kellner , Diego A. Mejía , Saharon Shelah

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

Logic · Mathematics 2020-05-27 Alejandro Poveda , Assaf Rinot , Dima Sinapova

Measuring says that for e\-very sequence $(C_\delta)_{\delta<\omega_1}$ with each $C_\delta$ being a closed subset of $\delta$ there is a club $C\subseteq\omega_1$ such that for every $\delta\in C$, a tail of $C\cap\delta$ is either…

Logic · Mathematics 2021-08-19 David Aspero , Miguel Angel Mota

We show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on…

Logic in Computer Science · Computer Science 2022-01-11 Thomas Colcombet , Sam van Gool , Rémi Morvan

We investigate the structure of the lattice of clones on an infinite set X. We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg's theorem: "there are 2^2^kappa many maximal (=precomplete)…

Rings and Algebras · Mathematics 2016-09-07 Martin Goldstern , Saharon Shelah

We show that higher Sacks forcing at a regular limit cardinal and club Miller forcing at an uncountable regular cardinal both add a diamond sequence. We answer the longstanding question, whether $\kappa = \kappa^{<\kappa} \geq\aleph_1$…

Logic · Mathematics 2025-04-14 Heike Mildenberger , Saharon Shelah

This is a follow up to a paper by the author where the disjointness relation for (the graphs of) definable functions from ${^\omega \omega}$ to ${^\omega \omega}$ is analyzed. In that paper, for each $a \in {^\omega \omega}$ we defined a…

Logic · Mathematics 2023-01-09 Dan Hathaway

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

Logic · Mathematics 2013-06-25 Saharon Shelah

We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number…

Logic · Mathematics 2008-02-03 Saharon Shelah

A cardinal kappa is countably closed if mu^omega < kappa whenever mu < kappa. Assume that there is no inner model with a Woodin cardinal and that every set has a sharp. Let K be the core model. Assume that kappa is a countably closed…

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

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

Logic · Mathematics 2016-09-07 Martin Goldstern , Saharon Shelah