Admissibility of Cut in Coalgebraic Logics

Electronic Notes in Theoretical Computer Science

Volumn 203, Issue 5, 2008, Pages 221-241

  Pattinson, Dirk ^a   Schröder, Lutz ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

Coalgebraic Semantics; Cut Elimination; Modal Logic; Proof Theory

Indexed keywords

BIOMINERALIZATION; DIFFERENTIATION (CALCULUS); INTERPOLATION; NUMERICAL ANALYSIS;

CO-ALGEBRAS; COALGEBRAIC LOGICS; INTERPOLATION PROPERTIES; MODAL LOGICS; SEQUENT CALCULUS;

FUZZY LOGIC;

EID: 44649084880     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.05.027     Document Type: Article

References (22)

1. Amerbauer M. Cut-free tableau calculi for some propositional normal modal logics. Studia Logica 57 2-3 (1996) 359-371
2. Basin D., Matthews S., and Viganò L. A new method for bounding the complexity of modal logics. In: Gottlob G., Leitsch A., and Mundici D. (Eds). Computational Logic and Proof Theory. (Proceedings of the 5th Kurt Gödel Colloquium, KGC'97) (1997), Springer-Verlag, Berlin 89-102
3. Blackburn P., de Rijke M., and Venema Y. Modal Logic (2001), Cambridge University Press
4. Chellas B. Modal Logic (1980) Cambridge
5. Goré R. Cut-free sequent and tableau systems for propositional diodorean modal logics. Studia Logica 53 (1994) 433-457
6. Governatori G., and Luppi A. Labelled tableaux for non-normal modal logics. Lecture Notes in Computer Science 1792 (2000) 119-130
7. H. Hansen. Tableau games for coalition logic and alternating-time temporal logic, 2004. Master's Thesis Computer Science, Universiteit van Amsterdam
8. Hansen H.H., and Kupke C. A coalgebraic perspective on monotone modal logic. Coalgebraic Methods in Computer Science. ENTCS 106 (2004) 121-143 Elsevier
9. A. Heuerding. Sequent Calculi for Proof Search in Some Modal Logics. PhD thesis, University of Bern, 1998
10. Kurz A. Specifying coalgebras with modal logic. Theoretical Computer Science 260 1-2 (2000)
11. Maksimova L. Amalgamation and interpolation in normal modal logic. Studia Logica 50 (1991) 457-471
12. Mints G. Gentzen-type systems and resolution rules. Part I. Propositional logic. COLOG-88: Proceedings of the international conference on Computer logic (1990), Springer 198-231
13. Olivetti N., Pozzato G., and Schwind C. A sequent calculus and a theorem prover for standard conditional logics. ACM Trans. Comput. Log. 8 4 (2007)
14. Pattinson D. Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoret. Comput. Sci. 309 (2003) 177-193
15. Pauly M. A modal logic for coalitional power in games. J. Logic Comput. 12 1 (2002) 149-166
16. Rautenberg W. Modal tableau calculi and interpolation. Journal of Philosophical Logic 12 (1983) 403-423
17. Schröder L. A finite model construction for coalgebraic modal logic. Foundations Of Software Science And Computation Structures. LNCS volume 3921 (2006), Springer 157-171
18. Schröder L., and Pattinson D. PSPACE reasoning for rank-1 modal logics. Logic in Computer Science. LICS 06 (2006), IEEE 231-240
19. Schröder L., and Pattinson D. Rank-1 modal logics are coalgebraic. In: Thomas W., and Weil P. (Eds). Proc. STACS 2007. LNCS number 4393 (2007) 573-585
20. L. Schröder and D. Pattinson. PSPACE-bounds for rank-1 modal logics. ACM Trans. Comput. Log., 2008. to appear
21. Schröder L. A finite model construction for coalgebraic modal logic. J. Log. Algebr. Program. 73 1-2 (2007) 97-110
22. Troelstra A., and Schwichtenberg H. Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science Number 43 (1996), Cambridge University Press