The block relation in computable linear orders

DOI10.1215/00294527-1435465zbMath1260.03085arXiv0904.4286OpenAlexW2130772103MaRDI QIDQ645746

Michael Moses

Publication date: 10 November 2011

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0904.4286

zbMATH Keywords

computable linear orderblock relationself-embedding

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

On limitwise monotonicity and maximal block functions ⋮ A computably enumerable partial ordering without computably enumerable maximal chains and antichains ⋮ Computable linear orders and limitwise monotonic functions

This page was built for publication: The block relation in computable linear orders