825 search results - page 83 / 165 » Modal Logics with Counting |
APAL
1999
13 years 7 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...
NDJFL
2002
13 years 7 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...
DALT
2009
Springer
14 years 16 days 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...
IANDC
2000
13 years 7 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...
MST
2010
13 years 2 months ago
2010
This paper is devoted to the study of self-referential proofs and/or justifications, i.e., valid proofs that prove statements about these same proofs. The goal is to investigate wh...