2008The Review of Symbolic LogicOpen access

A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5

Francesca Poggiolesi

Open full text 61 citations

Abstract

In this paper, we present a simple sequent calculus for the modal propositional logic S5. We prove that this sequent calculus is theoremwise equivalent to the Hilbert-style system S5, that it is contraction-free and cut-free, and finally that it is decidable. All results are proved in a purely syntactic way.

About this research paper

What this paper is about

In this paper, we present a simple sequent calculus for the modal propositional logic S5. We prove that this sequent calculus is theoremwise equivalent to the Hilbert-style system S5, that it is contraction-free and cut-free, and finally that it is decidable. All results are proved in a purely syntactic way.

Why it matters

OpenAlex reports 61 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we present a simple sequent calculus for the modal propositional logic S5. We prove that this sequent calculus is theoremwise equivalent to the Hilbert-style system S5, that it is contraction-free and cut-free, and finally that it is decidable. All results are proved in a purely syntactic way.

Key concepts: Sequent calculus, Sequent, Cut-elimination theorem, Natural deduction, Calculus (dental), Mathematics, Modal logic, Decidability

Related papers

Back to paper searchBrowse research topicsOriginal source
A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5 — Research Paper | ScholarLens