{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:31Z","timestamp":1725487111463},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732273"},{"type":"electronic","value":"9783540732280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73228-0_14","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:57:11Z","timestamp":1184587031000},"page":"178-193","source":"Crossref","is-referenced-by-count":2,"title":["The Omega Rule is $\\mathbf{\\Pi_{1}^{1}}$ -Complete in the \u03bb\u03b2-Calculus"],"prefix":"10.1007","author":[{"given":"Benedetto","family":"Intrigila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Statman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"URL: \n                  \n                    http:\/\/coq.inria.fr","key":"14_CR1"},{"unstructured":"URL: \n                  \n                    http:\/\/www.cl.cam.ac.uk\/Research\/HVG\/Isabelle","key":"14_CR2"},{"unstructured":"URL: \n                  \n                    http:\/\/www.cl.cam.ac.uk\/Research\/HVG\/HOL","key":"14_CR3"},{"key":"14_CR4","volume-title":"The Lambda Calculus. Its Syntax and Semantics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus. Its Syntax and Semantics. North-Holland, Amsterdam (1984)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"\u03bb-Calculus and Computer Science Theory","year":"1975","unstructured":"B\u00f6hm, C. (ed.): Lambda-Calculus and Computer Science Theory. LNCS, vol.\u00a037. Springer, Heidelberg (1975)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0168-0072(87)90040-6","volume":"34","author":"R.C. Flagg","year":"1987","unstructured":"Flagg, R.C., Myhill, J.: Implication and Analysis in Classical Frege Structure. Annals of Pure and Applied Logic\u00a034, 33\u201385 (1987)","journal-title":"Annals of Pure and Applied Logic"},{"key":"14_CR7","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. MacGraw Hill, New York (1967)"},{"key":"14_CR8","first-page":"202","volume-title":"The Omega Rule is ${\\Pi}^{0}_{2}$ -Hard in the \u03bb\u03b2-Calculus","author":"B. Intrigila","year":"2004","unstructured":"Intrigila, B., Statman, R.: The Omega Rule is \n                  \n                    \n                  \n                  ${\\Pi}^{0}_{2}$\n                -Hard in the \u03bb\u03b2-Calculus. LICS 2004, pp. 202\u2013210. IEEE Computer Society Press, Los Alamitos (2004)"},{"issue":"2-3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.apal.2003.05.001","volume":"132","author":"B. Intrigila","year":"2005","unstructured":"Intrigila, B., Statman, R.: Some Results on Extensionality in Lambda Calculus. Annals of Pure and Applied Logic\u00a0132(2-3), 109\u2013125 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"doi-asserted-by":"crossref","unstructured":"Intrigila, B., Statman, R.: Solution of a Problem of Barendregt on Sensible \u03bb-Theories. Logical Methods in Computer Science, 2(4) (2006)","key":"14_CR10","DOI":"10.2168\/LMCS-2(4:5)2006"},{"doi-asserted-by":"crossref","unstructured":"Plotkin, G.: The \u03bb-Calculus is \u03c9-incomplete. J. Symbolic Logic, 39, 313\u2013317.","key":"14_CR11","DOI":"10.2307\/2272645"},{"key":"14_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-66473-1","volume-title":"Proof Theory","author":"K. Sch\u00fctte","year":"1977","unstructured":"Sch\u00fctte, K.: Proof Theory. Springer, Heidelberg (1977)"},{"key":"14_CR13","volume-title":"Handbook of Mathematical Logic","author":"R. Statman","year":"1978","unstructured":"Statman, R.: Gentzen\u2019s Notion of a Direct Proof. In: Barwise, K.J. (ed.) Handbook of Mathematical Logic, North-Holland, Amsterdam (1978)"},{"key":"14_CR14","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/978-1-4612-2822-6_21","volume-title":"Logic from Computer Science","author":"R. Statman","year":"1992","unstructured":"Statman, R.: Normal Varieties of Combinators. In: Moschovakis, Y.N. (ed.) Logic from Computer Science, pp. 585\u2013596. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73228-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T19:54:11Z","timestamp":1550433251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73228-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732273","9783540732280"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73228-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}