This is a decommissioned version of ERA which is running to enable completion of migration processes. All new collections and items and all edits to existing items should go to our new ERA instance at https://ualberta.scholaris.ca - Please contact us at erahelp@ualberta.ca for assistance!
Communities and Collections
Usage
- 70 views
- 142 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