{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:27Z","timestamp":1725664407610},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601784"},{"type":"electronic","value":"9783540447207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60178-3_91","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:49:16Z","timestamp":1330260556000},"page":"300-312","source":"Crossref","is-referenced-by-count":2,"title":["Feasibly categorical models"],"prefix":"10.1007","author":[{"given":"Douglas","family":"Cenzer","sequence":"first","affiliation":[]},{"given":"Jeffrey B.","family":"Remmel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0168-0072(91)90008-A","volume":"54","author":"D. Cenzer","year":"1991","unstructured":"Cenzer,D., Remmel, J.: Polynomial-time versus recursive models. Ann. Pure and Appl. Logic 54 (1991) 17\u201358","journal-title":"Ann. Pure and Appl. Logic"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0168-0072(92)90076-C","volume":"56","author":"D. Cenzer","year":"1992","unstructured":"Cenzer,D., Remmel, J.: Polynomial-time Abelian groups. Ann. Pure and Appl. Logic 56 (1992) 313\u2013363","journal-title":"Ann. Pure and Appl. Logic"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0165-4896(92)90059-E","volume":"24","author":"D. Cenzer","year":"1992","unstructured":"Cenzer,D., Remmel, J.: Recursively presented games and strategies. Math. Social Sciences 24 (1992) 117\u2013139","journal-title":"Math. Social Sciences"},{"unstructured":"Cenzer,D., Remmel, J.: Feasible graphs and colorings. Math. Logic Quarterly (to appear)","key":"16_CR4"},{"unstructured":"Cenzer,D., Remmel, J.: Feasibly categorical abelian groups, in \u201cFeasible Mathematics II\u201d editors P. Clote and J. Remmel, Prog, in Comp. Science and Appl. Logic 13, Birkh\u00e4user (1995) 91\u2013154","key":"16_CR5"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/BF01668470","volume":"14","author":"S.S. Goncharov","year":"1975","unstructured":"Goncharov, S.S.: Autostability and computable families of constructivization. Algebra and Logic 14 (1975) 392\u2013409","journal-title":"Algebra and Logic"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BF01669102","volume":"19","author":"S.S. Goncharov","year":"1980","unstructured":"Goncharov, S.S., Dzgoev, V.D.: Autostability of models. Algebra and Logic 19 (1980) 28\u201337","journal-title":"Algebra and Logic"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"260","DOI":"10.2307\/2274966","volume":"55","author":"S. Grigorieff","year":"1990","unstructured":"Grigorieff, S.: Every Recursive linear ordering has a copy in DTIME(n). J. Symbolic Logic 55 (1990) 260\u2013276","journal-title":"J. Symbolic Logic"},{"unstructured":"Hopcroft, J., Ullman, J.: \u201cFormal Languages and Their Relations to Automata\u201d. Addison Wesley (1969)","key":"16_CR9"},{"unstructured":"Nerode, A., Remmel, J.: Complexity theoretic algebra I, vector spaces over finite fields, in \u201cProceedings of Structure in Complexity, 2d Annual Conference\u201d, Computer Science Press (1987) 218\u2013239","key":"16_CR10"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0168-0072(89)90047-X","volume":"44","author":"A. Nerode","year":"1989","unstructured":"Nerode, A., Remmel, J.: Complexity theoretic algebra II, the free Boolean algebra. Ann. Pure and Applied Logic 44 (1989) 71\u201399","journal-title":"Ann. Pure and Applied Logic"},{"unstructured":"Nerode, A., Remmel, J.: Complexity theoretic algebra: vector space bases, in \u201cFeasible Mathematics\u201d, editors S. Buss and P. Scott, Prog. in Comp. Science and Appl. Logic 9 Birkh\u00e4user (1990) 293\u2013319","key":"16_CR12"},{"unstructured":"Nurtazin, A.: \u201cCompletable classes and algebraic conditions for autostability\u201d. Ph. D. thesis, Novosibirsk (1974)","key":"16_CR13"},{"key":"16_CR14","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1090\/S0002-9939-1981-0624937-1","volume":"83","author":"J. Remmel","year":"1981","unstructured":"Remmel, J.: Recursively categorical linear orderings. Proc. Amer. Math. Soc. 83 (1981) 387\u2013391","journal-title":"Proc. Amer. Math. Soc."},{"unstructured":"Remmel, J.: When is every recursive linear ordering of type \u03bc recursively isomorphic to a p-time linear order over the binary representation of the natural numbers?, in \u201cFeasible Mathematics\u201d, editors S. Buss and P. Scott, Prog. in Comp. Science and Appl. Logic 9 Birkh\u00e4user (1990) 321\u2013341","key":"16_CR15"},{"doi-asserted-by":"crossref","unstructured":"Remmel, J. Polynomial-time categoricity and linear orderings, in \u201cLogical Methods\u201d, editors J. Crossley, J. Remmel, R. Shore, and M. Sweedler, Prog. in Comp. Science and Appl. Logic 12 Birkh\u00e4user (1993) 321\u2013341","key":"16_CR16","DOI":"10.1007\/978-1-4612-0325-4_24"}],"container-title":["Lecture Notes in Computer Science","Logic and Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60178-3_91.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:55:48Z","timestamp":1605628548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60178-3_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601784","9783540447207"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-60178-3_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}