29 search results - page 1 / 6 » On the Proof Theory of the Modal mu-Calculus |
85
Voted
SLOGICA
2008
14 years 10 months ago
2008
We study the proof-theoretic relationship between two deductive systems for the modal mu-calculus. First we recall an infinitary system which contains an omega rule allowing to de...
90
Voted
ICALP
1997
Springer
15 years 1 months ago
1997
Springer
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
ENTCS
2006
14 years 10 months ago
2006
Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This proc...
AIML
2004
14 years 11 months ago
2004
The family of normal propositional modal logic systems are given a highly systematic organisation by their model theory. This model theory is generally given using Kripkean frame s...
CPP
2011
13 years 10 months ago
2011
Abstract. Dependent session types allow us to describe not only properties of the I/O behavior of processes but also of the exchanged data. In this paper we show how to exploit dep...