19 search results - page 1 / 4 » Completeness of the finitary Moss logic |
AIML
2008
14 years 10 days ago
2008
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.
IANDC
2006
13 years 11 months ago
2006
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical rea...
LOGCOM
2010
13 years 9 months ago
2010
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L∗ of the limit L of the firs...
FOSSACS
2006
Springer
14 years 2 months ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...