{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:26:10Z","timestamp":1725891970085},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357213"},{"type":"electronic","value":"9783642357220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35722-0_29","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T11:16:29Z","timestamp":1357298189000},"page":"401-414","source":"Crossref","is-referenced-by-count":1,"title":["Self-referentiality in the Brouwer\u2013Heyting\u2013Kolmogorov Semantics of Intuitionistic Logic"],"prefix":"10.1007","author":[{"given":"Junhua","family":"Yu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Artemov, S.N.: Operational modal logic, Technical Report MSI 95-29. Cornell University (1995)"},{"issue":"1","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2687821","volume":"7","author":"S.N. Artemov","year":"2001","unstructured":"Artemov, S.N.: Explicit provability and constructive semantics. The Bulletin of Symbolic Logic\u00a07(1), 1\u201336 (2001)","journal-title":"The Bulletin of Symbolic Logic"},{"issue":"1-3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2006.03.010","volume":"357","author":"V.N. Brezhnev","year":"2006","unstructured":"Brezhnev, V.N., Kuznets, R.: Making knowledge explicit: How hard it is. Theoretical Computer Science\u00a0357(1-3), 23\u201334 (2006)","journal-title":"Theoretical Computer Science"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF00370331","volume":"51","author":"A. Chagrov","year":"1992","unstructured":"Chagrov, A., Zakharyashchev, M.: Modal companions of intermediate propositional logics. Studia Logica\u00a051, 49\u201382 (1992)","journal-title":"Studia Logica"},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apal.2004.04.009","volume":"132","author":"M. Fitting","year":"2005","unstructured":"Fitting, M.: The logic of proofs, semantically. Annals of Pure and Applied Logic\u00a0132(1), 1\u201325 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"29_CR6","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.apal.2009.07.010","volume":"161","author":"M. Fitting","year":"2009","unstructured":"Fitting, M.: Realizations and LP. Annals of Pure and Applied Logic\u00a0161(3), 368\u2013387 (2009)","journal-title":"Annals of Pure and Applied Logic"},{"key":"#cr-split#-29_CR7.1","unstructured":"G\u00f6del, K.: Eine Interpretation des intuitionistischen Aussagenkalkuls. Ergebnisse Eines Mathematischen Kolloquiums\u00a04, 39-40 (1933)"},{"key":"#cr-split#-29_CR7.2","unstructured":"English translation in: Feferman, S., et al (eds.): Kurt G\u00f6del Collected Works, vol. 1, pp. 301-303. Oxford University Press, Clarendon Press, Oxford, New York (1986)"},{"issue":"4","key":"29_CR8","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/s00224-009-9209-3","volume":"46","author":"R. Kuznets","year":"2010","unstructured":"Kuznets, R.: Self-referential justifications in epistemic logic. Theory of Computing Systems\u00a046(4), 636\u2013661 (2010)","journal-title":"Theory of Computing Systems"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2268135","volume":"13","author":"J.C.C. McKinsey","year":"1948","unstructured":"McKinsey, J.C.C., Tarski, A.: Some theorems about the sentential calculi of Lewis and Heyting. The Journal of Symbolic Logic\u00a013, 1\u201315 (1948)","journal-title":"The Journal of Symbolic Logic"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/3-540-63045-7_27","volume-title":"Logical Foundations of Computer Science","author":"A. Mkrtychev","year":"1997","unstructured":"Mkrtychev, A.: Models for the Logic of Proofs. In: Adian, S., Nerode, A. (eds.) LFCS 1997. LNCS, vol.\u00a01234, pp. 266\u2013275. Springer, Heidelberg (1997)"},{"key":"29_CR11","volume-title":"Lectures on the Curry-Howard Isomorphism","author":"M.H. S\u00f8rensen","year":"2006","unstructured":"S\u00f8rensen, M.H., Urzyczyn, P.: Lectures on the Curry-Howard Isomorphism. Elsevier, Amsterdam (2006)"},{"key":"29_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168717","volume-title":"Basic Proof Theory","author":"A.S. Troelstra","year":"2000","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory, 2nd edn. Cambridge University Press, Cambridge (2000)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35722-0_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:24:29Z","timestamp":1620134669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35722-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642357213","9783642357220"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35722-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}