Fork algebras as a sufficiently rich universal institution
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 prepositional monomodal logics, prepositional and first-order dynamic logic, and prepositional and first-order linea...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | SER |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03029743_v4019LNCS_n_p235_Pombo |
| Aporte de: |
| Sumario: | 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 prepositional monomodal logics, prepositional and first-order dynamic logic, and prepositional 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. © Springer-Verlag Berlin Heidelberg 2006. |
|---|