Results 1 
3 of
3
The Undecidability of kProvability
 Annals of Pure and Applied Logic
, 1989
"... The kprovability 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 kprovability problem for the sequent calculus is undecidable. Indeed, for every r.e. srt X... ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
The kprovability 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 kprovability problem for the sequent calculus is undecidable. Indeed, for every r.e. srt X...
ON THE NUMBER OF STEPS IN PROOFS
, 1989
"... In this paper we prove some results about the complexity of proofs. We consider proofs in Hilbertstyle formal systems such as in [17J. Thus a proof is a sequence of formulas satisfying certain conditions. We caD view the formulas as being strings of symbols; hence the whole proof is a string too. W ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
In this paper we prove some results about the complexity of proofs. We consider proofs in Hilbertstyle formal systems such as in [17J. Thus a proof is a sequence of formulas satisfying certain conditions. We caD view the formulas as being strings of symbols; hence the whole proof is a string too. We consider the following measures of complexity of proofs: length ( = the number of symbols in the proof), depth ( = the maximal depth of a formula in the proof) and number o! steps ( = the number of formulas in the proof). For a particular formaI system and a given formula A we consider the shortest length of a proof of A, the minimal depth ofa proof of A and the minimal number of steps in a proof of A. The main results are the following: (1) a bound on the depth in terms of the number of steps: Theorem 2.2, (2) a bound on the depth in terms of the length: Theorem 2.3, (3) a bound on the length in terms of the number of steps for restricted systems: Theorem 3.1. These results are applied to obtain several corollaries. In particular we show: (1) a bound on the number of steps in a cutfree proof, (2) some speedup results, (3) bounds on the number of steps in proofs of ParisHarrington sentences. Some paper