The development of decidability proofs based on sequent calculi

• Author(s) / Creator(s)

  • Katalin Bimbó

• Some logics are decidable, that is, there is an algorithm to determine whether a formula is provable in a calculus formalizing the logic. This paper aims to depict the evolution of decidability proofs based on sequent calculi from the first such proof for intuitionist logic to some of the latest results that use -- in an essential way -- the Curry-Kripke technique.

• Date created

  2020-01-01

• Subjects / Keywords

  • Curry's lemma, decidability, intuitionist logic, Kripke's lemma, modal logic, relevance logic, sequent calculus

• Type of Item

  Chapter

• DOI

  https://doi.org/10.7939/r3-psp5-e754

• License

  Attribution-NonCommercial-NoDerivatives 4.0 International