Abstract
We prove the existence of a computable η-like linear ordering such that, for any \(\Pi^0_2\) function G : ℚ → ℕ ∖ {0} and linear ordering , does not have order type τ = ∑ { G(q) | q ∈ ℚ }.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Downey, R.G., Moses, M.F.: On choice sets and strongly non-trivial self-embeddings of recursive linear orders. Zeitshrift Math. Logik Grundlagen Math. 35, 237–246 (1989)
Downey, R.: Computability theory and linear orderings. In: Ershov, Y.L., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics. Recursive Algebra, Analysis and Combinatorics, Studies in Logic and the Foundations of Mathematics, vol. 2, pp. 823–976. North Holland (1998)
Fellner, S.: Recursiveness and Finite Axiomatizability of Linear Orderings. PhD thesis, Rutgers University, New Brunswick, New Jersey (1976)
Harris, K.: η-representations of sets and degrees. Journal of Symbolic Logic 73(4), 1097–1121 (2008)
Jockusch, C.G.: Semirecursive Sets and Positive Reducibility. Trans. Amer. Math. Soc. 131, 420–436 (1968)
Kach, A.M.: Computable shuffle sums of ordinals. Archive for Mathematical Logic 47(3), 211–219 (2008)
Kierstead, H.A.: On Π1-automorphisms of recursive linear orders. Journal of Symbolic Logic 52, 681–688 (1987)
Harris, C.M., Lee, K.I., Cooper, S.B.: Automorphisms of computable linear orders and the Ershov hierarchy (in preparation, 2014)
Lerman, M., Rosenstein, J.G.: Recursive linear orderings. In: Metakides, G. (ed.) Patras Logic Symposium (Proc. Logic Sympos. Patras). Studies in Logic and the Foundations of Mathematics, Greece, August 18-22, vol. 109, pp. 123–136. Elsevier Science B.V. (1982)
Odifreddi, P.G.: Classical Recursion Theory. Elsevier Science B.V., Amsterdam (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Harris, C.M. (2014). On Maximal Block Functions of Computable η-like Linear Orderings. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds) Language, Life, Limits. CiE 2014. Lecture Notes in Computer Science, vol 8493. Springer, Cham. https://doi.org/10.1007/978-3-319-08019-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-08019-2_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08018-5
Online ISBN: 978-3-319-08019-2
eBook Packages: Computer ScienceComputer Science (R0)