English
Related papers

Related papers: Cut-elimination for $\omega_{1}$

200 papers

This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…

General Mathematics · Mathematics 2010-02-25 J. A. Perez

Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…

General Topology · Mathematics 2013-10-22 Marion Scheepers

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

Logic · Mathematics 2020-07-21 Samuel M. Corson

We develop an effective version of Kronecker's Theorem on the splitting of polynomials, based on asymptotic arguments proposed by the Chudnovsky brothers, coming from Hermite-Pad\'e approximation. In conjunction with Honda's proof of the…

Number Theory · Mathematics 2026-03-13 Florian Fürnsinn , Lucas Pannier

The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…

Logic in Computer Science · Computer Science 2022-04-12 Reijo Jaakkola

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

The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…

We consider the space of countable structures with fixed underlying set in a given countable language. We show that the number of ergodic probability measures on this space that are $S_\infty$-invariant and concentrated on a single…

We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…

Logic · Mathematics 2013-02-14 Tarek Sayed Ahmed , Mohammad Assem

We study the strength of well-founded ultrafilters on ordinals above choiceless large cardinals and their associated Prikry forcings. Gabriel Goldberg showed that all but boundedly many regular cardinals above a rank Berkeley cardinal carry…

Logic · Mathematics 2025-11-12 William Adkisson , Omer Ben Neria

We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…

Logic · Mathematics 2023-06-13 Tamás Csernák , Lajos Soukup

We prove that if there are $\mathfrak c$ incomparable selective ultrafilters then, for every infinite cardinal $\kappa$ such that $\kappa^\omega=\kappa$, there exists a group topology on the free Abelian group of cardinality $\kappa$…

Logic · Mathematics 2021-03-25 M. K. Bellini , K. P. Hart , V. O. Rodrigues , A. H. Tomita

We consider and characterize classes of finite and countably categorical structures and their theories preserved under $E$-operators and $P$-operators. We describe $e$-spectra and families of finite cardinalities for structures belonging to…

Logic · Mathematics 2017-01-04 Sergey V. Sudoplatov

In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which…

Logic in Computer Science · Computer Science 2025-06-18 Esaïe Bauer , Alexis Saurin

We prove that the class of all ordinals Ord is not weakly compact with respect to definable classes. Specifically, in any model of ZFC, the definable tree property fails for Ord, in that there is a definable Ord tree with no definable…

Logic · Mathematics 2017-10-27 Ali Enayat , Joel David Hamkins

Let $\Omega\subset \mathbb{R}^{n+1}$ be an open set, not necessarily connected, with an $n$-dimensional uniformly rectifiable boundary. We show that $\partial\Omega$ may be approximated in a "Big Pieces" sense by boundaries of chord-arc…

Classical Analysis and ODEs · Mathematics 2018-07-10 Steve Hofmann , José María Martell

We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and…

Logic in Computer Science · Computer Science 2009-08-04 Olivier Finkel

We begin the study of the consequences of the existence of certain infinite matrices. Our present application is to compactness of products of topological spaces.

Logic · Mathematics 2008-03-26 Paolo Lipparini

This paper continues the author's previous study \cite{Kura20}, showing that several weak principles inspired by non-normal modal logic suffice to derive various refined forms of the second incompleteness theorem. Among the main results of…

Logic · Mathematics 2025-08-12 Taishi Kurahashi

A reduction of properties (invariants) of compact sets of real numbers to properties of countable orders is presented here. Discussed here is also an embedding property of some compact sets that are called t$\mathbb R$-sets. Among others,…

General Topology · Mathematics 2026-02-18 Sławomir Kusiński , Szymon Plewik