; Department of Mathematics; University of California, San Diego; n
SVM HeaderParse 0.2
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...