{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:54Z","timestamp":1747548354857},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665885"},{"type":"electronic","value":"9783540481188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48118-4_42","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T01:30:57Z","timestamp":1195003857000},"page":"1738-1757","source":"Crossref","is-referenced-by-count":4,"title":["Logspace reducibility via abstract state machines"],"prefix":"10.1007","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Spielmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,9,17]]},"reference":[{"key":"42_CR1","unstructured":"S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addision-Wesley, 1995."},{"key":"42_CR2","unstructured":"A. Blass, Y. Gurevich, and S. Shelah. Choiceless Polynomial Time. Technical Report CSE-TR-338-97, University of Michigan, May 1997."},{"key":"42_CR3","first-page":"105","volume":"64","author":"E. B\u00f6rger","year":"1998","unstructured":"E. B\u00f6rger and J. Huggins. Abstract State Machines 1988-1998: Commented ASM Bibliography. Bulletin of the EATCS, 64:105\u2013127, February 1998.","journal-title":"Bulletin of the EATCS"},{"key":"42_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","volume":"25","author":"A. Chandra","year":"1982","unstructured":"A. Chandra and D. Harel. Structure and Compexity of Relational Queries. Journal of Computer and System Sciences, 25:99\u2013128, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"H. D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-28788-4"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation\u2013P-Completeness Theory. Oxford University Press, 1995.","DOI":"10.1093\/oso\/9780195085914.001.0001"},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/inco.1995.1081","volume":"119","author":"E. Gr\u00e4del","year":"1995","unstructured":"E. Gr\u00e4del and G. McColm. On the Power of Deterministic Transitive Closures. Information and Computation, 119:129\u2013135, 1995. See also: Deterministic versus Nondeterministic Transitive Closure Logic, in Proceedings of 7th IEEE Symposium on Logic in Computer Science (LICS \u201892), 58-63.","journal-title":"Information and Computation"},{"key":"42_CR8","unstructured":"Y. Gurevich. Logic and the Challenge of Computer Science. In E. B\u00f6rger, editor, Current Trends in Theoretical Computer Science, pages 1\u201357. Computer Science Press, 1988."},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Y. Gurevich. Evolving Algebras: An attempt to discover semantics. Bulletin of the EATCS, 43:264\u2013284, 1991. a slightly revised version in G. Rozenberg and A. Salomaa, editors, Current Trends in Theoretical Computer Science, pages 266-292, World Scientific, dy1993.","DOI":"10.1142\/9789812794499_0021"},{"key":"42_CR10","unstructured":"Y. Gurevich. Evolving Algebras 1993: Lipari Guide. In E. B\u00f6rger, editor, Specification and Validation Methods, pages 9\u201336. Oxford University Press, 1995."},{"key":"42_CR11","unstructured":"Y. Gurevich. May 1997 Draft of the ASM Guide. Technical Report CSETR-336-97, University of Michigan, May 1997."},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"W. Hodges. Model Theory. Cambridge University Press, 1993.","DOI":"10.1017\/CBO9780511551574"},{"key":"42_CR13","unstructured":"N. Immerman. Personal communication, 1992."},{"key":"42_CR14","unstructured":"N. Immerman. Personal communication, 1992."},{"key":"42_CR15","unstructured":"C. H. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, 1994."}],"container-title":["Lecture Notes in Computer Science","FM\u201999 \u2014 Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48118-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T15:38:58Z","timestamp":1630078738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48118-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665885","9783540481188"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48118-4_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}