Sciweavers

2573 search results - page 31 / 515
» Combinations of Modal Logics
Sort
View
TABLEAUX
2000
Springer
13 years 11 months ago
MSPASS: Modal Reasoning by Translation and First-Order Resolution
mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for ...
Ullrich Hustadt, Renate A. Schmidt
AIML
2004
13 years 8 months ago
A Systematic Proof Theory for Several Modal Logics
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...
Charles Stewart, Phiniki Stouppa
IANDC
2007
127views more  IANDC 2007»
13 years 7 months ago
Temporal logics with incommensurable distances are undecidable
Temporal logic based on the two modalities “Since” and “Until” (TL) is the most popular logic for the specification of reactive systems. It is often called the linear tim...
Alexander Rabinovich
CORR
2004
Springer
110views Education» more  CORR 2004»
13 years 7 months ago
On Modal Logics of Partial Recursive Functions
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
Pavel Naumov
APAL
2006
76views more  APAL 2006»
13 years 7 months ago
Non-primitive recursive decidability of products of modal logics with expanding domains
We show that--unlike products of `transitive' modal logics which are usually undecidable-their `expanding domain' relativisations can be decidable, though not in primiti...
David Gabelaia, Agi Kurucz, Frank Wolter, Michael ...