Source: J. Symbolic Logic
Volume 75, Issue 1
We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees
are support increasing (support strictly increasing) limitwise monotonic on various computable domains.
As applications, we provide a characterization of the sets S with computable increasing η-representations using support
increasing limitwise monotonic sets on ℚ and note relationships between the class of order-computable sets and the class of
support increasing (support strictly increasing) limitwise monotonic sets on certain domains.
Full-text: Access denied (no subscription
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Richard J. Coles, Rod Downey, and Bakhadyr Khoussainov, On initial segments of computable linear orders, Order, vol. 14 (1997/98), no. 2, pp. 107--124.
Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight, and Robert I. Soare, Bounding prime models, Journal of Symbolic Logic, vol. 69 (2004), no. 4, pp. 1117--1142.
R. G. Downey, Computability theory and linear orderings, Handbook of Recursive Mathematics, Vol. 2, Studies in Logic and the Foundations of Mathematics, vol. 139, North-Holland, Amsterdam, 1998, pp. 823--976.
Andrey N. Frolov and Maxim V. Zubkov, Increasing $\eta$-representable degrees, submitted.
Kenneth Harris, $\eta$-representations of sets and degrees, Journal of Symbolic Logic, vol. 73 (2008), no. 4, pp. 1097--1121.
Denis Hirschfeldt, Russell Miller, and Sergei Podzorov, Order-computable sets, Notre Dame Journal of Formal Logic, vol. 48 (2007), no. 3, pp. 317--347.
Asher M. Kach, Computable shuffle sums of ordinals, Archive for Mathematical Logic, vol. 47 (2008), no. 3, pp. 211--219.
N. G. Khisamiev, Criterion for constructivizability of a direct sum of cyclic $p$-groups, Izvestiya Akademii Nauk Kazakhskoi SSR. Seriya Fiziko-Matematicheskaya, vol. 1 (1981), no. 86, pp. 51--55.
Mathematical Reviews (MathSciNet): MR614069
--------, Constructive abelian groups, Handbook of Recursive Mathematics, Vol. 2, Studies in Logic and the Foundations of Mathematics, vol. 139, North-Holland, Amsterdam, 1998, pp. 1177--1231.
Bakhadyr Khoussainov, Andre Nies, and Richard A. Shore, Computable models of theories with few models, Notre Dame Journal of Formal Logic, vol. 38 (1997), no. 2, pp. 165--178.
Manuel Lerman, On recursive linear orderings, Logic Year 1979--80 (Proceedings of Seminars and Conferences in Mathematical Logic, University of Connecticut, Storrs, Connecticut, 1979/80), Lecture Notes in Mathematics, vol. 859, Springer, Berlin, 1981, pp. 132--142.
Mathematical Reviews (MathSciNet): MR619867
Joseph G. Rosenstein, Linear orderings, Pure and Applied Mathematics, vol. 98, Academic Press [Harcourt Brace Jovanovich Publishers], New York, 1982.
Mathematical Reviews (MathSciNet): MR662564
Maxim Zubkov, On $\eta$-representable sets, Computation and Logic in the Real World, Third Conference on Computability in Europe (CiE), Lecture Notes in Computer Science, vol. 4497, 2007, pp. 364--366.