The Undecidability of k-Provability

@article{Buss1991TheUO,
  title={The Undecidability of k-Provability},
  author={Samuel R. Buss},
  journal={Ann. Pure Appl. Logic},
  year={1991},
  volume={53},
  pages={75-102}
}
Buss, S.R., The undecidability of k-provability, Annals of Pure and Applied Logic 53 (1991) 75-102. The k-provability problem is, given a first-order formula 4 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. set X there is a formula @(I) and an integer k such that for all n, $(SnO) has a proof of Sk sequents if and only if n… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

The number of proof lines and the size of proofs in first - order logic

  • Jan Kraj́ıček, Pavel Pudlák
  • Archive for Mathematical Logic
  • 1988

Generalizations of proofs

  • Jan Kraj́ıček
  • Proc . Fifth Easter Conference on Model Theory…
  • 1987

Orevkov, Reconstruction of a proof from its scheme

  • V. P. lo
  • Soviet Math. Dokl
  • 1987

Reconstruction of a proof from its scheme

  • J Rohit
  • Soviet Mathematics Doklady
  • 1987

On the length of proofs in a formal system of recursive arithmetic

  • Tohru Miyatake
  • Logic Symposia , Hakone , Lecture Notes in…
  • 1980

On the length of proofs in a formal system of recursive arithmetic, Logic Symposia, Hakone, Lecture Notes in Math

  • T. Miyatake
  • 1980

Similar Papers

Loading similar papers…