Initial segments of recursive linear orders (Q1267600)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1210096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Initial segments of recursive linear orders |
scientific article; zbMATH DE number 1210096 |
Statements
Initial segments of recursive linear orders (English)
0 references
25 March 1999
0 references
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.
0 references
recursive linear order
0 references
initial segment
0 references
0.8450952172279358
0 references
0.7852823138237
0 references
0.7815226912498474
0 references
0.7771145701408386
0 references
