{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:26:24Z","timestamp":1725456384676},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645702"},{"type":"electronic","value":"9783540693536"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028023","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:02:06Z","timestamp":1132642926000},"page":"327-340","source":"Crossref","is-referenced-by-count":1,"title":["Existence of reduction hierarchies"],"prefix":"10.1007","author":[{"given":"Orna","family":"Kupferman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert P.","family":"Kurshan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"M. Ajtai. Recursive construction for 3-regular expanders. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 295\u2013304, 1987.","DOI":"10.1109\/SFCS.1987.50"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"H.R. Andersen. Partial model checking. In Proc. 10th IEEE Symposium on Logic in Computer Science, San Diego, June 1995.","DOI":"10.1109\/LICS.1995.523274"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"R.B. Boppana and M. Sipser. The complexity of finite functions. Handbook of Theoretical Computer Science, pages 759\u2013804, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50019-9"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0020-0190(93)90069-L","volume":"46","author":"E. M. Clarke","year":"1993","unstructured":"E. M. Clarke, I. A. Draghicescu, and R. P. Kurshan. A unified approach for showing language containment and equivalence between various types of \u03c9-automata. Information Processing Letters 46, pages 301\u2013308, (1993).","journal-title":"Information Processing Letters"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"E.M. Clarke and O. Grumberg. Avoiding the state explosion problem in temporal logic model-checking algorithms. In Proc. 6th ACM Symposium on Principles of Distributed Computing, pages 294\u2013303, Vancouver, British Columbia, August 1987.","DOI":"10.1145\/41840.41865"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"D. Kozen. Lower bounds for natural proof systems. In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 254\u2013266, 1977.","DOI":"10.1109\/SFCS.1977.16"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"R.P. Kurshan. The complexity of verification. In Proc. 26th ACM Symposium on Theory of Computing, pages 365\u2013371, Montreal, 1994.","DOI":"10.1145\/195058.195194"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.","DOI":"10.1515\/9781400864041"},{"issue":"4","key":"20_CR9","doi-asserted-by":"crossref","first-page":"425","DOI":"10.2178\/bsl\/1203350879","volume":"1","author":"A. Urquhart","year":"1995","unstructured":"A. Urquhart. The complexity of propositional proofs. The Bulletin of Symbolic Logic, 1(4):425\u2013467, December 1995.","journal-title":"The Bulletin of Symbolic Logic"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M.Y. Vardi","year":"1994","unstructured":"M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1\u201337, November 1994.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:51:01Z","timestamp":1586573461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645702","9783540693536"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0028023","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}