中文
相关论文

相关论文: Long Borel Hierarchies

200 篇论文

Caucal hierarchy is a well-known class of graphs with decidable monadic theories. It were proved by L. Braud and A. Carayol that well-orderings in the hierarchy are the well-orderings with order types less than $\varepsilon_0$. Naturally,…

逻辑 · 数学 2015-12-17 Fedor Pakhomov

There exists a family $\{B_{\alpha}\}_{\alpha<\omega_1}$ of sets of countable ordinals such that o $\max B_{\alpha}=\alpha$, o if $\alpha\in B_{\beta}$ then $B_{\alpha}\subseteq B_{\beta}$, o if $\lambda\leq \alpha$ and $\lambda$ is a limit…

逻辑 · 数学 2016-09-06 Thomas Jech , Saharon Shelah

We show that the equational theory of the structure $\langle \omega^{\omega}: (x,y)\mapsto x+y, x\mapsto \omega x \rangle $ is finitely axiomatizable and give a simple axiom schema when the domain is the set of transfinite ordinals. We give…

逻辑 · 数学 2025-07-09 Christian Choffrut

A long-standing conjecture of Sacks states that it is provable in ZFC that every locally countable partial order of size continuum embeds into the Turing degrees. We show that this holds for partial orders of height two, but provide…

逻辑 · 数学 2023-09-18 Kojiro Higuchi , Patrick Lutz

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

逻辑 · 数学 2020-07-21 John Clemens , Samuel Coskey , Samuel Dworetzky

In partial answer to a question posed by Arnie Miller (http://www.math.wisc.edu/~miller/res/problem.pdf) and X. Caicedo, we obtain sufficient conditions for an L_{omega_1,omega} theory to have an independent axiomatization. As a consequence…

逻辑 · 数学 2010-12-16 Greg Hjorth , Ioannis Souldatos

We extend A. Miller's framework of $\alpha$-forcing to the case of a regular uncountable cardinal $\kappa = \kappa^{<\kappa}$ and apply it to study the structure of the $\kappa$-Borel hierarchy on subspaces of the generalized Baire space…

逻辑 · 数学 2026-03-10 Nick Chapman

In what follows, essentially two things will be accomplished: Firstly, it will be proven that a version of the Arzel\`a--Ascoli theorem and the Fr\'echet--Kolmogorov theorem are equivalent to the axiom of countable choice for subsets of…

逻辑 · 数学 2018-03-23 Adrian Fellhauer

Given a countable o-minimal theory T, we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the…

逻辑 · 数学 2015-10-19 Richard Rast , Davender Singh Sahota

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…

逻辑 · 数学 2024-07-22 Iian B. Smythe

We present a selection of basic results on Borel reducibility of Borel ideals and equivalence relations, especially those with comparably short proofs. The focal point are reducibility/irreducibility results related to some special…

逻辑 · 数学 2018-08-16 Vladimir Kanovei

We show that there are infinitely many binary strings z, such that the sum of the on-line decision complexity of predicting the even bits of z given the previous uneven bits, and the decision complexity of predicting the uneven bits given…

信息论 · 计算机科学 2009-09-01 Bruno Bauwens

We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…

逻辑 · 数学 2021-04-06 Jan Reimann , Theodore A. Slaman

In [5], Hjorth proved that for every countable ordinal $\alpha$, there exists a complete $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$ that has models of all cardinalities less than or equal to $\aleph_\alpha$, but no models of…

逻辑 · 数学 2021-09-16 Philipp Lücke , Ioannis Souldatos

An algebraic tree T is one determined by a finite system of fixed point equations. The frontier \Fr(T) of an algebraic tree t is linearly ordered by the lexicographic order \lex. When (\Fr(T),\lex) is well-ordered, its order type is an…

形式语言与自动机理论 · 计算机科学 2010-02-08 S. L. Bloom , Z. Esik

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…

逻辑 · 数学 2015-12-16 Pedro Sánchez Terraf

In this paper we extend previous studies of selection principles for families of open covers of sets of real numbers to also include families of countable Borel covers. The main results of the paper could be summarized as follows: 1. Some…

一般拓扑 · 数学 2010-08-02 Marion Scheepers , Boaz Tsaban

We show that, up to Morita equivalence, any finite-dimensional algebra with a suitable homological system, admits an exact Borel subalgebra. This generalizes a theorem by Koenig, K\"ulshammer and Ovsienko, which holds for quasi-hereditary…

We investigate the relation between $C^{*}$, the model of sets constructible using first order logic augmented with the "cofinality-$\omega$" quantifier, and "short" sequences of measures - sequences of measures of order $1$, which are…

逻辑 · 数学 2024-02-21 Ur Ya'ar

We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply…

逻辑 · 数学 2015-03-27 Su Gao , Steve Jackson , Edward Krohne , Brandon Seward