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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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 equivale

Ellen Hammatt
Bulletin of Symbolic Logic
Computability, Logic, AI Algorithms
article

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 equivale

Ellen Hammatt
article en

Abstract

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.

Bulletin of Symbolic Logic
TU Wien (AT)
Austrian Science Fund
Openalex Percentile: Top 4%
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.