A modal proof theory for final polynomial coalgebras
DOI10.1016/j.tcs.2005.11.041zbMath1097.68091MaRDI QIDQ2503317
Robert Goldblatt, David Friggens
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.041
modal logic; inference rule; bisimulation; incompleteness; final coalgebra; polynomial functor; infinitary proof theory; Hennessy-Milner property; Lindenbaum property; canonical coalgebra; debucibility relation; maximally consistent set
03B45: Modal logic (including the logic of norms)
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
03G30: Categorical logic, topoi
18C50: Categorical semantics of formal languages
03F03: Proof theory in general (including proof-theoretic semantics)
Cites Work
- Stone coalgebras
- Coalgebraic logic
- Model theory
- Observational ultraproducts of polynomial coalgebras.
- A small final coalgebra theorem
- Universal coalgebra: A theory of systems
- Category theory and computer science. Manchester, UK, September 5--8, 1989. Proceedings
- Terminal coalgebras in well-founded set theory
- A Henkin completeness theorem for T
- Final coalgebras and the Hennessy-Milner property
- Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study
- Algebraic laws for nondeterminism and concurrency
- On Some Completeness Theorems in Modal Logic
- The temporal logic of coalgebras via Galois algebras
- An approach to object semantics based on terminal co-algebras
- The completeness of the first-order functional calculus
- Specifying coalgebras with modal logic
- From modal logic to terminal coalgebras
- What is the coalgebraic analogue of Birkhoff's variety theorem?
- 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
