zbMATH — the first resource for mathematics

Fork algebras as a sufficiently rich universal institution. (English) Zbl 1235.03086
Johnson, Michael (ed.) et al., Algebraic methodology and software technology. 11th international conference, AMAST 2006, Kuressaare, Estonia, July 5–8, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-35633-2/pbk). Lecture Notes in Computer Science 4019, 235-247 (2006).
Summary: Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, several propositional monomodal logics, propositional and first-order dynamic logic, and propositional and first-order linear temporal logic in the theory of fork algebras.
In this paper we formalize these interpretability results as institution representations from the institution of the corresponding logics to that of fork algebra. We also advocate for the institution of fork algebras as a sufficiently rich universal institution into which institutions meaningful in software development can be represented.
For the entire collection see [Zbl 1107.68013].

03G15 Cylindric and polyadic algebras; relation algebras
03G30 Categorical logic, topoi
68N30 Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Full Text: DOI