Completeness for coalgebraic fixpoint logic

DOI10.4230/LIPIcs.CSL.2016.7zbMath1370.03085OpenAlexW2554804133MaRDI QIDQ5278393

Fatemeh Seifan, Sebastian Enqvist, Yde Venema

Publication date: 19 July 2017

Full work available at URL: https://doi.org/10.4230/lipics.csl.2016.7

zbMATH Keywords

coalgebraautomatacompletenessmu-calculuscoalgebraic modal logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Categorical logic, topoi (03G30)

Related Items (5)

Completeness for \(\mu\)-calculi: a coalgebraic approach ⋮ Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics ⋮ Coalgebraic logics \& duality ⋮ Unnamed Item ⋮ A propositional dynamic logic for instantial neighborhood semantics

This page was built for publication: Completeness for coalgebraic fixpoint logic