38 search results - page 1 / 8 » A proof of topological completeness for S4 in (0, 1) |
APAL
2005
13 years 4 months ago
2005
AML
2006
13 years 5 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
APAL
2005
13 years 4 months ago
2005
A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of se...
AIML
2006
13 years 6 months ago
2006
We propose a framework for comparing the expressive power and computational behaviour of modal logics designed for reasoning about qualitative aspects of metric spaces. Within this...
CSL
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. It has been proved by Niwi´nski and Walukiewicz that a deterministic tree language is either Π1 1 -complete or it is on the level Π0 3 of the Borel hierarchy, and that...