Transfinite sequences of topologies, descriptive complexity, and approximating equivalence relations

被引：0

作者：

Sławomir Solecki

机构：

[1] Cornell University,Department of Mathematics, Malott Hall

来源：

Israel Journal of Mathematics | 2021年 / 242卷

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We introduce the notion of filtration between topologies and study its stabilization properties. Descriptive set theoretic complexity plays a role in this study. Filtrations lead to natural transfinite sequences approximating a given equivalence relation. We investigate those.

引用

页码：933 / 953

页数：20

共 25 条

[21] Applications of descriptive set theory to classification problems for classes of structures and equivalence relations
Camerlo, R
BOLLETTINO DELLA UNIONE MATEMATICA ITALIANA, 2000, 3A (03): : 291 - 294
[22] EQUIVALENCE-RELATIONS ON LATTICES AND THE COMPLEXITY OF THE THEORY OF PERMUTATIONS WHICH COMMUTE
STERN, J
JOURNAL OF SYMBOLIC LOGIC, 1986, 51 (04) : 1102 - 1103
[23] Error Decomposition Algorithm for Approximating the k-Error Linear Complexity of Periodic Sequences
Yu, Fangwen
Su, Ming
Wang, Gang
Ren, Mingming
2016 IEEE TRUSTCOM/BIGDATASE/ISPA, 2016, : 505 - 510
[24] MUTUALLY COMPLEMENTARY FAMILIES OF T-1 TOPOLOGIES, EQUIVALENCE-RELATIONS AND PARTIAL ORDERS
STEPRANS, J
WATSON, S
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1995, 123 (07) : 2237 - 2249
[25] Modified Berlekamp-Massey Algorithm for approximating the k-error linear complexity of binary sequences
Alecu, Alexandra
Salagean, Ana
CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2007, 4887 : 220 - 232

← 1 2 3 →