Abstract
The admissible rules of a logic are those rules under which the set of theorems of the logic is closed. In a previous paper by the authors, formal systems for deriving the admissible rules of Intuitionistic Logic and a class of modal logics were defined in a proof-theoretic framework where the basic objects of the systems are sequent rules. Here, the framework is extended to cover derivability of the admissible rules of intermediate logics and a wider class of modal logics, in this case, by taking hypersequent rules as the basic objects.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avron, A.: A constructive analysis of RM. Journal of Symbolic Logic 52(4), 939–951 (1987)
Chagrov, A., Zakharyaschev, M.: Modal Logic. Oxford University Press, Oxford (1996)
Ciabattoni, A., Ferrari, M.: Hypersequent calculi for some intermediate logics with bounded Kripke models. Journal of Logic and Computation 11(2), 283–294 (2001)
Ghilardi, S.: Unification in intuitionistic logic. Journal of Symbolic Logic 64(2), 859–880 (1999)
Ghilardi, S.: Best solving modal equations. Annals of Pure and Applied Logic 102(3), 184–198 (2000)
Ghilardi, S., Sacchetti, L.: Filtering unification and most general unifiers in modal logic. Journal of Symbolic Logic 69(3), 879–906 (2004)
Iemhoff, R.: On the admissible rules of intuitionistic propositional logic. Journal of Symbolic Logic 66(1), 281–294 (2001)
Iemhoff, R.: Intermediate logics and Visser’s rules. Notre Dame Journal of Formal Logic 46(1), 65–81 (2005)
Iemhoff, R., Metcalfe, G.: Proof theory for admissible rules. (submitted), http://www.math.vanderbilt.edu/people/metcalfe/publications
Jerábek, E.: Admissible rules of modal logics. Journal of Logic and Computation 15, 411–431 (2005)
Metcalfe, G., Olivetti, N., Gabbay, D.: Proof Theory for Fuzzy Logics. Springer Series in Applied Logic, vol. 36. Springer, Heidelberg (to appear, 2009)
Rozière, P.: Regles Admissibles en calcul propositionnel intuitionniste. PhD thesis, Université Paris VII (1992)
Rybakov, V.: Admissibility of Logical Inference Rules. Elsevier, Amsterdam (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iemhoff, R., Metcalfe, G. (2008). Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2009. Lecture Notes in Computer Science, vol 5407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92687-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-92687-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92686-3
Online ISBN: 978-3-540-92687-0
eBook Packages: Computer ScienceComputer Science (R0)