We prove the existence of a limitwise monotonic function such that, for any function , . Relativising this result we deduce the existence of an η-like computable linear ordering such that, for any function , and η-like of order type , . We prove directly that, for any computable which is either (i) strongly η-like or (ii) η-like with no strongly η-like interval, there exists -limitwise monotonic such that has order type . In so doing we provide an alternative proof to the fact that, for every η-like computable linear ordering with no strongly η-like interval, there exists computable with block relation. We also use our results to prove the existence of an η-like computable linear ordering which is categorical but not categorical.
W.Calvert, D.Cenzer, V.Harizanov and A.Morozov, Effective categoricity of equivalence structures, Annals of Pure and Applied Logic141(1,2) (2006), 61–78.
2.
R.J.Coles, R.Downey and B.Khoussainov, On initial segments of computable linear orders, Order14 (1997), 107–124.
R.Downey, Computability theory and linear orderings, in: Handbook of Recursive Mathematics, Vol.2: Recursive Algebra, Analysis and Combinatorics, Studies in Logic and the Foundations of Mathematics, Y.L.Ershov, S.S.Goncharov, A.Nerode and J.B.Remmel, eds, North Holland, 1998, pp. 823–976.
5.
R.G.Downey, A.M.Kach and D.Turetsky, Limitwise monotonic functions and their applications, in: Proceedings of the 11th Asian Logic Conference, T.Arai, Q.Feng, B.Kim, G.Wu and Y.Yang, eds, World Sci. Publ., Hackensack, NJ, 2012, pp. 59–85.
6.
R.G.Downey, B.Kastermans and S.Lempp, On computable self-embeddings of computable linear orderings, Journal of Symbolic Logic74(4) (2009), 1352–1366.
7.
R.G.Downey and M.F.Moses, On choice sets and strongly non-trivial self-embeddings of recursive linear orders, Zeitshrift Math. Logik Grundlagen Math.35 (1989), 237–246.
8.
S.Fellner, Recursiveness and finite axiomatizability of linear orderings, PhD thesis, Rutgers University, New Brunswick, New Jersey, 1976.
9.
A.N.Frolov, Low linear orderings, Journal of Logic and Computation22(4) (2012), 745–754.
C.M.Harris, On maximal block functions of computable η-like linear orderings, in: Language, Life, Limits: 10th Conference on Computablitiy in Europe, CiE 2014, Budapest, A.Beckmann, E.Csuhaj-Varjú and K.Meer, eds, Lecture Notes in Computer Science, Vol. 8493, Springer, 2014, pp. 214–223.
12.
C.M.Harris, K.I.Lee and S.B.Cooper, Automorphisms of η-like computable linear orderings, Mathematical Logic Quarterly (2015), to appear.
13.
K.Harris, η-representations of sets and degrees, Journal of Symbolic Logic73(4) (2008), 1097–1121.
14.
D.Hirschfeldt, R.Miller and S.Podzorov, Order-computable sets, Notre Dame Journal of Formal Logic48(3) (2007), 317–347.
15.
D.R.Hirschfeldt, Prime models of theories of computable linear orderings, Proceedings of the American Mathematical Society129(10) (2001), 3079–3083.
16.
A.M.Kach, Computable shuffle sums of ordinals, Archive for Mathematical Logic47(3) (2008), 211–219.
17.
N.G.Khisamiev, Criterion for constructivizability of a direct sum of cyclic p-groups, Izv. Akad. Nauk Kazakh. SSR Ser. Fiz.-Mat.1 (1981), 51–55, 86.
18.
N.G.Khisamiev, The arithmetical hierarchy of abelian groups, Sibirsk. Mat. Zh.29(6) (1988), 144–159.
19.
N.G.Khisamiev, Constructive abelian groups, in: Handbook of Recursive Mathematics Vol. 2: Recursive Algebra, Analysis and Combinatorics, Studies in Logic and the Foundations of Mathematics, Y.L.Ershov, S.S.Goncharov, A.Nerode and J.B.Remmel, eds, North Holland, 1998, pp. 1177–1231.
20.
B.Khoussainov, A.Nies and R.A.Shore, Computable models of theories with few models, Notre Dame Journal of Formal Logic38(2) (1997), 165–178.
21.
H.A.Kierstead, On -automorphisms of recursive linear orders, Journal of Symbolic Logic52 (1987), 681–688.
22.
S.Lempp, C.McCoy, R.Miller and R.Solomon, Computable categoricity of trees of finite height, Journal of Symbolic Logic70 (2005), 152–215.
23.
M.Lerman and J.G.Rosenstein, Recursive linear orderings, in: Patras Logic Symposium (Proc. Logic Sympos. Patras, Greece, Aug. 18–22, 1980), G.Metakides, ed., Studies in Logic and the Foundations of Mathematics, Vol. 109, Elsevier Science B.V., 1982, pp. 123–136.
24.
C.F.D.McCoy, -categoricity in boolean algebras and linear orderings, Annals of Pure and Applied Logic119 (2003), 85–120.
25.
M.Moses, The block relation in computable linear orders, Notre Dame Journal of Formal Logic52(3) (2011), 289–306.