K. J. Khoo, H. T. Koh, K. M. Ng. <i>A discrete linear order with non-dense punctual degrees</i> . Theoretical Computer Science, vol. 1047 (2025), Paper no. 115324, 20 pp. - N. Bazhenov, K. M. Ng, L. S. Mauro, A. Sorbi. <i>Primitive recursive equivale
K. J. Khoo, H. T. Koh, K. M. Ng. A discrete linear order with non-dense punctual degrees. Theoretical Computer Science, vol. 1047 (2025), Paper no. 115324, 20 pp. - N. Bazhenov, K. M. Ng, L. S. Mauro, A. Sorbi. Primitive recursive equivalence relations and their primitive recursive complexity. Computability, vol.11, nos. 3-4 (2022), pp. 187–221. - B. S. Kalmurzayev, N. A. Bazhenov, A. M. Iskakov. Computably enumerable equivalence relations via primitive recursive reductions, Journal of Logic and Computation, vol. 35, no. 2 (2024), Paper no. exad082, 31 pp.
Authors
- Ellen Hammatt
Institutions
- TU Wien (AT)
Publication Details
- Journal
- Bulletin of Symbolic Logic
- Published
- 2026-04-24
- DOI
- https://doi.org/10.1017/bsl.2026.10155
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Austrian Science Fund