Joins and meets in the structure of ceers

DOI10.3233/COM-180098zbMath1454.03048arXiv1802.09249MaRDI QIDQ5211062

Uri Andrews, Unnamed Author

Publication date: 17 January 2020

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.09249

zbMATH Keywords

computably enumerable equivalence relationcomputable reducibility on equivalence relationsdark ceerslight ceersself-fullness

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items (23)

Special classes of positive preorders ⋮ Primitive recursive equivalence relations and their primitive recursive complexity ⋮ Fixpoints and relative precompleteness ⋮ Index sets for classes of positive preorders ⋮ Uniformly computably separable algebras with effectively splittable families of negative congruences ⋮ INITIAL SEGMENTS OF THE DEGREES OF CEERS ⋮ The theory of ceers computes true arithmetic ⋮ ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS ⋮ Word problems and ceers ⋮ ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR ⋮ Classifying word problems of finitely generated algebras via computable reducibility ⋮ On universal positive graphs ⋮ Lower semilattices of separable congruences of numbered algebras ⋮ Computable reducibility for computable linear orders of type \(\omega \) ⋮ 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 ⋮ The category of equivalence relations ⋮ Well-orders realized by C.E. equivalence relations ⋮ Computable embeddability for algebraic structures ⋮ Subrecursive equivalence relations and (non-)closure under lattice operations

This page was built for publication: Joins and meets in the structure of ceers