arXiv 1605.044842016-05-15math.LOmath.PR

Relative exchangeability with equivalence relations

Harry Crane, Henry Towsner

英文摘要：

We describe an Aldous--Hoover-type characterization of random relational structures that are exchangeable relative to a fixed structure which may have various equivalence relations. Our main theorem gives the common generalization of the results on relative exchangeability due to Ackerman \cite{Ackerman2015} and Crane and Towsner \cite{CraneTowsner2015} and hierarchical exchangeability results due to Austin and Panchenko \cite{AustinPanchenko2014}.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

何时不变性蕴含可交换性（及其在不变 Keisler 测度中的应用）

When invariance implies exchangeability (and applications to invariant Keisler measures)

本文刻画可数齐次结构膨胀空间上自同构不变测度何时可交换，并将结果用于分类多种结构的不变 Keisler 测度及构造零测公式。

2025-02-20math.COmath.DSmath.LO

Relative primeness and Borel partition properties for equivalence relations

We introduce a notion of relative primeness for equivalence relations, strengthening the notion of non-reducibility, and show for many standard benchmark equivalence relations that non-reducibility may be strengthened to relative primeness. We introduce several analogues of cardinal properties for Borel equivalence relations, including the notion of a prime equivalence relation and Borel partition properties on quotient spaces. In particular, we introduce a notion of Borel weak compactness, and characterize partition properties for the equivalence relations ${\mathbb F}_2$ and ${\mathbb E}_1$.…

2021-04-16math.LO

Degrees of bi-embeddable categoricity of equivalence structures

We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, (relative) $Δ^0_α$ bi-embeddable categoricity, and degrees of bi-embeddable categoricity. These notions mirror the classical notions used to study the complexity of isomorphisms between structures. We show that the notions of $Δ^0_α$ bi-embeddable categoricity and relative $Δ^0_α$ bi-embeddable categoricity coincide for equivalence structures for $α=1,2,3$. We also prove that computable equivalence structures have degree of bi-embeddabl…

2017-10-30math.LO

满足超算术递归的解析等价关系

Analytic equivalence relations satisfying hyperarithmetic-is-recursive

在ZF+ $\bfΣ^1_2$ -决定性中，我们证明了对于任何解析等价关系$E$，以下三个陈述是等价的：（1）$E$不具有完全多的类，（2）$E$满足锥上的超算术递归，以及（3）相对于某个预言，对于每个等价类$[Y]_E$，我们有一个真正的$X$计算等价类的成员当且仅当$\om_1^X\geq\om_1^{[Y]}$。我们还证明了从（1）到（2）的蕴涵等价于$ZF$上尖的存在性。

2013-06-11math.LO

Abstraction Principles and the Classification of Second-Order Equivalence Relations

This paper improves two existing theorems of interest to neo-logicist philosophers of mathematics. The first is a classification theorem due to Fine for equivalence relations between concepts definable in a well-behaved second-order logic. The improved theorem states that if an equivalence relation $E$ is defined without non-logical vocabulary, then the bicardinal slice of any equivalence class---those equinumerous elements of the equivalence class with equinumerous complements---can have one of only three profiles. The improvements to Fine's theorem allow for an analysis of the well-behaved m…

2018-03-06math.LO

Abelian pro-countable groups and non-Borel orbit equivalence relations

We study topological groups that can be defined as Polish, pro-countable abelian groups, as non-archimedean abelian groups or as quasi-countable abelian groups, i.e., Polish subdirect products of countable, discrete groups, endowed with the product topology. We characterize tame groups in this class, i.e., groups such that all orbit equivalence relations induced by their continuous actions on Polish spaces are Borel, and relatively tame groups $G$, i.e., groups such that every diagonal action $α\times β$ of $G$ induces a Borel orbit equivalence relation, provided that the actions $α$, $β$ of $…

2016-04-25math.GRmath.LO

更多相关论文收起更多论文

从可计算性理论看等价关系和前序的复杂性

Complexity of equivalence relations and preorders from computability theory

从可计算性理论和复杂性理论出发，研究了等价关系和前序的相对复杂性。给定二元关系$R, S$，按分量约简由$ R\le S \iff \ex f \, \forall x, y \, [xRy \lra f(x) Sf(y)]. $定义。对我们来说，关系将是自然数，$f$必须是可计算的。证明了对于$k \ge 2$，存在$Π_1$ -完全等价关系，但不存在$Πk$ -完全等价关系.我们表明，自然产生的$Σk$前序在上述领域是$Σk$ -完全的。这包括多项式时间$m$ -指数时间集上的约简，即$Σ2$，几乎包含在r. e上。集合，也就是$Σ3$，以及r.e.上的图灵归约。\集合，即$Σ4$。

2013-10-13math.LO

Borel等价关系与Lascar强类型

Borel equivalence relations and Lascar strong types

Lascar强型空间，在某种类型上，相对于给定的一阶理论T，一般不是紧的T2空间。本文至少有三个目的。第一个证明了Lascar强类型空间和其他相关空间，如Lascar群，具有定义良好的Borel基数。第二是计算已知例子以及一些新例子的Borel基数。第三是探索可定义映射，嵌入和同构这些和相关的商对象之间的概念。写这篇论文的动机是最近发现，通过可定义的群体，新的例子，非G紧一阶理论。

2012-04-16math.LO

Classical and Relative Realizability

We show that every abstract Krivine structure in the sense of Streicher can be obtained, up to equivalence of the resulting tripos, from a filtered opca (A,A') and a subobject of 1 in the relative realizability topos RT(A',A); the topos is always a Booleanization of a closed subtopos of RT(A',A). We exhibit a range of non-localic Boolean subtoposes of the Kleene-Vesley topos.

2016-03-11math.CTmath.LO

The Complexity of the Classification Problems of Finite-Dimensional Continua

We consider the homeomorphic classification of finite-dimensional continua as well as several related equivalence relations. We show that, when $n \geq 2$, the classification problem of $n$-dimensional continua is strictly more complex than the isomorphism problem of countable graphs. We also obtain results that compare the relative complexity of various equivalence relations.

2019-04-21math.GNmath.LO