中文
相关论文

相关论文: Characterizing the existence of a Borel complete e…

200 篇论文

We consider an old question of Slaman and Steel: whether Turing equivalence is an increasing union of Borel equivalence relations none of which contain a uniformly computable infinite sequence. We show this question is deeply connected to…

逻辑 · 数学 2026-02-17 Adam Day , Andrew Marks

One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…

逻辑 · 数学 2026-04-29 Hongyu Zhu

We prove that orbit equivalence relations (ERs, for brevity) of generically turbulent Polish actions are not Borel reducible to ER s of a family which includes Polish actions of S_\infty, the group of all permutations of N, and is closed…

逻辑 · 数学 2018-08-16 Vladimir Kanovei , Michael Reeken

We show that canonical bases in $\dot{U}(\mathfrak{sl}_n)$ and the Schur algebra are compatible; in fact we extend this result to $p$-canonical bases. This follows immediately from a fullness result from a functor categorifying this map. In…

表示论 · 数学 2017-11-15 Ben Webster

We study possible Scott sentence complexities of linear orderings using two approaches. First, we investigate the effect of the Friedman-Stanley embedding on Scott sentence complexity and show that it only preserves…

逻辑 · 数学 2026-02-11 David Gonzalez , Dino Rossegger

The present article is part of a research program the aim of which is to find all indecomposable solvable extensions of a given class of nilpotent Lie algebras. Specifically in this article we consider a nilpotent Lie algebra n that is…

数学物理 · 物理学 2012-03-14 Libor Snobl , Pavel Winternitz

Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…

计算机科学中的逻辑 · 计算机科学 2026-03-11 Christoph Haase , Radoslaw Piórkowski

It is shown that the isomorphism relation between continuous t-norms is Borel bireducible with the relation of order isomorphism between linear orders on the set of natural numbers, and therefore, it is a Borel complete equivalence…

逻辑 · 数学 2025-12-18 Jialiang He , Lili Shen , Yi Zhou

We prove that the automorphisms of any separable C*-algebra that does not have continuous trace are not classifiable by countable structures up to unitary equivalence. This implies a dichotomy for the Borel complexity of the relation of…

算子代数 · 数学 2016-05-06 Martino Lupini

A canonization scheme for smooth equivalence relations on $\mathbb R^\omega$ modulo restriction to infinite perfect products is proposed. It shows that given a pair of Borel smooth equivalence relations $\mathsf E,\mathsf F$ on $\mathbb…

逻辑 · 数学 2020-12-04 Vladimir Kanovei , Vassily Lyubetsky

Building on work of J. Robinson and A. Shlapentokh, we develop a general framework to obtain definability and decidability results of large classes of infinite algebraic extensions of $\mathbb{F}_p(t)$. As an application, we show that for…

逻辑 · 数学 2024-09-04 Carlos Martinez-Ranero , Dubraska Salcedo , Javier Utreras

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

逻辑 · 数学 2026-02-24 Predrag Tanović

In this note, we show that if a Banach space X has a predual, then every bounded linear operator on X with a continuous functional calculus admits a bounded Borel functional calculus. A consequence of this is that on such a Banach space,…

泛函分析 · 数学 2008-04-23 Venta Terauds

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…

逻辑 · 数学 2023-10-19 Ruiyuan Chen

We prove that, for any natural number n $\ge$ 1, we can find a finite alphabet $\Sigma$ and a finitary language L over $\Sigma$ accepted by a one-counter automaton, such that the $\omega$-power L $\infty$ := {w 0 w 1. .. $\in$ $\Sigma$…

逻辑 · 数学 2020-06-16 Olivier Finkel , Dominique Lecomte

Let $G$ be a finitely generated group, and let $\Bbbk{G}$ be its group algebra over a field of characteristic $0$. A Taylor expansion is a certain type of map from $G$ to the degree completion of the associated graded algebra of $\Bbbk{G}$…

群论 · 数学 2021-05-25 Alexander I. Suciu , He Wang

We show that a formal power series has positive radius of convergence if and only if it is uniformly Borel summable over a circle with center at the origin. Consequently, we obtain that an entire function $f$ is of exponential type if and…

复变函数 · 数学 2013-09-24 Ricardo Estrada , Jasson Vindas

Suppose $E \subseteq \mathbb{R}$ is nowhere dense. If $(\mathbb{R},<,+,(x \mapsto \lambda x)_{\lambda \in \mathbb{R} }, E)$ does not define every bounded Borel subset of every $\mathbb{R}^n$ then for every $s > 0$ we have $$ | \{ k \in…

逻辑 · 数学 2020-10-21 Erik Walsberg

We investigate $\mathcal F$-Borel topological spaces. We focus on finding out how a~complexity of a~space depends on where the~space is embedded. Of a~particular interest is the~problem of determining whether a~complexity of given space $X$…

一般拓扑 · 数学 2020-02-24 Vojtěch Kovařík

We consider model-theoretic properties related to the expressive power of three analogues of $L_{\omega_1, \omega}$ for metric structures. We give an example showing that one of these infinitary logics is strictly more expressive than the…

逻辑 · 数学 2017-08-10 Christopher J. Eagle