{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:34Z","timestamp":1761610354733,"version":"build-2065373602"},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":4958,"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":[[2000]]},"DOI":"10.1016\/s1571-0661(05)01133-3","type":"journal-article","created":{"date-parts":[[2005,4,8]],"date-time":"2005-04-08T09:19:45Z","timestamp":1112951985000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Long Normal Form Proof Search and Counter-Model Generation"],"prefix":"10.1016","volume":"37","author":[{"given":"Sachio","family":"Hirokawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daisuke","family":"Nagano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S1571-0661(05)01133-3_bib1","doi-asserted-by":"crossref","first-page":"795","DOI":"10.2307\/2275431","article-title":"Contraction-free sequent calculi for intuitionistic logic","volume":"57","author":"Dyckhoff","year":"1992","journal-title":"Journal of Symbolic Logic"},{"year":"1969","series-title":"Intuitionistic Logic, Model Theory, and Forcing","author":"Fitting","key":"10.1016\/S1571-0661(05)01133-3_bib2"},{"key":"10.1016\/S1571-0661(05)01133-3_bib3","doi-asserted-by":"crossref","unstructured":"D. Galmiche, D. Larchey-Wendling, Structural sharing and efficient proof-search in propositional intuitionistic logic, Asian Computing Science Conference, ASIAN'99, LNCS 1742, 101\u2013112, 1999.","DOI":"10.1007\/3-540-46674-6_10"},{"year":"1996","series-title":"The Basic Type Theory","author":"Hindley","key":"10.1016\/S1571-0661(05)01133-3_bib4"},{"key":"10.1016\/S1571-0661(05)01133-3_bib5","doi-asserted-by":"crossref","unstructured":"L. Pinto, R. Dyckhoff, Loop-free construction of counter-models for intuitionistic propositional logic. In Behara and al., editors, Symposia Gaussian, 225\u2013232, 1995.","DOI":"10.1515\/9783110886726.225"},{"key":"10.1016\/S1571-0661(05)01133-3_bib6","unstructured":"D. Prawitz, Natural Deduction, Almqvist and Wiksell (1965)"},{"key":"10.1016\/S1571-0661(05)01133-3_bib7","unstructured":"A. Stoughton, Porgi: a Proof-Or-Refutation Generator for Intuitionistic propositional logic, In D. Galmiche, editor, CADE Workshop on Proof-search in Type-theoretic Languages, 109\u2013116, 1996."},{"key":"10.1016\/S1571-0661(05)01133-3_bib8","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1006\/inco.1996.0027","article-title":"Normal Proofs and Their Grammar","volume":"125","author":"Takahashi","year":"1996","journal-title":"Information and Computation"},{"year":"1996","series-title":"Basic Proof Theory","author":"Troelstra","key":"10.1016\/S1571-0661(05)01133-3_bib9"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011333?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011333?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:06:36Z","timestamp":1761609996000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105011333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":9,"alternative-id":["S1571066105011333"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)01133-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Long Normal Form Proof Search and Counter-Model Generation","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(05)01133-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier Science B.V. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}