Joins and meets in the structure of ceers
From MaRDI portal
Publication:5211062
DOI10.3233/COM-180098zbMath1454.03048arXiv1802.09249MaRDI QIDQ5211062
Publication date: 17 January 2020
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.09249
computably enumerable equivalence relation; computable reducibility on equivalence relations; dark ceers; light ceers; self-fullness
03D20: Recursive functions and relations, subrecursive hierarchies
03D25: Recursively (computably) enumerable sets and degrees
03D45: Theory of numerations, effectively presented structures
Related Items
Primitive recursive equivalence relations and their primitive recursive complexity, Fixpoints and relative precompleteness, INITIAL SEGMENTS OF THE DEGREES OF CEERS, ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS, Computable embeddability for algebraic structures, ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS, Word problems and ceers, COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR, Classifying word problems of finitely generated algebras via computable reducibility, Lower semilattices of separable congruences of numbered algebras, Computable reducibility for computable linear orders of type \(\omega \), The category of equivalence relations, Well-orders realized by C.E. equivalence relations, Subrecursive equivalence relations and (non-)closure under lattice operations, Special classes of positive preorders, Index sets for classes of positive preorders, The theory of ceers computes true arithmetic, Classifying equivalence relations in the Ershov hierarchy, Minimal equivalence relations in hyperarithmetical and analytical hierarchies, The structure of computably enumerable preorder relations, Weakly precomplete equivalence relations in the Ershov hierarchy, Uniformly computably separable algebras with effectively splittable families of negative congruences, On universal positive graphs
