A modal proof theory for final polynomial coalgebras
- 21 August 2006
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 360 (1-3) , 1-22
- https://doi.org/10.1016/j.tcs.2005.11.041
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Final coalgebras and the Hennessy–Milner propertyAnnals of Pure and Applied Logic, 2006
- A final coalgebra theoremPublished by Springer Nature ,2005
- Observational ultraproducts of polynomial coalgebrasAnnals of Pure and Applied Logic, 2003
- What is the coalgebraic analogue of Birkhoff's variety theorem?Theoretical Computer Science, 2001
- Towards a Duality Result in Coalgebraic Modal LogicElectronic Notes in Theoretical Computer Science, 2000
- Terminal coalgebras in well-founded set theoryTheoretical Computer Science, 1993
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- On observing nondeterminism and concurrencyLecture Notes in Computer Science, 1980
- A Henkin completeness for $T$.Notre Dame Journal of Formal Logic, 1967
- The completeness of the first-order functional calculusThe Journal of Symbolic Logic, 1949