- Tytuł:
- A Short and Readable Proof of Cut Elimination for Two First-Order Modal Logics
- Autorzy:
-
Gao, Feng
Tourlakis, George - Powiązania:
- https://bibliotekanauki.pl/articles/749884.pdf
- Data publikacji:
- 2015
- Wydawca:
- Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
- Tematy:
-
Modal logic
GL
QGL
first-order logic
proof theory
cut elimination
cut admissibility
provability logic - Opis:
- A well established technique toward developing the proof theory of a Hilbert-style modal logic is to introduce a Gentzen-style equivalent (a Gentzenisation), then develop the proof theory of the latter, and finally transfer the metatheoretical results to the original logic (e.g., [1, 6, 8, 18, 10, 12]). In the first-order modal case, on one hand we know that the Gentzenisation of the straightforward first-order extension of GL, the logic QGL, admits no cut elimination (if the rule is included as primitive; or, if not included, then the rule is not admissible [1]). On the other hand the (cut-free) Gentzenisations of the first-order modal logics M3 and ML3 of [10, 12] do have cut as an admissible rule. The syntactic cut admissibility proof given in [18] for the Gentzenisation of the propositional provability logic GL is extremely complex, and it was the basis of the proofs of cut admissibility of the Gentzenisations of M3 and ML3, where the presence of quantifiers and quantifier rules added to the complexity and length of the proof. A recent proof of cut admissibility in a cut-free Gentzenisation of GL is given in [5] and is quite short and easy to read. We adapt it here to revisit the proofs for the cases of M3 and ML3, resulting to similarly short and easy to read proofs, only slightly complicated by the presence of quantification and its relevant rules.
- Źródło:
-
Bulletin of the Section of Logic; 2015, 44, 3-4
0138-0680
2449-836X - Pojawia się w:
- Bulletin of the Section of Logic
- Dostawca treści:
- Biblioteka Nauki
Artykuł