Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Modal logic
Automata and Algebras in Categories
Automata and Algebras in Categories
Sts: a structural theory of sets
Sts: a structural theory of sets
Theoretical Computer Science - Selected papers of CMCS'03
A coalgebraic view on positive modal logic
Theoretical Computer Science - Selected papers of CMCS'03
On the final sequence of a finitary set functor
Theoretical Computer Science
PSPACE Bounds for Rank-1 Modal Logics
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Duality for logics of transition systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Free Heyting algebras: revisited
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Distributive lattice-structured ontologies
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Kripke Semantics for Modal Bilattice Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
In this paper we discuss a uniform method for constructing free modal and distributive modal algebras. This method draws on works by (Abramsky 2005) and (Ghilardi 1995). We revisit the theory of normal forms for modal logic and derive a normal form representation for positive modal logic. We also show that every finitely generated free modal and distributive modal algebra axiomatised by equations of rank 1 is a reduct of a temporal algebra.