Interpretability of first-order linear temporal logics in fork algebras

DOI10.1016/J.JLAP.2005.04.005zbMath1086.68086OpenAlexW1994436809MaRDI QIDQ817582

Marcelo F. Frias, Carlos G. López Pombo

Publication date: 16 March 2006

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2005.04.005

zbMATH Keywords

interpretabilitysoftware verificationtemporal logicsfork algebras

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Other algebras related to logic (03G25) Temporal logic (03B44) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25)

Related Items (1)

Exploring an Interface Model for CKA

Cites Work

• The representation of relation algebras. II
• The representation of relational algebras
• A lattice-theoretical fixpoint theorem and its applications
• Finitary Algebraic Logic
• Equational Reasoning in Non-Classical Logics
• Temporal algebra
• Relational Methods in Computer Science
• A relational model for temporal logic
• 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

This page was built for publication: Interpretability of first-order linear temporal logics in fork algebras