Mathematical theory of domains
Mathematical theory of domains
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata and fixed point logic: A coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Completeness for flat modal fixpoint logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Complementation of coalgebra automata
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Flat coalgebraic fixed point logics
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Duality for logics of transition systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Testing semantics: connecting processes and process logics
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |
We fix a logical connection (Stone ?? Pred : Setop ??? BA given by 2 as a schizophrenic object) and study coalgebraic modal logic that is induced by a functor T: Set ??? Set that is finitary and standard and preserves weak pullbacks and finite sets. We prove that for any such T, the cover modality nabla is a left (and its dual delta is a right) adjoint relative to ??. We then consider monotone unary modalities arising from the logical connection and show that they all are left (or right) adjoints relative to ??.