Name
Abstract | ||
|---|---|---|
A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics is presented.
The method covers all modal logics characterized by Kripke frames determined by universal or geometric properties and it can
be extended to treat also Gödel–Löb provability logic. The calculi provide direct decision methods through terminating proof
search. Syntactic proofs of modal undefinability results are obtained in the form of conservativity theorems. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10992-005-2267-3 | J. Philosophical Logic |
Keywords | Field | DocType |
modal logic | Discrete mathematics,Kripke semantics,Normal modal logic,Accessibility relation,Algorithm,Multimodal logic,Proof theory,Modal logic,Mathematics,S5,Method of analytic tableaux | Journal |
Volume | Issue | ISSN |
34 | 5 | 1573-0433 |
Citations | PageRank | References |
102 | 4.94 | 16 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sara Negri | 1 | 280 | 24.76 |