Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Abstract and concrete categories
Abstract and concrete categories
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Specifying coalgebras with modal logic
Theoretical Computer Science
On final coalgebras of continuous functors
Theoretical Computer Science - Category theory and computer science
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Proof systems for π-calculus logics
Logic for concurrency and synchronisation
ACM SIGACT News
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Presenting functors by operations and equations
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Duality for logics of transition systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
The least fibred lifting and the expressivity of coalgebraic modal logic
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Modular construction of complete coalgebraic logics
Theoretical Computer Science
A Name Abstraction Functor for Named Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Electronic Notes in Theoretical Computer Science (ENTCS)
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
Structural Operational Semantics and Modal Logic, Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Presenting functors on many-sorted varieties and applications
Information and Computation
Coalgebraic logic over general measurable spaces ??? a survey
Mathematical Structures in Computer Science
A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Coinductive Predicates and Final Sequences in a Fibration
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Polyadic coalgebraic modal logic is studied in the setting of locally presentable categories. It is shown that under certain assumptions, accessible functors admit expressive logics for their coalgebras. Examples include typical functors used to describe systems with name binding, interpreted in nominal sets.