{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:37Z","timestamp":1725488617121},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671909"},{"type":"electronic","value":"9783540465089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46508-1_2","type":"book-chapter","created":{"date-parts":[[2007,8,3]],"date-time":"2007-08-03T20:02:03Z","timestamp":1186171323000},"page":"23-38","source":"Crossref","is-referenced-by-count":3,"title":["Higher-Order Modal Logic\u2014A Sketch"],"prefix":"10.1007","author":[{"given":"Melvin","family":"Fitting","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,17]]},"reference":[{"unstructured":"A. Bressan. A General Interpreted Modal Calculus. Yale University Press, 1972.","key":"2_CR1"},{"doi-asserted-by":"crossref","unstructured":"M. C. Fitting. Bertrand Russell, Herbrand\u2019s theorem, and the assignment statement. In J. Calmet and J. Plaza, editors, Artificial Intelligence and Symbolic Computation, pages 14\u201328. Springer Lecture Notes in Artificial Intelligence, 1476, 1998.","key":"2_CR2","DOI":"10.1007\/BFb0055899"},{"doi-asserted-by":"crossref","unstructured":"M. C. Fitting and R. Mendelsohn. First-Order Modal Logic. Kluwer, 1998.","key":"2_CR3","DOI":"10.1007\/978-94-011-5292-1"},{"unstructured":"K. G\u00f6del. Ontological proof. In S. Feferman, J. W. Dawson, Jr., W. Goldfarb, C. Parsons, and R. M. Solovay, editors, Kurt G\u00f6del Collected Works, volume III, pages 403\u2013404. Oxford, Oxford, 1995.","key":"2_CR4"},{"key":"2_CR5","doi-asserted-by":"crossref","DOI":"10.4324\/9780203290644","volume-title":"A New Introduction to Modal Logic","author":"G. E. Hughes","year":"1996","unstructured":"G. E. Hughes and M. J. Cresswell. A New Introduction to Modal Logic. Routledge, London, 1996."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"452","DOI":"10.2307\/2270331","volume":"33","author":"D. Prawitz","year":"1968","unstructured":"D. Prawitz. Hauptsatz for higher order logic. Journal of Symbolic Logic, 33:452\u2013457, 1968.","journal-title":"Journal of Symbolic Logic"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1111\/j.1755-2567.1968.tb00351.x","volume":"34","author":"R. Stalnaker","year":"1968","unstructured":"R. Stalnaker and R. Thomason. Abstraction in first-order modal logic. Theoria, 34:203\u2013207, 1968.","journal-title":"Theoria"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.2969\/jmsj\/01940399","volume":"19","author":"M. Takahashi","year":"1967","unstructured":"M. Takahashi. A proof of cut-elimination theorem in simple type theory. J. Math. Soc. Japan, 19:399\u2013410, 1967.","journal-title":"J. Math. Soc. Japan"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.2307\/2214461","volume":"2","author":"R. Thomason","year":"1968","unstructured":"R. Thomason and R. Stalnaker. Modality and reference. Nous, 2:359\u2013372, 1968.","journal-title":"Nous"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction in Classical and Non-Classical Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46508-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:57:51Z","timestamp":1556737071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46508-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671909","9783540465089"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-46508-1_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}