Abstract
We completely describe ranges of η-functions of η-like linear orderings without computable presentations.
References
J. R. Rosenstein, Linear Orderings, Pure and Applied Mathematics 98 (Academic Press Inc., Hartcourt Brace Jovanovich Publishers, New York-London, 1982).
S. Fellner, “Recursive and Finite Axiomatizability of Linear Orderings,” Ph. D. Thesis (Rutgers Univ., New Brundswick, NJ, 1976).
M. Lerman and J. R. Rosenstein, “Recursive Linear Orderings,” in Patras Logic Symposion (Proc. Logic Sympos. Patras, Greece, Aug. 18–22, 1980), Ed. by G. Metakides (Stud. Logic Found. Math., 1982), Vol. 109, pp. 123–136.
R. G. Downey, “Recursion Theory and Linear Orderings,” Handbook of Computable Algebra, Ed. by Yu. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel, 1998.
A. N. Frolov, “Presentations of the Successor Relation of Computable Linear Ordering,” Izv. Vyssh. Uchebn. Zaved. Mat., No. 7, 73–85 (2010) [Russian Mathematics (Iz. VUZ) 54 (7), 64–74 (2010)].
A. N. Frolov, “Δ 02 Copies of Linear Orderings,” Algebra and Logic 45(3), 354–370 (2006).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.N. Frolov, 2012, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2012, No. 3, pp. 96–99.
Submitted by M.M. Arslanov
About this article
Cite this article
Frolov, A.N. Ranges of η-functions of η-like linear orderings. Russ Math. 56, 87–89 (2012). https://doi.org/10.3103/S1066369X12030115
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1066369X12030115