Cut-Elimination for the Modal Grzegorczyk Logic via Non-well-founded Proofs-Reference-Cited by-同舟云学术

Cut-Elimination for the Modal Grzegorczyk Logic via Non-well-founded Proofs

Published:2017 Issue: Volume: Page:321-335
ISSN:0302-9743
Container-title:Logic, Language, Information, and Computation
language:
Short-container-title:

Author:

Savateev Yury,Shamkanov Daniyar

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-55386-2_23

Reference6 articles.

1. Avron, A.: On modal systems having arithmetical interpretations. J. Symb. Log. 49(3), 935–942 (1984)

2. Borga, M., Gentilini, P.: On the proof theory of the modal logic Grz. Math. Log. Q. 32(10–12), 145–148 (1986)

3. Maksimova, L.L.: On modal Grzegorczyk logic. Fundamenta Informaticae 81(1–3), 203–210 (2008). Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science, In: Recognition of Professor Andrzej Grzegorczyk

4. Maksimova, L.L.: The Lyndon property and uniform interpolation over the Grzegorczyk logic. Sib. Math. J. 55(1), 118–124 (2014)

5. Dyckhoff, R., Negri, S.: A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel-McKinsey-Tarski embedding. J. Log. Comput. 26(1), 169–187 (2016)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Cyclic Proof System for Guarded Kleene Algebra with Tests;Lecture Notes in Computer Science;2024

2. NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC;The Review of Symbolic Logic;2020-06-29

3. Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs;Logic, Language, Information, and Computation;2019

4. The Lambek Calculus with Iteration: Two Variants;Logic, Language, Information, and Computation;2017