711 search results - page 37 / 143 » Modal Logics are Coalgebraic |
153
click to vote
AIML
2008
15 years 7 months ago
2008
In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...
205
click to vote
AMAST
2006
Springer
15 years 10 months ago
2006
Springer
This paper proposes a modal extension of Separation Logic [8, 11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logi...
152
click to vote
JSYML
2007
15 years 6 months ago
2007
We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies 1, 2, . . . s.t. every K-proof of i must...
169
click to vote
IJIS
2011
14 years 9 months ago
2011
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
138
click to vote
AML
2006
15 years 6 months ago
2006
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...