LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
From MaRDI portal
Publication:3188324
DOI10.1017/jsl.2015.11zbMath1371.03049MaRDI QIDQ3188324
Pavel Semukhin, Bakhadyr Khoussainov, Ekaterina B. Fokina, Daniel D. Turetsky
Publication date: 19 August 2016
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1508bbab823fcce33b22dcc5d2f1c615646e263a
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
03D45: Theory of numerations, effectively presented structures
Related Items
EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS, INITIAL SEGMENTS OF THE DEGREES OF CEERS, ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS, Learnability and positive equivalence relations, Word problems and ceers, Classifying word problems of finitely generated algebras via computable reducibility, Separable algorithmic representations of classical systems and their applications, Reducibilities among equivalence relations induced by recursively enumerable structures, On dark computably enumerable equivalence relations, Negative dense linear orders, Structures of degrees of negative representations of linear orders, Well-orders realized by C.E. equivalence relations, Special classes of positive preorders, Computably separable models, The theory of ceers computes true arithmetic, Classifying equivalence relations in the Ershov hierarchy, Learnability and positive equivalence relations, Boolean algebras realized by c.e. equivalence relations, Uniform \(m\)-equivalencies and numberings of classical systems, A Survey on Universal Computably Enumerable Equivalence Relations
Cites Work
