Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5
Which modal logics can be ‘naturally’ captured by a sequent system? Clearly, this question hinges on what one believes to be natural, i.e. which format of sequent rules one is willing to accept. This paper studies the relationship between the format of sequent rules and the corresponding syntactical shape of axioms in an equivalent Hilbert-system. We identify three different such formats, the most general of which captures most logics in the S5-cube. The format is based on restricting the context in rule premises and the correspondence is established by translating axioms into rules of our format and vice versa. As an application we show that there is no set of sequent rules of this format which is sound and cut-free complete for S5 and for which cut elimination can be shown by the standard permutation-of-rules argument.
Unable to display preview. Download preview PDF.
- 2.Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press (2001)Google Scholar
- 4.Chellas, B.F.: Modal Logic. Cambridge University Press (1980)Google Scholar
- 10.Kracht, M.: Power and weakness of the modal display calculus. In: Wansing, H. (ed.) Proof Theory of Modal Logic, pp. 93–121. Kluwer (1996)Google Scholar
- 12.Lellmann, B., Pattinson, D.: Constructing cut free sequent systems with context restrictions based on classical or intuitionistic logic. In: Lodaya, K. (ed.) ICLA 2013. LNCS (LNAI), vol. 7750, pp. 148–160. Springer, Heidelberg (2013)Google Scholar
- 14.Negri, S., von Plato, J.: Structural proof theory. Cambridge University Press (2001)Google Scholar
- 15.Poggiolesi, F.: Gentzen Calculi for Modal Propositional Logic. Trends in Logic, vol. 32. Springer, Heidelberg (2011)Google Scholar
- 16.Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science, 2nd edn., vol. 43. Cambridge University Press (2000)Google Scholar