711 search results - page 85 / 143 » Modal Logics are Coalgebraic |
159
click to vote
APAL
1999
15 years 5 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
173
click to vote
NDJFL
2002
15 years 5 months ago
2002
Shortest possible axiomatizations for the implicational fragments of the modal logics S4 and S5 are reported. Among these axiomatizations is included a shortest single axiom for im...
162
click to vote
DALT
2009
Springer
15 years 10 months ago
2009
Springer
We continue the work initiated in [1–3], where the acceptance logic, a modal logic for modelling individual and collective acceptances was introduced. This logic is aimed at capt...
171
click to vote
IJCAI
2003
15 years 7 months ago
2003
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar chy of decidable logics with multiple maximal el ements. It would be desirable to ...
154
click to vote
IANDC
2000
15 years 6 months ago
2000
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...