English
Related papers

Related papers: Hydras for $\omega_{1}$

200 papers

As far as algebraic properties are concerned, the usual addition on the class of ordinal numbers is not really well behaved; for example, it is not commutative, nor left cancellative etc. In a few cases, the natural Hessemberg sum is a…

Logic · Mathematics 2017-02-28 Paolo Lipparini

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

Combinatorics · Mathematics 2021-12-03 James East , Michael Hendriksen , Laurence Park

Using the method of decisive creatures (math.LO/0601083) we show the consistency of "there is no increasing omega_2 --chain of Borel sets and non(N)=non(M)= omega_2=2^omega". Hence, consistently, there are no monotone hulls for the ideal M…

Logic · Mathematics 2014-07-18 Andrzej Roslanowski , Saharon Shelah

We sow that there exists a generic extension of the G\"{o}del's constructible universe in which diamond holds and there exists a subset $Y \subseteq \omega_1$ such that for stationary many $\delta < \omega_1,$ the set $Y \cap \delta$ is not…

Logic · Mathematics 2023-11-07 Mohammad Golshani , Saharon Shelah

The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…

Representation Theory · Mathematics 2021-05-06 Jiuzhao Hua

In a diverse population, where many species are present, competitors can fight for surviving at individual and collective levels. In particular, species, which would beat each other individually, may form a specific alliance that ensures…

Populations and Evolution · Quantitative Biology 2023-01-03 Junpyo Park , Xiaojie Chen , Attila Szolnoki

We investigate the classical two species ODE and PDE Lotka-Volterra competition models, where one of the competitors could potentially go extinct in finite time. We show that in this setting, classical theories and intuitions do not hold,…

Analysis of PDEs · Mathematics 2021-09-13 Rana D. Parshad , Kwadwo Antwi-Fordjour , Eric M. Takyi

We give an historical account, including recent progress, on some problems of Erd\H os in number theory.

Number Theory · Mathematics 2019-08-02 Gérald Tenenbaum

We study the existence of uncountable first-order structures that are homogeneous with respect to their finitely generated substructures. In many classical cases this is either well-known or follows from general facts, for example, if the…

Logic · Mathematics 2025-10-21 Adam Bartoš , Wiesław Kubiś

We prove (ZF+DC) e.g. : if mu =|H(mu)| then mu^+ is regular non measurable. This is in contrast with the results for mu = aleph_{omega} on measurability see Apter Magidor [ApMg]

Logic · Mathematics 2008-02-03 Saharon Shelah

Let $\mathbb{T}^\omega$ be the infinite-dimensional torus, and $T: \mathbb{T}^\omega\to \mathbb{T}^\omega$ be defined by \[ T: (x_1, x_2, \dots, x_k, \ldots) \mapsto (x_1 + \alpha, x_2 + h(x_1), \dots, x_k + h(x_1 + (k-2)\beta), \dots) \]…

Number Theory · Mathematics 2026-03-13 Qingyang Liu , Jing Ma , Hongbo Wang

The generally accepted wisdom in computational circles is that pure proof verification is a solved problem and that the computationally hard elements and fertile areas of study lie in proof discovery. This wisdom presumably does hold for…

Logic in Computer Science · Computer Science 2017-03-28 Naveen Sundar Govindarajulu , Selmer Bringsjord

Let $\omega(n)$ denote the number of distinct prime factors of $n$. Assuming a suitably uniform version of the prime $k$-tuples conjecture, we show that the number \begin{align*} \sum_{n=1}^\infty \frac{\omega(n)}{2^n} \end{align*} is…

Number Theory · Mathematics 2024-09-24 Kyle Pratt

In this paper we expound some basic ideas of proof theory for theories of ordinals such that there are many stable ordinals below the ordinals.

Logic · Mathematics 2011-04-12 Toshiyasu Arai

We prove an iteration theorem which guarantees for a wide class of nice iterations of $\omega_1$-preserving forcings that $\omega_1$ is not collapse, at the price of needing large cardinals to burn as fuel. More precisely, we show that a…

Logic · Mathematics 2024-03-15 Andreas Lietz

We prove that every finite partition of $\omega$ admit an infinite subset that does not compute a Schnorr random real. We use this result to answer two questions of Brendle, Brooke-Taylor, Ng and Nies and strength a result of Khan and…

Logic · Mathematics 2020-06-08 Lu Liu

We prove that in some cases definable chains of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic chains, ROD chains in the Solovay model, and $\Sigma^1_2$ chains in the assumption that…

Logic · Mathematics 2018-08-16 Vladimir Kanovei

In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable states are attainable, such as when an element is present -1…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-19 Stephen Dolan

The problem of counting the number of waves arriving at the vertex of a polyhedron is motivated by physics. In the article it was solved for the case of Platonic solid using three nontrivial results from number theory. This growth turns out…

Number Theory · Mathematics 2022-12-27 Vsevolod L. Chernyshev , Alexey Rukhovich

We describe a proof-theoretic bound on $Sigma_{2}$-definable countable ordinals in Kripke-Platek set theory with $Pi_{1}$-Collection and the existence of $omega_{1}$.

Logic · Mathematics 2015-08-10 Toshiyasu Arai