{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:08:56Z","timestamp":1736140136090,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354011212X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0025791","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:23:41Z","timestamp":1132395821000},"page":"375-386","source":"Crossref","is-referenced-by-count":2,"title":["Some applications of topology to program semantics"],"prefix":"10.1007","author":[{"given":"Rohit","family":"Parikh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"G. Birkhoff, Lattice Theory, Amer. Math. Soc. Colloq. Publications vol. 25 (1940).","DOI":"10.1090\/coll\/025"},{"key":"22_CR2","unstructured":"J. Bergstra, J. Tiuryn and J. Tucker, Correctness Theories and Program Equivalence, Stichting Mathematisch Centrum, Amsterdam (1979)"},{"key":"22_CR3","unstructured":"P. M. Cohn, Universal Algebra, Harper and Row (1965)."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"I. Greif and A. Meyer, Specifying the Semantics of While Programs, 6th Annual Symposium on Principles of Programming Languages, ACM (1979), pp. 180\u2013189. To appear in TOPLAS.","DOI":"10.1145\/567752.567769"},{"key":"22_CR5","first-page":"135","volume":"3","author":"A. Hoare","year":"1974","unstructured":"A. Hoare and P. Lauer, Consistent and Complementary Formal Theories of the Semantics of Programming Languages, Acta Informatica 3 (1974) pp. 135\u2013155.","journal-title":"Acta Informatica"},{"key":"22_CR6","first-page":"220","volume":"3","author":"D. Luckham","year":"1970","unstructured":"D. Luckham, D. Park and M. Paterson, On Formalised Computer Programs, JCSS 3 (1970) pp. 220\u2013249.","journal-title":"JCSS"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"A. Meyer and J. Halpern, Axiomatic Definitions of Programming Languages: A Theoretical Assessment, 7th Annual Symposium on Principles of Programming Languages, ACM (1980), 202\u2013212.","DOI":"10.1145\/567446.567466"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"A. Meyer and R. Parikh, Definability in Dynamic Logic, Proc. 12th Annual ACM Symposium on Theory of Computation (1980) pp. 1\u20137. To appear in JCSS.","DOI":"10.1145\/800141.804646"},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1090\/S0002-9947-1944-0010555-7","volume":"55","author":"O. Ore","year":"1944","unstructured":"O. Ore, Galois Connexions, Trans. Amer. Math Soc. 55 (1944) pp. 493\u2013513.","journal-title":"Trans. Amer. Math Soc."},{"key":"22_CR10","unstructured":"R. Parikh, Propositional Logics of Programs \u2014 Systems, Models and Complexity, 7th Annual Symposium on Principles of Programming Languages, ACM (1980), pp. 186\u2013192."}],"container-title":["Lecture Notes in Computer Science","Logics of Programs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0025791.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:11:19Z","timestamp":1736104279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0025791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354011212X"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0025791","relation":{},"subject":[]}}