Sciweavers

825 search results - page 29 / 165
» Modal Logics with Counting
Sort
View
AMAST
2006
Springer
13 years 11 months ago
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic
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...
Susumu Nishimura
JSYML
2007
85views more  JSYML 2007»
13 years 7 months ago
Lower bounds for modal logics
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...
Pavel Hrubes
IJIS
2011
83views more  IJIS 2011»
12 years 11 months ago
Conceptual modeling in full computation-tree logic with sequence modal operator
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...
Ken Kaneiwa, Norihiro Kamide
AML
2006
49views more  AML 2006»
13 years 7 months ago
No Escape from Vardanyan's theorem
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...
Albert Visser, Maartje de Jonge
ENTCS
2002
104views more  ENTCS 2002»
13 years 7 months ago
A Note on Coalgebras and Presheaves
We show that the category of coalgebras of a wide-pullback preserving endofunctor on a category of presheaves is itself a category of presheaves. This illustrates a connection bet...
James Worrell