{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:45Z","timestamp":1761610125492,"version":"build-2065373602"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3954,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s1571-0661(04)80545-0","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"131-147","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Studying provability in implicational intuitionistic logic"],"prefix":"10.1016","volume":"67","author":[{"given":"Sabine","family":"Broda","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Damas","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB1","unstructured":"T. Aoto, and H. Ono. Uniqueness of normal proofs in {\u2192, \u00ac}-fragment of NJ. Research Report IS-RR-94-0024F, School of Information Science, JAIST."},{"issue":"2","key":"10.1016\/S1571-0661(04)80545-0_NEWBIB2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1008254111992","article-title":"Uniqueness of Normal Proofs in Implicational Intuitionistic Logic","volume":"8","author":"Aoto","year":"1999","journal-title":"Journal of Logic, Language & Information"},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB3","series-title":"Background: Computational Structures, volume 2 of Handbook of Logic in Computer Science","first-page":"117","article-title":"Lambda calculi with types","author":"Barendregt","year":"1992"},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB4","unstructured":"C.-B. Ben-Yelles. Type-assignment in the lambda-calculus; syntax and semantics. PhD thesis, Mathematics Dept., University of Wales Swansea, UK, 1979."},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB5","doi-asserted-by":"crossref","unstructured":"S. Broda and L. Damas. Counting a type's principal inhabitants. Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications, TLCA'99, Lecture Notes in Computer Science 1581, p\u00e1g. 69-82, Springer Verlag, 1999.","DOI":"10.1007\/3-540-48959-2_7"},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB6","unstructured":"S. Broda, and L. Damas. On the structure of normal \u03bb-terms having a certain type. Proceedings of 7th WoLLIC'2000, pp. 33\u201343, 2000."},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB7","first-page":"33","article-title":"Counting a type's (principal) inhabitants","volume":"45","author":"Broda","year":"2001","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0304-3975(99)00174-7","article-title":"Proof finding algorithms for implicational logics","volume":"232","author":"Bunder","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB9","series-title":"Cambridge Tracts in Theoretical Computer Science","article-title":"Basic Simple Type Theory","author":"Hindley","year":"1997"},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(93)90171-O","article-title":"Principal types of BCK-lambda-terms","volume":"107","author":"Hirokawa","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB11","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0304-3975(97)00168-0","article-title":"Note: Infiniteness of proof(\u03b1) is polynomial-space complete","volume":"206","author":"Hirokawa","year":"1998","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB12","series-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"479","article-title":"The formulae-as-types notion of construction","author":"Howard","year":"1980"},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB13","unstructured":"Y. Komori. BCK algebras and lambda calculus. Proceedings of 10th Symmposium on Semigroups, pp. 5\u201311, 1986."},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB14","series-title":"Selected Papers in Proof Theory","first-page":"213","article-title":"A simple proof of the coherence theorem for cartesian closed categories","author":"Mints","year":"1992"},{"key":"10.1016\/S1571-0661(04)80545-0_NEWBIB15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(79)90006-9","article-title":"Intuitionistic propositional logic is polynomial-space complete","volume":"9","author":"Statman","year":"1979","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10.1016\/S1571-0661(04)80545-0_NEWBIB16","doi-asserted-by":"crossref","first-page":"789","DOI":"10.2307\/2275097","article-title":"Uniqueness of normal proofs of minimal formulas","volume":"58","author":"Tatsuta","year":"1993","journal-title":"Journal of Symbolic Logic"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805450?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805450?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:33Z","timestamp":1761609933000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":16,"alternative-id":["S1571066104805450"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80545-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Studying provability in implicational intuitionistic logic","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80545-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}