Abstract
In some recent work by Grigorieff [7], Remmel [14, 15], and Cenzer and Remmel [1, 2, 3, 4], a systematic study of polynomial time models and their relation to recursive models has been undertaken. Here we say that a structure
(where the universe A of A is a subset of {0,1}*) is recursive if A is a recursive subset of {0,1}*, S is an initial segment of the natural numbers ω = {0,1,…} and there is a recursive function s: S → ω such that each relation R A i is an s(i)-ary recursive relation over A, and T is an initial segment of ω and there is a recursive function t: T → ω such each function f A i is a partial recursive function which maps A t(i) into A. Similarly we say that a recursive structure \(A = \left( {A,\left\{ {R_i^A} \right\}i\varepsilon S,\left\{ {f_i^A} \right\}i\varepsilon T,\left\{ {c_i^A} \right\}i\varepsilon U} \right),\), is polynomial time if A is a polynomial time subset of {0,1}*, each relation is polynomial time, and each function is the restriction of a polynomial time function to A t(i). For example, Grigorieff [7] studied recursive and polynomial time linear orderings. He showed that every recursive linear ordering is recursively isomorphic to some polynomial time linear ordering and that every recursive linear ordering is isomorphic to a polynomial time linear ordering (in fact, a real time linear ordering) whose universe is the binary representation of the natural numbers, Bin(ω).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Cenzer and J.B. Remmel Polynomial-Time versus Recursive Models, Ann. Pure and Appl. Logic 54(1991), 17 – 58.
D. Cenzer and J.B. Remmel, Polynomial-time Abelian groups, Ann. Pure and Appl. Logic 56(1992), 313 – 363.
D. Cenzer and J.B. Remmel, Recursively presented games and strategies, Math. Social Sciences 24(1992), 117 – 139.
D. Cenzer and J.B. Remmel, Feasible graphs and colorings, to appear in Math. Logic Quarterly.
V. P. Dobritsa, Some constructivizations of abelian groups, Sib. Mat. Zh. 19(1978), 1260 – 1265.
Yu. L. Ershov, “Decision problems and constructivizable models”, Nauka, Moscow, 1980.
S. Grigorieff, Every Recursive Linear Ordering Has a Copy in DTIME(n), J. Symbolic Logic 55(1990), 260 – 276.
J.E. Hopcroft and J.D. Ullman, “Formal Languages and Their Relations to Automata”, Addison Wesley, 1969.
I. Kaplansky, “Infinite Abelian Groups”, University of Michigan Press, 1953.
N. G. Khisamiev, Constructive Abelian Groups, to appear in “Recursive Mathematics”, editors J. Remmel and A. Nerode.
A. I. Mal’tsev, On recursive Abelian groups, Dokl. Akad. Nauk SSSR 145(1962), 1009 – 1012.
A. T. Nurtazin, “Completable classes and algebraic conditions for autostability” Ph. D. thesis, Novosibirsk, 1974.
J.B. Remmel, Recursively categorical linear orderings, Proc. Amer. Math. Soc. 83(1981), 387 – 391.
J.B. Remmel, When is every recursive linear ordering of type fi recursively isomorphic to a p-time linear order over the binary representation of the natural numbers? in “Feasible Mathematics”, editors S. Buss and P. Scott, Prog, in Comp. Science and Appl. Logic 9, Birkhauser, 1990, 321 – 341.
J.B. Remmel, Polynomial-time categoricity and linear orderings, in “Logical Methods: In honor of Anil Nerode’s Sixtieth Birthday)”,editors J.N. Crossley, J.B. Remmel, R.A. Shore, and M.E. Sweedler, Prog, in Comp. Science and Appl. Logic, 12, Birkhauser, 1993, 713 – 747.
H. Rogers, “Theory of Recursive Functions and Effective Computability”, McGraw-Hill, 1967.
R. Smith, Two theorems on autostability in p-groups, in “Logic Year 1979–80 (Storrs, Conn.)”, Lecture Notes in Math. 859Springer-Verlag, 1981, 302 – 311.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Birkhäuser Boston
About this paper
Cite this paper
Cenzer, D., Remmel, J. (1995). Feasibly Categorical Abelian Groups. In: Clote, P., Remmel, J.B. (eds) Feasible Mathematics II. Progress in Computer Science and Applied Logic, vol 13. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-2566-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2566-9_5
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-7582-4
Online ISBN: 978-1-4612-2566-9
eBook Packages: Springer Book Archive