{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:43Z","timestamp":1725662983775},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540111603"},{"type":"electronic","value":"9783540386315"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-11160-3_1","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:38:21Z","timestamp":1330191501000},"page":"1-11","source":"Crossref","is-referenced-by-count":8,"title":["On the duality of dynamic algebras and kripke models"],"prefix":"10.1007","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"1_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho A.V., J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974."},{"key":"1_CR2","volume-title":"Models and Ultraproducts","author":"J. S. Bell","year":"1971","unstructured":"Bell, J.S. and A.B. Slomson, Models and Ultraproducts. North Holland, Amsterdam, 1971."},{"key":"1_CR3","volume-title":"Math. Found. of Comp. Sci.","author":"L. Banachowski","year":"1977","unstructured":"Banachowski, L., A. Kreczmar, G. Mirkowska, H. Rasiowa, and A. Salwicki, \"An introduction to Algorithmic Logic,\" in: Mazurkiewicz and Pawlak, eds., Math. Found. of Comp. Sci., Banach Center Publications, Warsaw, 1977."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Berman, F., \"A completeness technique for D-axiomatizable semantics,\" Proc. 11th ACM Symp. on Theory of Comp. (May 1979), 160\u2013166.","DOI":"10.1145\/800135.804409"},{"key":"1_CR5","volume-title":"Regular Algebra and Finite Machines","author":"J. H. Conway","year":"1971","unstructured":"Conway, J.H. Regular Algebra and Finite Machines. Chapman-Hall, London, 1971."},{"issue":"1","key":"1_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.2307\/2371742","volume":"68","author":"C. J. Everett","year":"1946","unstructured":"Everett, C.J. and S. Ulam, \"Projective algebra I,\" Amer. J. Math. 68:1 (1946), 77\u201388.","journal-title":"Amer. J. Math."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Fischer, M.J. and R.E.Ladner, \"Propositional modal logic of programs,\" Proc. 9th ACM Symp. on Theory of Comp. (May 1977), 286\u2013294.","DOI":"10.1145\/800105.803418"},{"key":"1_CR8","unstructured":"Gabbay, D., \"Axiomatizations of logics of programs,\" manuscript, Nov. 1977."},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09237-4","volume-title":"First-Order Dynamic Logic","author":"D. Harel","year":"1979","unstructured":"Harel, D. First-Order Dynamic Logic. Lecture Notes in Computer Science 68, ed. Goos and Hartmanis, Springer-Verlag, Berlin, 1979."},{"key":"1_CR10","first-page":"80","volume":"54","author":"B. Jonsson","year":"1948","unstructured":"Jonsson, B. and A. Tarski, \"Representation problems for relation algebras,\" abstract 89t, Bull. Amer. Math. Soc. 54 (1948), 80.","journal-title":"Bull. Amer. Math. Soc."},{"key":"1_CR11","volume-title":"\"A representation theorem for models of *-free PDL,\" Report RC7864","author":"D. Kozen","year":"1979","unstructured":"Kozen, D., \"A representation theorem for models of *-free PDL,\" Report RC7864, IBM Research, Yorktown Heights, New York, Sept. 1979."},{"issue":"3","key":"1_CR12","doi-asserted-by":"crossref","first-page":"707","DOI":"10.2307\/1969375","volume":"51","author":"R. C. Lyndon","year":"1950","unstructured":"Lyndon, R.C., \"The representation of relation algebras,\" Ann. Math. 51:3 (1950), 707\u2013729.","journal-title":"Ann. Math."},{"issue":"3","key":"1_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.2307\/2266861","volume":"5","author":"J. C. C. C. McKinsey","year":"1940","unstructured":"McKinsey, J.C.C., \"Postulates for the calculus of binary relations,\" J. Symb. Logic 5:3 (1940), 85\u201397.","journal-title":"J. Symb. Logic"},{"key":"1_CR14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.2307\/2372335","volume":"70","author":"J. C. C. C. McKinsey","year":"1948","unstructured":"\u2014 \"On the representation of projective algebras,\" Amer. J. Math. 70 (1948), 375\u2013384.","journal-title":"Amer. J. Math."},{"key":"1_CR15","volume-title":"Symp. on Math. Found. of Comp. Sci.","author":"R. Parikh","year":"1978","unstructured":"Parikh, R., \"A completeness result for PDL,\" Symp. on Math. Found. of Comp. Sci., Zakopane, Warsaw, Springer-Verlag, May 1978."},{"key":"1_CR16","unstructured":"Pratt, V.R., \"Semantical considerations on Floyd-Hoare logic,\" Proc. 17th IEEE Symp. on Foundations of Comp. Sci. (Oct. 1976), 109\u2013121."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"\u2014 \"A practical decision method for Propositional Dynamic Logic,\" Proc. 10th ACM Symp. on Theory of Computing (May 1978), 326\u2013337.","DOI":"10.1145\/800133.804362"},{"key":"1_CR18","unstructured":"\u2014, \"Models of program logics,\" Proc. 20th IEEE Symp. on Foundations of Comp. Sci. (Oct. 1979), to appear."},{"key":"1_CR19","unstructured":"\u2014, \"Dynamic algebras: examples, constructions, applications,\" manuscript, July 1979."},{"key":"1_CR20","first-page":"6","volume":"24","author":"K Segerberg","year":"1977","unstructured":"Segerberg, K., \"A completeness theorem in the modal logic of programs,\" Not. AMS 24:6 (1977), A-552.","journal-title":"Not. AMS"},{"key":"1_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata Theoretic Aspects of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A. and M. Soittala. Automata Theoretic Aspects of Formal Power Series. Springer-Verlag, New York, 1978."},{"issue":"3","key":"1_CR22","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"Tarski, A., \"On the calculus of relations,\" J. Symb. Logic 6:3 (1941), 73\u201389.","journal-title":"J. Symb. Logic"}],"container-title":["Lecture Notes in Computer Science","Logic of Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-11160-3_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:04:30Z","timestamp":1605643470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-11160-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540111603","9783540386315"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-11160-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}