Abstract
We define a notion of a Scott family of formulas for a feasible model and give various conditions on a Scott family which imply that two models with the same family are feasibly isomorphic. For example, if A and B possess a common strongly p-time Scott family and both have universe {1}*, then they are p-time isomorphic. These results are applied to the study of permutation structures, linear orderings, equivalence relations, and Abelian groups. For example, conditions on two permutation structures (A, f) and (B, g) are given which imply that (A, f) and (B, g) are p-time isomorphic.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Cenzer,D., Remmel, J.: Polynomial-time versus recursive models. Ann. Pure and Appl. Logic 54 (1991) 17–58
Cenzer,D., Remmel, J.: Polynomial-time Abelian groups. Ann. Pure and Appl. Logic 56 (1992) 313–363
Cenzer,D., Remmel, J.: Recursively presented games and strategies. Math. Social Sciences 24 (1992) 117–139
Cenzer,D., Remmel, J.: Feasible graphs and colorings. Math. Logic Quarterly (to appear)
Cenzer,D., Remmel, J.: Feasibly categorical abelian groups, in “Feasible Mathematics II” editors P. Clote and J. Remmel, Prog, in Comp. Science and Appl. Logic 13, Birkhäuser (1995) 91–154
Goncharov, S.S.: Autostability and computable families of constructivization. Algebra and Logic 14 (1975) 392–409
Goncharov, S.S., Dzgoev, V.D.: Autostability of models. Algebra and Logic 19 (1980) 28–37
Grigorieff, S.: Every Recursive linear ordering has a copy in DTIME(n). J. Symbolic Logic 55 (1990) 260–276
Hopcroft, J., Ullman, J.: “Formal Languages and Their Relations to Automata”. Addison Wesley (1969)
Nerode, A., Remmel, J.: Complexity theoretic algebra I, vector spaces over finite fields, in “Proceedings of Structure in Complexity, 2d Annual Conference”, Computer Science Press (1987) 218–239
Nerode, A., Remmel, J.: Complexity theoretic algebra II, the free Boolean algebra. Ann. Pure and Applied Logic 44 (1989) 71–99
Nerode, A., Remmel, J.: Complexity theoretic algebra: vector space bases, in “Feasible Mathematics”, editors S. Buss and P. Scott, Prog. in Comp. Science and Appl. Logic 9 Birkhäuser (1990) 293–319
Nurtazin, A.: “Completable classes and algebraic conditions for autostability”. Ph. D. thesis, Novosibirsk (1974)
Remmel, J.: Recursively categorical linear orderings. Proc. Amer. Math. Soc. 83 (1981) 387–391
Remmel, J.: When is every recursive linear ordering of type μ 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 Birkhäuser (1990) 321–341
Remmel, J. Polynomial-time categoricity and linear orderings, in “Logical Methods”, editors J. Crossley, J. Remmel, R. Shore, and M. Sweedler, Prog. in Comp. Science and Appl. Logic 12 Birkhäuser (1993) 321–341
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cenzer, D., Remmel, J.B. (1995). Feasibly categorical models. In: Leivant, D. (eds) Logic and Computational Complexity. LCC 1994. Lecture Notes in Computer Science, vol 960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60178-3_91
Download citation
DOI: https://doi.org/10.1007/3-540-60178-3_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60178-4
Online ISBN: 978-3-540-44720-7
eBook Packages: Springer Book Archive