Completeness of the finitary Moss logic

14 years 10 months ago

Download www.aiml.net

We give a sound and complete derivation system for the valid formulas in the finitary version of Moss' coalgebraic logic, for coalgebras of arbitrary type.

Clemens Kupke, Alexander Kurz, Yde Venema

Real-time Traffic

AIML 2008 | Complete Derivation | Finitary Version | Logical Reasoning | Valid Formulas |

claim paper

» A Note on Expressive Coalgebraic Logics for Finitary Set Functors

» A Finite Model Construction for Coalgebraic Modal Logic

» Finitary languages

» Reasoning about Knowledge and Continuity

» Functorial Coalgebraic Logic The Case of Manysorted Varieties

» Model Checking Freeze LTL over OneCounter Automata

» Systematic Semantic Tableaux for PLTL

» Model checking memoryful lineartime logics over onecounter automata

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	AIML
Authors	Clemens Kupke, Alexander Kurz, Yde Venema

Comments (0)

Sciweavers

Completeness of the finitary Moss logic

AIML 2008 | Complete Derivation | Finitary Version | Logical Reasoning | Valid Formulas |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers