Cut elimination in coalgebraic logics-Reference-Cited by-同舟云学术

Cut elimination in coalgebraic logics

Published:2010-12 Issue:12 Volume:208 Page:1447-1468
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Pattinson Dirk,Schröder Lutz

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference30 articles.

1. Cut-free tableau calculi for some propositional normal modal logics;Amerbauer;Stud. Log.,1996

2. A. Avron, I. Lev, Canonical propositional Gentzen-type systems, in: R. Goré, A. Leitsch, T. Nipkow (Eds.), International Joint Conferences on Automated Reasoning, IJCAR 01, Lecture Notes in Computer Science, vol. 2083, Springer, 2001, pp. 529–544.

3. A new method for bounding the complexity of modal logics;Basin,1997

4. Modal Logic;Blackburn,2001

5. B. Chellas, Modal Logic, Cambridge, 1980.

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

1. Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi;Logical Methods in Computer Science;2024-07-23

2. An Inductive Construction for Many-Valued Coalgebraic Modal Logic;2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL);2023-05

3. Semantic cut elimination for the logic of bunched implications, formalized in Coq;Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs;2022-01-11

4. Sequent Calculi and Interpolation for Non-Normal Modal and Deontic Logics;Logic and Logical Philosophy;2020-10-10

5. Modal Intuitionistic Logics as Dialgebraic Logics;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08