Results 1 -
1 of
1
The Undecidability of k-Provability
- Annals of Pure and Applied Logic
, 1989
"... The k-provability problem is, given a first order formula φ and an integer k, to determine if φ has a proof consisting of k or fewer lines (i.e., formulas or sequents). This paper shows that the k-provability problem for the sequent calculus is undecidable. Indeed, for every r.e. srt X... ..."
Abstract
-
Cited by 25 (0 self)
- Add to MetaCart
The k-provability problem is, given a first order formula φ and an integer k, to determine if φ has a proof consisting of k or fewer lines (i.e., formulas or sequents). This paper shows that the k-provability problem for the sequent calculus is undecidable. Indeed, for every r.e. srt X...
