Sciweavers

Share
19 search results - page 1 / 4
» Completeness of the finitary Moss logic
Sort
View
AIML
2008
9 years 3 months ago
Completeness of the finitary Moss logic
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
IANDC
2006
77views more  IANDC 2006»
9 years 1 months ago
Weakly complete axiomatization of exogenous quantum propositional logic
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...
Paulo Mateus, Amílcar Sernadas
LOGCOM
2010
102views more  LOGCOM 2010»
8 years 12 months ago
A Note on Expressive Coalgebraic Logics for Finitary Set Functors
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...
Lawrence S. Moss
FOSSACS
2006
Springer
9 years 5 months ago
A Finite Model Construction for Coalgebraic Modal Logic
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...
Lutz Schröder
CORR
2011
Springer
175views Education» more  CORR 2011»
8 years 8 months ago
Finitary languages
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...
Krishnendu Chatterjee, Nathanaël Fijalkow
books