中文
相关论文

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

200 篇论文

We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time…

逻辑 · 数学 2019-08-16 Samuel Coskey , Joel David Hamkins

Let $A$ be a unital separable amenable \CA and $C$ be a unital \CA with certain infinite property. We show that two full monomorphisms $h_1, h_2: A\to C$ are approximately unitarily equivalent if and only if $[h_1]=[h_2]$ in $KL(A,C).$ Let…

算子代数 · 数学 2007-05-23 Huaxin Lin

We study a strengthening of the notion of a universally meager set and its dual counterpart that strengthens the notion of a universally null set. We say that a subset $A$ of a perfect Polish space $X$ is countably perfectly meager…

逻辑 · 数学 2023-04-18 Tomasz Weiss , Piotr Zakrzewski

This paper is devoted to the study of analytic equivalence relations which are Borel graphable, i.e. which can be realized as the connectedness relation of a Borel graph. Our main focus is the question of which analytic equivalence…

逻辑 · 数学 2025-12-30 Tyler Arant , Alexander S. Kechris , Patrick Lutz

Let H be a product of countably infinite number of copies of an uncountable Polish space X. Let $\Sigma_\xi$ $(\bar {\Sigma}_\xi)$ be the class of Borel sets of additive class \xi for the product of copies of the discrete topology on X (the…

逻辑 · 数学 2007-07-16 Rana Barua , Ashok Maitra

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…

逻辑 · 数学 2025-04-25 Zhaoshen Zhai

Given a bounded domain $\Omega \subset {\Bbb R}^d$ with positive measure and a finite set $A=\{a^1, a^2, \dots, a^d\}$, we say that the set ${\mathcal E}(A)={\{e^{2 \pi i x \cdot a^j}\}}_{a^j \in A}$ is a complete exponential system if for…

经典分析与常微分方程 · 数学 2020-07-17 Alex Iosevich , Azita Mayeli

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…

计算机科学中的逻辑 · 计算机科学 2022-04-12 Reijo Jaakkola

We investigate sentences which are simultaneously partially conservative over several theories. First, we generalize Bennet's results on this topic to the case of more than two theories. In particular, for any finite family $\{T_i\}_{i \leq…

逻辑 · 数学 2022-03-15 Taishi Kurahashi , Yuya Okawa , V. Yu. Shavrukov , Albert Visser

This paper proposes a new notion of typical sequences on a wide class of abstract alphabets (so-called standard Borel spaces), which is based on approximations of memoryless sources by empirical distributions uniformly over a class of…

信息论 · 计算机科学 2016-11-17 Maxim Raginsky

For any limit ordinal $\lambda$, we construct a linear order $L_\lambda$ whose Scott complexity is $\Sigma_{\lambda+1}$. This completes the classification of the possible Scott sentence complexities of linear orderings. Previously, there…

We look at a class of transcendental real numbers xi which, together with their square, satisfy some extremal property of simultaneous approximation by rational numbers with the same denominator. We give a sufficient condition for such a…

数论 · 数学 2013-01-07 Damien Roy

We study the class $\mathcal{M}_p$ of Schur multipliers on the Schatten-von Neumann class $\mathcal{S}_p$ with $1 \leq p \leq \infty$ as well as the class of completely bounded Schur multipliers $\mathcal{M}_p^{cb}$. We first show that for…

泛函分析 · 数学 2020-02-17 Martijn Caspers , Guillermo Wildschut

We show that every countable Borel equivalence relation structurable by $n$-dimensional contractible simplicial complexes embeds into one which is structurable by such complexes with the further property that each vertex belongs to at most…

逻辑 · 数学 2017-09-22 Ruiyuan Chen

We identify complete fragments of the Simple Theory of Types with Infinity ($\mathrm{TSTI}$) and Quine's $\mathrm{NF}$ set theory. We show that $\mathrm{TSTI}$ decides every sentence $\phi$ in the language of type theory that is in one of…

逻辑 · 数学 2017-10-18 Anuj Dawar , Thomas Forster , Zachiri McKenzie

We prove that every finite Borel measure $\mu$ in $\mathbb{R}^N$ that is bounded from above by the Hausdorff measure $\mathcal{H}^s$ can be split in countable many parts $\mu\lfloor_{E_k}$ that are bounded from above by the Hausdorff…

经典分析与常微分方程 · 数学 2025-02-05 Antoine Detaille , Augusto C. Ponce

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

逻辑 · 数学 2016-09-06 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

Let $A(G)$ and $B(H)$ be the Fourier and Fourier-Stieltjes algebras of locally compact groups $G$ and $H$, respectively. Ilie and Spronk have shown that continuous piecewise affine maps $\alpha: Y \subseteq H\rightarrow G$ induce completely…

泛函分析 · 数学 2022-06-01 Matthew Daws

A Borel equivalence relation on a Polish space is said to be countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in…

逻辑 · 数学 2007-05-23 Randall Dougherty , Alexander S. Kechris

We characterise the class of exponentiable $\infty$-toposes: $\mathcal X$ is exponentiable if and only if $\mathcal S\mathrm{h}(\mathcal X)$ is a continuous $\infty$-category. The heart of the proof is the description of the…

范畴论 · 数学 2018-03-01 Mathieu Anel , Damien Lejay