A unifying theorem for algebraic semantics and dynamic logics

DOI10.1016/0890-5401(87)90049-6zbMath0616.03016MaRDI QIDQ1821095

Hajnalka Andréka, Istvan Németi, Irène Guessarian

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

dynamic algebrasultraproductscontinuous algebrasfirst-order axiomatizabilitycomputational models of programsfirst-order definability of classes of models

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Related Items (2)

Complexity of equations valid in algebras of relations. I: Strong non-finitizability ⋮ Algebraization of quantifier logics, an introductory overview

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Defining relations for full semigroups of finite transformations
• A complete logic for reasoning about programs via nonstandard model theory. II
• Every free algebra in the variety generated by the representable dynamic algebras is separable and representable
• Cylindric set algebras. Cylindric set algebras and related structures. By L. Henkin, J. D. Monk, and A. Tarski. On cylindric-relativized set algebras. By H. Andreka and I. Nemeti
• On some classes of interpretations
• Model theory
• On the termination of program schemas
• Data Types as Lattices
• A Powerdomain Construction
• Initial Algebra Semantics and Continuous Algebras

This page was built for publication: A unifying theorem for algebraic semantics and dynamic logics