English
Related papers

Related papers: On countable cofinality of definable chains in Bor…

200 papers

As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…

Logic · Mathematics 2017-03-17 Jafar S. Eivazloo

We answer a question of Shelah by showing that it is consistent that every set of ordinals of cofinality omega_1 in I[omega_2] is nonstationary if and only if it is consistent that that there is a kappa^+ Mahlo cardinal kappa.

Logic · Mathematics 2007-05-23 William J. Mitchell

An \'etale structure over a topological space $X$ is a continuous family of structures (in some first-order language) indexed over $X$. We give an exposition of this fundamental concept from sheaf theory and its relevance to countable model…

Logic · Mathematics 2023-10-19 Ruiyuan Chen

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

Logic in Computer Science · Computer Science 2025-09-11 Alessandro Artale , Christopher Hampson , Roman Kontchakov , Andrea Mazzullo , Frank Wolter

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

Logic · Mathematics 2008-07-08 Saharon Shelah

A computable graph $\mathcal{G}$ is computably categorical relative to a degree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies $\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism…

Logic · Mathematics 2025-05-08 Java Darleen Villano

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

Logic · Mathematics 2023-01-02 Daisuke Ikegami , Philipp Schlicht

We use $\diamondsuit$ to construct, for every $\alpha\leq\omega_1$ a sequential countably compact topological group of sequential order $\alpha$. This establishes the independence of the existence of sequential countably compact non…

General Topology · Mathematics 2019-03-20 Dmitri Shakhmatov , Alexander Shibakov

A separable space is strongly sequentially separable if, for each countable dense set, every point in the space is a limit of a sequence from the dense set. We consider this and related properties, for the spaces of continous and Borel…

General Topology · Mathematics 2019-11-11 Alexander V. Osipov , Piotr Szewczak , Boaz Tsaban

We present a streamlined exposition of a construction by R. Chen, A. Poulin, R. Tao, and A. Tserunyan, which proves the treeability of equivalence relations generated by any locally-finite Borel graph such that each component is a…

Logic · Mathematics 2025-04-25 Zhaoshen Zhai

In this article, we give a full description of the Wadge degrees of Borel functions from $\omega^\omega$ to a better quasi ordering $\mathcal{Q}$. More precisely, for any countable ordinal $\xi$, we show that the Wadge degrees of…

Logic · Mathematics 2017-05-23 Takayuki Kihara , Antonio Montalbán

The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…

Logic · Mathematics 2024-06-07 Miloš S. Kurilić

Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…

Logic · Mathematics 2017-09-26 Milos Kurilic

In this paper, we study definable variants of the notion of the distinguishing number of a graph in descriptive set theoretic setting. We introduce the notion of the Borel distinguishing number of a Borel graph and provide examples that…

Logic · Mathematics 2025-09-17 Onur Bilge , Burak Kaya

Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…

Computational Complexity · Computer Science 2009-02-10 Laurent Bienvenu , Rod Downey

In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…

Classical Analysis and ODEs · Mathematics 2008-06-30 Stefano Galatolo , Mathieu Hoyrup , Cristobal Rojas

We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $\omega$ implies that the modal logic S4.1.2 is complete with respect to the \v{C}ech-Stone compactification of the natural numbers,…

Logic · Mathematics 2017-09-21 Tomáš Lávička , Jonathan L. Verner

In this paper, we show that, for each $p>1$, there are continuum many Borel equivalence relations between $\Bbb R^\omega/\ell_1$ and $\Bbb R^\omega/\ell_p$ ordered by $\le_B$ which are pairwise Borel incomparable.

Logic · Mathematics 2011-05-24 Longyun Ding , Zhi Yin

Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…

Logic · Mathematics 2018-02-08 Filippo Calderoni , Luca Motto Ros

We show that for every ordinal $\alpha \in [1, \omega_1)$ there is a closed set $F \subset 2^\omega \times \omega^\omega$ such that for every $x \in 2^\omega$ the section $\{y\in \omega^\omega; (x,y) \in F\}$ is a two-point set and $F$…

Logic · Mathematics 2020-10-07 P. Holicky , M. Zeleny
‹ Prev 1 8 9 10 Next ›