{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:10Z","timestamp":1725483730788},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_46","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:28:20Z","timestamp":1178371700000},"page":"508-517","source":"Crossref","is-referenced-by-count":0,"title":["The Infinite Versions of LogSpace \u2260 P Are Consistent with the Axioms of Set Theory"],"prefix":"10.1007","author":[{"given":"Gr\u00e9gory","family":"Lafitte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Mazoyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"S. Abiteboul, M.Y. Vardi, and V. Vianu, Fixpoint logics, relational machines, and computational complexity, Proceedings of the 7th IEEE Symposium on Logic in Computer Science, 1992, pp. 156\u2013168.","DOI":"10.1109\/SCT.1992.215391"},{"key":"46_CR2","volume-title":"Finite model theory","author":"H.-D. Ebbinghaus","year":"1995","unstructured":"H.-D. Ebbinghaus and J. Flum, Finite model theory, Springer-Verlag, Berlin, 1995."},{"key":"46_CR3","volume-title":"Combinatorial set theory: Partition relations for cardinals","author":"P. Erd\u0151s","year":"1975","unstructured":"P. Erd\u0151s, A. Hajnal, A. M\u00e1t\u00e9, and R. Rado, Combinatorial set theory: Partition relations for cardinals, North-Holland, Amsterdam, 1975."},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/181773.181778","volume":"25","author":"L. Fortnow","year":"1994","unstructured":"L. Fortnow, S. Kurtz, and D. Whang, The infinite version of an open communication complexity problem is independent of the axioms of set theory, SIGACT News 25 (1994), no. 1, 87\u201389.","journal-title":"SIGACT News"},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M. Furst","year":"1984","unstructured":"M. Furst, J. Saxe, and M. Sipser, Parity, circuits and the polynomial time hierarchy, Mathematical Systems Theory 17 (1984), 13\u201327.","journal-title":"Mathematical Systems Theory"},{"key":"46_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.4064\/fm-152-3-255-265","volume":"152","author":"M. Goldstern","year":"1997","unstructured":"M. Goldstern and S. Shelah, A partial order where all monotone maps are definable, Fundamenta Mathematicae 152 (1997), 255\u2013265.","journal-title":"Fundamenta Mathematicae"},{"key":"46_CR7","unstructured":"-, Order polynomially complete lattices must be large, Algebra Universalis (1998), to appear."},{"key":"46_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","volume":"32","author":"Y. Gurevich","year":"1986","unstructured":"Y. Gurevich and S. Shelah, Fixed-point extensions of first-order logic, Annals of Pure and Applied Logic 32 (1986), 265\u2013280.","journal-title":"Annals of Pure and Applied Logic"},{"key":"46_CR9","unstructured":"J. D. Hamkins and A. Lewis, Infinite time turing machines, preprint, June 1997."},{"key":"46_CR10","volume-title":"Set theory","author":"T. Jech","year":"1978","unstructured":"T. Jech, Set theory, Academic Press, New York, 1978."},{"key":"46_CR11","unstructured":"A. Kanamori, The higher infinite, Springer Verlag, 1994."},{"key":"46_CR12","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BFb0103104","volume-title":"Higher Set Theory","author":"A. Kanamori","year":"1978","unstructured":"A. Kanamori and M. Magidor, The evolution of large cardinal axioms in set theory, Higher Set Theory Gert H. Muller and Dana S. Scott, eds., Lecture Notes in Mathematics, vol. 669, Springer Verlag, Berlin, 1978, pp. 99\u2013275."},{"key":"46_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0003-4843(79)90003-2","volume":"16","author":"A. Miller","year":"1979","unstructured":"A. Miller, On the length of Borel hierarchies, Annals of Mathematical Logic 16 (1979), 233\u2013267.","journal-title":"Annals of Mathematical Logic"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"W. Richter, Recursively mahlo ordinals and inductive definitions, Logic Colloquium\u2019 69 R. O. Gandy and C. E. M. Yates, (eds.), North-Holland, 1971, pp. 273-288.","DOI":"10.1016\/S0049-237X(08)71233-3"},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"M. Sipser, Borel sets and circuit complexity, Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 61\u201369.","DOI":"10.1145\/800061.808733"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T04:24:32Z","timestamp":1628828672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_46","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}