This research discusses punctual definability in structures and its implications for computability in graphs, suggesting new insights.
I. Kalimullin, A. Melnikov, A. Montalbán. Punctual definability on structures. Annals of Pure and Applied Logic, vol. 172, no. 8 (2021), Paper 102987, 18 pp. - R. Downey, M. Harrison-Trainor, I. Kalimullin, A. Melnikov, D. Turetsky. Graphs are not universal for online computability, Journal of Computer and System Sciences, vol. 112 (2020), pp. 1–12. - N. Greenberg, M. Harrison-Trainor, A. Melnikov, D. Turetsky. Non-density in punctual computability, Annals of Pure and Applied Logic, vol. 172, no. 9 (2021), Paper 102985, 17 pp.
No takes yet. Share an insight, caveat, or question.
Heer Tern Koh (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:
More from Bulletin of Symbolic Logic