Publisher
Springer International Publishing
Reference16 articles.
1. Andrews, U., Lempp, S., Miller, J.S., Ng, K.M., San Mauro, L., Sorbi, A.: Universal computably enumerable equivalence relations. J. Symbolic Logic 79(1), 60–88 (2014)
2. Andrews, U., Sorbi, A.: Effective inseparability, lattices, and pre-ordering relations. Rev. Symbolic Logic. 13, 1–28 (2019). https://doi.org/10.1017/S1755020319000273
3. Buss, S.R.: Bounded Arithmetic, Studies in Proof Theory. Lecture Notes, vol. 3. Bibliopolis, Naples (1986)
4. Cleave, J.P.: Creative functions. Z. Math. Logik Grundlagen Math. 7, 205–212 (1961)
5. Delle Rose, V., San Mauro, L.F., Sorbi, A.: Word problems and ceers. Math. Logic Q. 66(3), 341–354 (2020)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Well-Orders Realized by C.E. Equivalence Relations;Revolutions and Revelations in Computability;2022