Self-full ceers and the uniform join operator

DOI10.1093/LOGCOM/EXAA023OpenAlexW3018984611MaRDI QIDQ5158363

Uri Andrews, Andrea Sorbi, Noah Schweber

Publication date: 21 October 2021

Published in: Journal of Logic and Computation (Search for Journal in Brave)

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

zbMATH Keywords

computably enumerable equivalence relationcomputable reducibility on equivalence relationsself-full equivalence relation

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (2)

Index sets for classes of positive preorders ⋮ ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS

This page was built for publication: Self-full ceers and the uniform join operator