{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:27Z","timestamp":1725493467591},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427360"},{"type":"electronic","value":"9783540455004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45500-0_8","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T15:37:33Z","timestamp":1193326653000},"page":"165-182","source":"Crossref","is-referenced-by-count":5,"title":["Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Nakano","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,10]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Nakano, H.: A modality for recursion. In: Proceedings of the 15th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press (2000) 255\u2013266","DOI":"10.1109\/LICS.2000.855774"},{"key":"8_CR2","unstructured":"Nakano, H.: A modality for recursion (technical report). Available as http:\/\/www602.math.ryukoku.ac.jp\/~nakano\/papers\/modality-tr01.ps (2001)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(83)90136-6","volume":"22","author":"R. Hindley","year":"1983","unstructured":"Hindley, R.: The completeness theorem for typing \u03bb-terms. Theoretical Computer Science 22 (1983) 1\u201317","journal-title":"Theoretical Computer Science"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(83)90141-X","volume":"22","author":"R. Hindley","year":"1983","unstructured":"Hindley, R.: Curry\u2019s type-rules are complete with respect to F-sematics too. Theoretical Computer Science 22 (1983) 127\u2013133","journal-title":"Theoretical Computer Science"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Boolos, G.: The logic of provability. Cambridge University Press (1993)","DOI":"10.1017\/CBO9780511625183"},{"key":"8_CR6","unstructured":"Barendregt, H.P.: Lambda calculi with types. In Abramsky, S., Gabbay, D.M., Maibaum, T.S.E.,eds.: Handbook of Logic in Computer Science. Volume 2. Oxford University Press (1992) 118\u2013309"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0890-5401(91)90020-3","volume":"92","author":"F. Cardone","year":"1991","unstructured":"Cardone, F., Coppo, M.: Type inference with recursive types: syntax and semantics. Information and Computation 92 (1991) 48\u201380","journal-title":"Information and Computation"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/155183.155231","volume":"15","author":"R.M. Amadio","year":"1993","unstructured":"Amadio, R.M., Cardelli, L.: Subtyping recursive types. ACM Transactions on Programming Languages and Systems 15 (1993) 575\u2013631","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science 25 (1983) 95\u2013169","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45500-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T20:54:40Z","timestamp":1556916880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45500-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427360","9783540455004"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45500-0_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}