LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
From MaRDI portal
Publication:3188324
DOI10.1017/JSL.2015.11zbMath1371.03049OpenAlexW2346539614MaRDI 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
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)
Related Items (21)
Special classes of positive preorders ⋮ On dark computably enumerable equivalence relations ⋮ Computably separable models ⋮ Boolean algebras realized by c.e. equivalence relations ⋮ Uniform \(m\)-equivalencies and numberings of classical systems ⋮ INITIAL SEGMENTS OF THE DEGREES OF CEERS ⋮ The theory of ceers computes true arithmetic ⋮ Word problems and ceers ⋮ ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ Reducibilities among equivalence relations induced by recursively enumerable structures ⋮ Classifying word problems of finitely generated algebras via computable reducibility ⋮ Separable algorithmic representations of classical systems and their applications ⋮ Classifying equivalence relations in the Ershov hierarchy ⋮ A Survey on Universal Computably Enumerable Equivalence Relations ⋮ The structure of computably enumerable preorder relations ⋮ Learnability and positive equivalence relations ⋮ Negative dense linear orders ⋮ Learnability and positive equivalence relations ⋮ Structures of degrees of negative representations of linear orders ⋮ Well-orders realized by C.E. equivalence relations ⋮ EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
Cites Work
This page was built for publication: LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
