{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:38Z","timestamp":1740099098539,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662576687"},{"type":"electronic","value":"9783662576694"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-662-57669-4_1","type":"book-chapter","created":{"date-parts":[[2018,6,26]],"date-time":"2018-06-26T04:48:51Z","timestamp":1529988531000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Inhabitants of Intuitionistic Implicational Theorems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6769-9704","authenticated-orcid":false,"given":"Katalin","family":"Bimb\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,27]]},"reference":[{"key":"1_CR1","volume-title":"Entailment: The Logic of Relevance and Necessity","author":"AR Anderson","year":"1992","unstructured":"Anderson, A.R., Belnap, N.D., Dunn, J.M.: Entailment: The Logic of Relevance and Necessity, vol. II. Princeton University Press, Princeton (1992)"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1017\/S0956796899003524","volume":"10","author":"H Barendregt","year":"2000","unstructured":"Barendregt, H., Ghilezan, S.: Lambda terms for natural deduction, sequent calculus and cut elimination. J. Funct. Program. 10, 121\u2013134 (2000)","journal-title":"J. Funct. Program."},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Bimb\u00f3, K.: Relevance logics. In: Jacquette, D. (ed.) Philosophy of Logic. Handbook of the Philosophy of Science (D. Gabbay, P. Thagard, J. Woods, eds.), vol. 5, pp. 723\u2013789. Elsevier (North-Holland), Amsterdam (2007). \nhttps:\/\/doi.org\/10.1016\/B978-044451541-4\/50022-1","DOI":"10.1016\/B978-044451541-4\/50022-1"},{"key":"1_CR4","series-title":"Discrete Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1201\/b11046","volume-title":"Combinatory Logic: Pure, Applied and Typed","author":"K Bimb\u00f3","year":"2012","unstructured":"Bimb\u00f3, K.: Combinatory Logic: Pure, Applied and Typed. Discrete Mathematics and its Applications. CRC Press, Boca Raton (2012). \nhttps:\/\/doi.org\/10.1201\/b11046"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2015.06.019","volume":"597","author":"K Bimb\u00f3","year":"2015","unstructured":"Bimb\u00f3, K.: The decidability of the intensional fragment of classical linear logic. Theor. Comput. Sci. 597, 1\u201317 (2015). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2015.06.019","journal-title":"Theor. Comput. Sci."},{"key":"1_CR6","series-title":"Discrete Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1201\/b17294","volume-title":"Proof Theory: Sequent Calculi and Related Formalisms","author":"K Bimb\u00f3","year":"2015","unstructured":"Bimb\u00f3, K.: Proof Theory: Sequent Calculi and Related Formalisms. Discrete Mathematics and its Applications. CRC Press, Boca Raton (2015). \nhttps:\/\/doi.org\/10.1201\/b17294"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1215\/00294527-1722719","volume":"53","author":"K Bimb\u00f3","year":"2012","unstructured":"Bimb\u00f3, K., Dunn, J.M.: New consecution calculi for $$R_\\rightarrow ^{t}$$R\u2192t. Notre Dame J. Form. Logic 53(4), 491\u2013509 (2012). \nhttps:\/\/doi.org\/10.1215\/00294527-1722719","journal-title":"Notre Dame J. Form. Logic"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"214","DOI":"10.2178\/jsl.7801150","volume":"78","author":"K Bimb\u00f3","year":"2013","unstructured":"Bimb\u00f3, K., Dunn, J.M.: On the decidability of implicational ticket entailment. J. Symb. Log. 78(1), 214\u2013236 (2013). \nhttps:\/\/doi.org\/10.2178\/jsl.7801150","journal-title":"J. Symb. Log."},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s11787-014-0099-z","volume":"8","author":"K Bimb\u00f3","year":"2014","unstructured":"Bimb\u00f3, K., Dunn, J.M.: Extracting BB$$^\\prime $$\u2032IW inhabitants of simple types from proofs in the sequent calculus $$LT_\\rightarrow ^{t}$$LT\u2192t for implicational ticket entailment. Log. Universalis 8(2), 141\u2013164 (2014). \nhttps:\/\/doi.org\/10.1007\/s11787-014-0099-z","journal-title":"Log. Universalis"},{"key":"1_CR10","unstructured":"Curry, H.B.: A Theory of Formal Deducibility. Notre Dame Mathematical Lectures, no. 6. University of Notre Dame Press, Notre Dame (1950)"},{"key":"1_CR11","volume-title":"Foundations of Mathematical Logic","author":"HB Curry","year":"1963","unstructured":"Curry, H.B.: Foundations of Mathematical Logic. McGraw-Hill Book Company, New York (1963). (Dover, New York, NY, 1977)"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"356","DOI":"10.2307\/2272113","volume":"38","author":"JM Dunn","year":"1973","unstructured":"Dunn, J.M.: A \u2018Gentzen system\u2019 for positive relevant implication (abstract). J. Symb. Log. 38(2), 356\u2013357 (1973). \nhttps:\/\/doi.org\/10.2307\/2272113","journal-title":"J. Symb. Log."},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1093\/jigpal\/5.4.505","volume":"5","author":"JM Dunn","year":"1997","unstructured":"Dunn, J.M., Meyer, R.K.: Combinators and structurally free logic. Log. J. IGPL 5(4), 505\u2013537 (1997). \nhttps:\/\/doi.org\/10.1093\/jigpal\/5.4.505","journal-title":"Log. J. IGPL"},{"issue":"4","key":"1_CR14","first-page":"288","volume":"1","author":"G Gentzen","year":"1964","unstructured":"Gentzen, G.: Investigations into logical deduction. Am. Philos. Q. 1(4), 288\u2013306 (1964)","journal-title":"Am. Philos. Q."},{"key":"1_CR15","unstructured":"Giambrone, S.: Gentzen systems and decision procedures for relevant logics. Ph.D. thesis, Australian National University, Canberra, ACT, Australia (1983)"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF00249365","volume":"14","author":"S Giambrone","year":"1985","unstructured":"Giambrone, S.: $$TW_+$$TW+ and $$RW_+$$RW+ are decidable. J. Philos. Log. 14, 235\u2013254 (1985)","journal-title":"J. Philos. Log."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BFb0022247","volume-title":"Computer Science Logic","author":"H Herbelin","year":"1995","unstructured":"Herbelin, H.: A $$\\lambda $$\u03bb-calculus structure isomorphic to Gentzen-style sequent calculus structure. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 61\u201375. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/BFb0022247"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1090\/psapm\/012\/9972","volume-title":"Structure of Language and its Mathematical Aspects","author":"J Lambek","year":"1961","unstructured":"Lambek, J.: On the calculus of syntactic types. In: Jacobson, R. (ed.) Structure of Language and its Mathematical Aspects, pp. 166\u2013178. American Mathematical Society, Providence (1961)"},{"key":"1_CR19","first-page":"189","volume":"1","author":"RK Meyer","year":"1976","unstructured":"Meyer, R.K.: A general Gentzen system for implicational calculi. Relevance Log. Newsl. 1, 189\u2013201 (1976)","journal-title":"Relevance Log. Newsl."},{"key":"1_CR20","first-page":"355","volume-title":"From Frege to G\u00f6del. A Source Book in Mathematical Logic","author":"M Sch\u00f6nfinkel","year":"1967","unstructured":"Sch\u00f6nfinkel, M.: On the building blocks of mathematical logic. In: van Heijenoort, J. (ed.) From Frege to G\u00f6del. A Source Book in Mathematical Logic, pp. 355\u2013366. Harvard University Press, Cambridge (1967)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-57669-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,26]],"date-time":"2018-06-26T04:49:04Z","timestamp":1529988544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-57669-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783662576687","9783662576694"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-57669-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}