ERA is in the process of being migrated to Scholaris, a Canadian shared institutional repository service (https://scholaris.ca). Deposits to existing ERA collections are frozen until migration is complete. Please contact erahelp@ualberta.ca for further assistance
Communities and Collections
Usage
- 59 views
- 116 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