Publisher
Springer International Publishing
Reference17 articles.
1. Lecture Notes in Computer Science;U Andrews,2017
2. Andrews, U., Schweber, N., Sorbi, A.: The theory of ceers computes true arithmetic. Ann. Pure Appl. Logic 171(8), 102811 (2020). https://doi.org/10.1016/j.apal.2020.102811
3. Andrews, U., Sorbi, A.: Joins and meets in the structure of ceers. Computability 8(3–4), 193–241 (2019). https://doi.org/10.3233/COM-180098
4. Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy. Studies in Logic and the Foundations of Mathematics, vol. 144. Elsevier Science B.V., Amsterdam (2000)
5. Bazhenov, N., Mustafa, M., Stephan, F., Yamaleev, M.: Boolean algebras realized by C.E. equivalence relations. Sib. Elektron. Mat. Izv. 14, 848–855 (2017). https://doi.org/10.17377/semi.2017.14.071