{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T13:03:10Z","timestamp":1648818190038},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1983,12]]},"DOI":"10.1007\/bf01744573","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T08:56:39Z","timestamp":1118912199000},"page":"111-131","source":"Crossref","is-referenced-by-count":5,"title":["Some applications of topology to program semantics"],"prefix":"10.1007","volume":"16","author":[{"given":"Rohit","family":"Parikh","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01744573_CR1","doi-asserted-by":"crossref","unstructured":"G. Birkhoff,Lattice Theory, Amer. Math. Soc. Colloq. Publications vol. 25 (1940).","DOI":"10.1090\/coll\/025"},{"key":"BF01744573_CR2","unstructured":"J. Bergstra, J. Tiuryn and J. Tucker, Correctness Theories and Program Equivalence,Stichting Mathematisch Centrum, Amsterdam (1979)."},{"key":"BF01744573_CR3","unstructured":"P. M. Cohn,Universal Algebra, Harper and Row (1965)."},{"key":"BF01744573_CR4","doi-asserted-by":"crossref","unstructured":"E. Clarke, Programming Language Constructs for which it is Impossible to Obtain Good Hoare-like Axiom Systems,Proc. 4th ACM Symposium on Principles of Programming Languages 1977, 10\u201320.","DOI":"10.1145\/512950.512952"},{"key":"BF01744573_CR5","doi-asserted-by":"crossref","unstructured":"S. Cook, Soundness and Completeness of an Axiom System for Program Verification,SIAM J. Comp 7 (1978).","DOI":"10.1137\/0207005"},{"key":"BF01744573_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","volume":"49","author":"A. Ehrenfeucht","year":"1961","unstructured":"A. Ehrenfeucht, An Application of Games to the Completeness Problem for Formalised Theories,Fundamenta Mathematica 49 (1961) 129\u2013141.","journal-title":"Fundamenta Mathematica"},{"key":"BF01744573_CR7","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357146.357151","volume":"3","author":"I. Greif","year":"1981","unstructured":"I. Greif and A. Meyer, Specifying the Semantics of While Programs,ACM TOPLAS 3 (1981) 484\u2013507.","journal-title":"ACM TOPLAS"},{"key":"BF01744573_CR8","unstructured":"D. Harel,First Order Dynamic Logic, Springer Lecture Notes in Computer Science #68."},{"key":"BF01744573_CR9","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":"BF01744573_CR10","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0019-9958(75)90415-5","volume":"29","author":"D. Kfoury","year":"1975","unstructured":"D. Kfoury and D. Park, On the Termination of Program Schemas,Information and Control, 29 (1975) 243\u2013251.","journal-title":"Information and Control"},{"key":"BF01744573_CR11","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":"BF01744573_CR12","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/322307.322324","volume":"29","author":"A. Meyer","year":"1982","unstructured":"A. Meyer and J. Halpern, Axiomatic Definitions of Programming Languages: A Theoretical Assessment,Jour. Assoc. Comp. Mach. 29 (1982) 555\u2013576.","journal-title":"Jour. Assoc. Comp. Mach."},{"key":"BF01744573_CR13","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 inJCSS.","DOI":"10.1145\/800141.804646"},{"key":"BF01744573_CR14","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":"BF01744573_CR15","unstructured":"R. Parikh, Propositional Logics of Programs-Systems, Models and Complexity,7th Annual Symposium on Principles of Programming Languages, ACM (1980), pp. 186\u2013192."},{"key":"BF01744573_CR16","unstructured":"R. Parikh, Some Applications of Topology to Program Semantics, (an earlier version of the present paper).Logics of Programs (Ed. D. Kozen), Springer LNCS # 131 (1981) 375\u201386."},{"key":"BF01744573_CR17","doi-asserted-by":"crossref","unstructured":"R. Parikh, Propositional Dynamics Logics of Programs: A Survey,Logic of Programs, (Ed. E. Engeler) Springer LNCS # 125, fall 1981, 102\u2013144.","DOI":"10.1007\/3-540-11160-3_4"},{"key":"BF01744573_CR18","unstructured":"R. Parikh, Models for Programs,Proc. Bangalore Conference on Software Technology and Theoretical Computer Science, Published by TIFR, Bombay 1981."},{"key":"BF01744573_CR19","doi-asserted-by":"crossref","unstructured":"M. Wand, A New Incompleteness Result for Hoare's System,Proc 8th ACM Symposium on the Theory of Computing, (1976) 87\u201391.","DOI":"10.1145\/800113.803635"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01744573.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01744573\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01744573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:25:20Z","timestamp":1586287520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01744573"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["BF01744573"],"URL":"https:\/\/doi.org\/10.1007\/bf01744573","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}