Relations Intrinsically Recursive in Linear Orders
From MaRDI portal
Publication:3712322
DOI10.1002/malq.19860322514zbMath0586.03030OpenAlexW1991087857MaRDI QIDQ3712322
Publication date: 1986
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19860322514
Related Items
Structures computable in polynomial time. II, Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders, Computability of Fraïssé limits, ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS, Degree Spectra of Relations on Computable Structures, Computable linear orders and the ershov hierarchy, Degree spectra of relations on computable structures in the presence of Δ20isomorphisms