Sciweavers

3658 search results - page 192 / 732
» The logic of proofs, semantically
Sort
View
JSYML
2008
109views more  JSYML 2008»
15 years 6 months ago
Closed fragments of provability logics of constructive theories
In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the c...
Albert Visser
SLOGICA
2008
77views more  SLOGICA 2008»
15 years 6 months ago
Frame Based Formulas for Intermediate Logics
In this paper we define a new notion of frame based formulas. We show that the well-known examples of formulas arising from a finite frame, such as the Jankov-de Jongh formulas, s...
Nick Bezhanishvili
JSYML
2007
85views more  JSYML 2007»
15 years 6 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
LOGCOM
2010
88views more  LOGCOM 2010»
15 years 5 months ago
Tableaux for Public Announcement Logic
Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In thi...
Philippe Balbiani, Hans P. van Ditmarsch, Andreas ...
KI
2002
Springer
15 years 6 months ago
Description Logics for the Semantic Web
The vision of a Semantic Web has recently drawn considerable attention, both from academia and industry. Description Logics are often named as one of the tools that can support th...
Franz Baader, Ian Horrocks, Ulrike Sattler