{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:10:27Z","timestamp":1706649027999},"reference-count":12,"publisher":"Duke University Press","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2009,7,1]]},"DOI":"10.1215\/00294527-2009-011","type":"journal-article","created":{"date-parts":[[2009,11,10]],"date-time":"2009-11-10T14:07:39Z","timestamp":1257862059000},"source":"Crossref","is-referenced-by-count":0,"title":["Proof-finding Algorithms for Classical and Subclassical Propositional Logics"],"prefix":"10.1215","volume":"50","author":[{"given":"M. W.","family":"Bunder","sequence":"first","affiliation":[]},{"given":"R. M.","family":"Rizkalla","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"1","unstructured":"[1] Anderson, A. R., and N. D. Belnap, Jr., <i>Entailment. Volume I. The Logic of Relevance and Necessity<\/i>, Princeton University Press, Princeton, 1975."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Bunder, M. W., \"Lambda terms definable as combinators\", <i>Theoretical Computer Science<\/i>, vol. 169 (1996), pp. 3--21.","DOI":"10.1016\/S0304-3975(96)00111-9"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Bunder, M. W., \"Proof finding algorithms for implicational logics\", <i>Theoretical Computer Science<\/i>, vol. 232 (2000), pp. 165--86.","DOI":"10.1016\/S0304-3975(99)00174-7"},{"key":"5","unstructured":"[5] Curry, H. B., <i>A Theory of Formal Deducibility<\/i>, vol. 6 of <i>Notre Dame Mathematical Lectures<\/i>, University of Notre Dame, Notre Dame, 1950."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Gabbay, D. M., and R. J. G. B. de Queiroz, \"Extending the Curry-Howard interpretation to linear, relevant and other resource logics\", <i>The Journal of Symbolic Logic<\/i>, vol. 57 (1992), pp. 1319--65.","DOI":"10.2307\/2275370"},{"key":"8","unstructured":"[8] Hindley, J. R., <i>Basic Simple Type Theory<\/i>, vol. 42 of <i>Cambridge Tracts in Theoretical Computer Science<\/i>, Cambridge University Press, Cambridge, 1997."},{"key":"9","unstructured":"[9] Hindley, J. R., and J. P. Seldin, <i>Introduction to Combinators and $\\lambda$<\/i>-Calculus, vol. 1 of <i>London Mathematical Society Student Texts<\/i>, Cambridge University Press, Cambridge, 1986."},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Popper, K. R., \"New foundations for logic\", <i>Mind<\/i>, vol. 56 (1947), pp. 193--235; errata 57, 69--70 (1948).","DOI":"10.1093\/mind\/LVI.223.193"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Trigg, P., J. R. Hindley, and M. W. Bunder, \"Combinatory abstraction using $\\bf B$\", $\\bf B'$ and friends, <i>Theoretical Computer Science<\/i>, vol. 135 (1994), pp. 405--22.","DOI":"10.1016\/0304-3975(94)90114-7"},{"key":"4","unstructured":"[4] Bunder, M. W., and S. Hirokawa, <i>Classical Formulas As Types of $\\lambda \\nu$-terms<\/i>, Department of Mathematics, University of Wollongong, Preprint series 14\/96, 1996."},{"key":"6","unstructured":"[6] Dekker, A. H., \"Brouwer 7.9.0 - A Proof Finding Program for Intuitionistic, BCI\", BCK and Classical Logic, 1996."},{"key":"10","unstructured":"[10] Oostdijk, M., ``Lambdacal 2.''"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2009-011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:18Z","timestamp":1706648238000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-50\/issue-3\/Proof-finding-Algorithms-for-Classical-and-Subclassical-Propositional-Logics\/10.1215\/00294527-2009-011.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,1]]},"references-count":12,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2009,7,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2009-011","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2009,7,1]]}}}