Formalised Cut Admissibility for Display Logic-Reference-Cited by-同舟云学术

Formalised Cut Admissibility for Display Logic

Published:2002 Issue: Volume: Page:131-147
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Dawson Jeremy E.,Goré Rajeev

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45685-6_10

Reference11 articles.

1. N D Belnap. Display logic. Journal of Philosophical Logic, 11:375–417, 1982.

2. Jeremy E Dawson and R Goré. Embedding display calculi into logical frameworks: Comparing Twelf and Isabelle. In C Fidge (Ed), Proc. CATS 2001: The Australian Theory Symposium, ENTCS, 42: 89–103, 2001, Elsevier.

3. J E. Dawson and R Gore. A new machine-checked proof of strong normalisation for display logic. Submitted 2001.

4. Lect Notes Comput Sci;R. Goré,1997

5. R Goré. Substructural logics on display. Logic Journal of the Interest Group in Pure and Applied Logic, 6(3):451–504, 1998.

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

1. A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense Logic;Lecture Notes in Computer Science;2021

2. Software Tool Support for Modular Reasoning in Modal Logics of Actions;Interactive Theorem Proving;2018

3. Machine-Checked Meta-theory of Dual-Tableaux for Intuitionistic Logic;Outstanding Contributions to Logic;2018

4. Issues in Machine-Checking the Decidability of Implicational Ticket Entailment;Lecture Notes in Computer Science;2017

5. Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi;Automated Reasoning;2016