{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:10:29Z","timestamp":1725570629032},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175107"},{"type":"electronic","value":"9783642175114"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17511-4_14","type":"book-chapter","created":{"date-parts":[[2010,12,7]],"date-time":"2010-12-07T06:24:40Z","timestamp":1291703080000},"page":"231-254","source":"Crossref","is-referenced-by-count":1,"title":["A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing"],"prefix":"10.1007","author":[{"given":"Michael","family":"Gabbay","sequence":"first","affiliation":[]},{"given":"Murdoch J.","family":"Gabbay","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.2178\/jsl\/1102022211","volume":"69","author":"C. Benzm\u00fcller","year":"2004","unstructured":"Benzm\u00fcller, C., Brown, C.E., Kohlhase, M.: Higher-order semantics and extensionality. Journal of Symbolic Logic\u00a069, 1027\u20131088 (2004)","journal-title":"Journal of Symbolic Logic"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"869","DOI":"10.2307\/2586717","volume":"3","author":"W. Dekkers","year":"1998","unstructured":"Dekkers, W., Bunder, M., Barendregt, H.: Completeness of the propositions-as-types interpretation of intuitionistic logic into illative combinatory logic. Journal of Symbolic Logic\u00a03, 869\u2013890 (1998)","journal-title":"Journal of Symbolic Logic"},{"key":"14_CR3","first-page":"327","volume":"37","author":"W. Dekkers","year":"1998","unstructured":"Dekkers, W., Bunder, M., Barendregt, H.: Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus. Archive f\u00fcr Mathematische Logik\u00a037, 327\u2013341 (1998)","journal-title":"Archive f\u00fcr Mathematische Logik"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1027357912519","volume":"31","author":"G. Dowek","year":"2003","unstructured":"Dowek, G., Hardin, T., Kirchner, C.: Theorem proving modulo. Journal of Automated Reasoning\u00a031(1), 33\u201372 (2003)","journal-title":"Journal of Automated Reasoning"},{"key":"14_CR5","first-page":"1","volume-title":"Handbook of Philosophical Logic","author":"J. Michael Dunn","year":"2002","unstructured":"Michael Dunn, J., Restall, G.: Relevance logic. In: Gabbay, D.M. (ed.) Handbook of Philosophical Logic, 2nd edn., vol.\u00a06, pp. 1\u2013136. Kluwer Academic Publishers, Dordrecht (2002)","edition":"2"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Gabbay, M., Gabbay, M.J.: Term sequent logic. In: Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2008). Electronic Notes in Theoretical Computer Science, vol.\u00a0246, pp. 87\u2013106 (August 2009)","DOI":"10.1016\/j.entcs.2009.07.017"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Werner, B., Dowek, G.: Arithmetic as a theory modulo. In: Proceedings of RTA, pp. 423\u2013437 (2005)","DOI":"10.1007\/978-3-540-32033-3_31"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/CBO9780511629150","volume-title":"Proceedings of the Workshop on Advances in Linear Logic","author":"J.-Y. Girard","year":"1995","unstructured":"Girard, J.-Y.: Linear logic: its syntax and semantics. In: Proceedings of the Workshop on Advances in Linear Logic, pp. 1\u201342. Cambridge University Press, New York (1995)"},{"key":"14_CR10","volume-title":"Proofs and types","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y., Taylor, P., Lafont, Y.: Proofs and types. Cambridge University Press, Cambridge (1989)"},{"key":"14_CR11","unstructured":"Goldblatt, R.: Logics of Time and Computation, 2nd edn., Center for the Study of Language and Information. CSLI Lecture Notes, vol.\u00a07 (1992)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2266967","volume":"15","author":"L. Henkin","year":"1950","unstructured":"Henkin, L.: Completeness in the theory of types. Journal of Symbolic Logic\u00a015, 81\u201391 (1950)","journal-title":"Journal of Symbolic Logic"},{"key":"14_CR13","doi-asserted-by":"publisher","DOI":"10.4324\/9780203290644","volume-title":"A New Introduction to Modal Logic","author":"G.E. Hughes","year":"1996","unstructured":"Hughes, G.E., Cresswell, M.J.: A New Introduction to Modal Logic. Routledge, New York (1996)"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1017\/S0956796800001301","volume":"5","author":"C.B. Jay","year":"1995","unstructured":"Jay, C.B., Ghani, N.: The virtues of eta-expansion. Journal of Functional Programming\u00a05(2), 135\u2013154 (1995)","journal-title":"Journal of Functional Programming"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Kleene, S.C., Rosser, J.B.: The inconsistency of certain formal logics. Annals of Mathematics\u00a036(3) (1935)","DOI":"10.2307\/1968646"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/BF01880331","volume":"7","author":"R.K. Meyer","year":"1991","unstructured":"Meyer, R.K., Bunder, M.W., Powers, L.: Implementing the \u2018fool\u2019s model\u2019 of combinatory logic. Journal of Automated Reasoning\u00a07(4), 597\u2013630 (1991)","journal-title":"Journal of Automated Reasoning"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2307\/421090","volume":"5","author":"P. O\u2019Hearn","year":"1999","unstructured":"O\u2019Hearn, P., Pym, D.: The logic of bunched implications. Bulletin of Symbolic Logic\u00a05(2), 215\u2013244 (1999)","journal-title":"Bulletin of Symbolic Logic"},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"313","DOI":"10.2307\/2272645","volume":"39","author":"G.D. Plotkin","year":"1974","unstructured":"Plotkin, G.D.: The lambda-calculus is omega-incomplete. Journal of Symbolic Logic\u00a039(2), 313\u2013317 (1974)","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(02)00038-5","volume":"309","author":"P. Selinger","year":"2003","unstructured":"Selinger, P.: Order-incompleteness and finite lambda reduction models. Theoretical Computer Science\u00a0309(1), 43\u201363 (2003)","journal-title":"Theoretical Computer Science"},{"key":"14_CR20","series-title":"Oxford logic guides","doi-asserted-by":"publisher","DOI":"10.1093\/0198250290.001.0001","volume-title":"Foundations without foundationalism: a case for second-order logic","author":"S. Shapiro","year":"2000","unstructured":"Shapiro, S.: Foundations without foundationalism: a case for second-order logic. Oxford logic guides, vol.\u00a017. Oxford University Press, Oxford (2000)"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-94-015-9833-0_3","volume-title":"Handbook of Philosophical Logic","author":"J. Benthem van","year":"2001","unstructured":"van Benthem, J.: Higher-order logic. In: Handbook of Philosophical Logic, 2nd edn., vol.\u00a01, pp. 189\u2013244. Kluwer, Dordrecht (2001)","edition":"2"},{"key":"14_CR22","first-page":"307","volume-title":"Proceedings of the 1988 Heyting Conference on Mathematical Logic","author":"A. Visser","year":"1997","unstructured":"Visser, A.: An overview of interpretability logic. In: Proceedings of the 1988 Heyting Conference on Mathematical Logic, pp. 307\u2013359. Plenum Press, New York (1997)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17511-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T21:20:05Z","timestamp":1559856005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17511-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175107","9783642175114"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17511-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}