Initial segments of recursive linear orders (Q1267600): Difference between revisions

It is proved that any \({\Sigma}^{0}_{2}\)-initial segment of any recursive linear order can be presented recursively. The result narrows the gap in the result of \textit{M. J. S. Raw} [Complexity of automorphisms of recursive linear orders, Ph.D. Thesis, University of Wisconsin-Madison (1995)] on initial segments of recursive linear orders of arithmetical complexity.