This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Communities and Collections
Usage
- 92 views
- 195 downloads
The development of decidability proofs based on sequent calculi
-
- Author(s) / Creator(s)
-
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
-
- Type of Item
- Chapter