{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:11:12Z","timestamp":1725459072317},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540156895"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028786","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T17:15:07Z","timestamp":1138209307000},"page":"8-17","source":"Crossref","is-referenced-by-count":0,"title":["A unifying theorem for algebraic semantics and dynamic logics"],"prefix":"10.1007","author":[{"given":"H.","family":"Andreka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Guessarian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"N\u00e9meti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"ADJ","year":"1977","unstructured":"ADJ. Initial algebra semantics and continuous algebras. J. ACM 24 (1977), 68\u201395.","journal-title":"J. ACM"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(82)90004-4","volume":"17","author":"H. Andr\u00e9ka","year":"1982","unstructured":"H. Andr\u00e9ka, I. N\u00e9meti, I. Sain, A complete logic for reasoning about programs via nonstandard model theory. Theoretical Computer Science 17 (1982) 193\u2013212, 259\u2013278.","journal-title":"Theoretical Computer Science"},{"key":"2_CR3","first-page":"388","volume":"17","author":"B. Courcelle","year":"1978","unstructured":"B. Courcelle, I. Guessarian, On some classes of interpretations, JCSS 17 (1978), 388\u2013413.","journal-title":"JCSS"},{"key":"2_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10284-1","volume-title":"Algebraic semantics, LNCS 99","author":"I. Guessarian","year":"1981","unstructured":"I. Guessarian, Algebraic semantics, LNCS 99 Springer Verlag, Berlin (1981)."},{"key":"2_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0095612","volume-title":"Cylindric set algebras, LN Maths 883","author":"L. Henkin","year":"1981","unstructured":"L. Henkin, D. Monk, A. Tarski, H. Andr\u00e9ka, I. N\u00e9m\u00e9ti, Cylindric set algebras, LN Maths 883, Springer Verlag, Berlin (1981)."},{"key":"2_CR6","unstructured":"B. Jonsson, The theory of binary relations, Proc. S\u00e9minaire de Math\u00e9matiques sup\u00e9rieures de l'Universit\u00e9 de Montr\u00e9al (1984)."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0019-9958(75)90415-5","volume":"29","author":"D.J. Kfoury","year":"1975","unstructured":"D.J. Kfoury, D.M. Park, On the termination of program schemas. Information and Control 29 (1975), 243\u2013251.","journal-title":"Information and Control"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0025782","volume":"131","author":"D. Kozen","year":"1982","unstructured":"D. Kozen, On induction vs. *-continuity. In: Logics of Programs (Proc. New York 1981) Lecture Notes in Computer Science 131, Springer Verlag 1982, 167\u2013176.","journal-title":"Lecture Notes in Computer Science"},{"key":"2_CR9","first-page":"281","volume":"117","author":"I. N\u00e9meti","year":"1981","unstructured":"I. N\u00e9meti, Dynamic algebras of programs FCT 81, LNCS 117 Springer Verlag, Berlin (1981), 281\u2013290.","journal-title":"LNCS"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(82)90030-5","volume":"17","author":"I. N\u00e9meti","year":"1982","unstructured":"I. N\u00e9meti. Every free algebra in the variety generated by separable dynamic algebras is separable and representable, TCS 17 (1982), 343\u2013347.","journal-title":"TCS"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BFb0025789","volume":"131","author":"I. N\u00e9meti","year":"1982","unstructured":"I. N\u00e9meti, Nonstandard dynamic logic. In: Logics of Programs (Proc. New York 1981) Lecture Notes in Computer Science 131, Springer-Verlag 1982, 311\u2013348.","journal-title":"Lecture Notes in Computer Science"},{"key":"2_CR12","first-page":"255","volume":"15","author":"M. Nivat","year":"1975","unstructured":"M. Nivat, On the interpretation of recursive polyadic program schemes Symp. Mathematica 15, Rome (1975), 255\u2013281.","journal-title":"Mathematica"},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G. Plotkin","year":"1976","unstructured":"G. Plotkin, A power domain construction. SIAM J. Comp. 5 (1976), 452\u2013487.","journal-title":"SIAM J. Comp."},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0049-237X(09)70196-X","volume":"104","author":"V. R. Pratt","year":"1982","unstructured":"V. R. Pratt, Dynamic Logic. In: Logic, Methodology and Philosophy of Science VI. (Proc. Hannover 1979) Studies in Logic and the foundations of math. Vol. 104, North Holland (1982), 251\u2013261.","journal-title":"Studies in Logic and the foundations of math."},{"key":"2_CR15","unstructured":"J. Relterman, V. Trnkova, From dynamic algebras to test algebras. Preprint, Charles University Prague, (1984)."},{"key":"2_CR16","unstructured":"I. Sain, On the applicability of a category-theoretic notion of ultraproducts (in Hungarian). Matematikai lapok 31, No 1, 3 (1983)."},{"key":"2_CR17","unstructured":"I. Sain, Bui Huy Hien, Category theoretic notions of ultraproducts, Studia Math. Sci. Hungar., to appear."},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"D. Scott, Data types as lattices, SIAM J. Comput. 5 (1976), 522\u2013587.","journal-title":"SIAM J. Comput."},{"key":"2_CR19","first-page":"23","volume":"15","author":"M. Smyth","year":"1978","unstructured":"M. Smyth, Powerdomains, J. CCS 15 (1978), 23\u201336.","journal-title":"J. CCS"},{"key":"2_CR20","unstructured":"K.C. Ng, A. Tarski, Relation algebras with transitive closure. Notices Amer. Math. Soc., vol. 24 (1977), p. A-29."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028786.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:58:51Z","timestamp":1607551131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540156895"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0028786","relation":{},"subject":[]}}