Name
Abstract | ||
|---|---|---|
In this article we study the complexity of disjunction property for intuitionistic logic, the modal logics S4, S4.1, Grzegorczyk logic, Gödel-Löb logic, and the intuitionistic counterpart of the modal logic K. For S4 we even prove the feasible interpolation theorem and we provide a lower bound for the length of proofs. The techniques we use do not require proving structural properties of the calculi in hand, such as the cut-elimination theorem or the normalization theorem. This is a key point of our approach, since it allows us to treat logics for which only Hilbert-style characterizations are known. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1145/1071596.1071598 | ACM Trans. Comput. Log. |
Keywords | Field | DocType |
modal logic,hilbert-style characterization,intuitionistic logic,feasible interpolation,feasible interpolation theorem,grzegorczyk logic,proof-length,normalization theorem,key point,disjunction property,intuitionistic counterpart,cut-elimination theorem,lower bound | Intuitionistic logic,T-norm fuzzy logics,Discrete mathematics,Accessibility relation,Kripke semantics,Normal modal logic,Multimodal logic,Many-valued logic,Mathematics,Intermediate logic | Journal |
Volume | Issue | Citations |
6 | 3 | 3 |
PageRank | References | Authors |
0.43 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mauro Ferrari | 1 | 93 | 16.05 |
| Camillo Fiorentini | 2 | 121 | 21.00 |
| Guido Fiorino | 3 | 97 | 12.71 |