Skip to main content
Log in

Abstract

A first-order system F has theKreisel length-of-proof property if the following statement is true for all formulasϕ(x): If there is ak⩾1 such that for alln⩾0 there is a proof ofϕ(¯n) in F with at mostk lines, then there is a proof of ∀xϕ(x) in F. We consider this property for “Parikh systems”, which are first-order axiomatic systems that contain a finite number of axiom schemata (including individual axioms) and a finite number of rules of inference. We prove that any usual Parikh system formulation of Peano arithmetic has the Kreisel length-of-proof property if the underlying logic of the system is formulated without a schema for universal instantiation in either one of two ways. (In one way, the formula to be instantiated is built up in steps, and in the other way, the term to be substituted is built up in steps.) Our method of proof uses techniques and ideas from unification theory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Baaz, Generalizing proofs with order-induction, manuscript.

  2. M. Baaz, Generalizing proofs with successor-induction, manuscript.

  3. H.B. Enderton,A Mathematical Introduction to Logic (Academic Press, Orlando, 1972).

    Google Scholar 

  4. W.M. Farmer, Length of proofs and unification theory, Ph.D. Thesis, University of Wisconsin-Madison (1984).

    Google Scholar 

  5. W.M. Farmer, A unification algorithm for second-order monadic terms, Ann. Pure Appl. Logic 39 (1988) 131–174.

    Google Scholar 

  6. W.M. Farmer, Simple second-order languages for which unification is undecidable, Theor. Comp. Sci. 87 (1991) 25–41.

    Google Scholar 

  7. W.M. Farmer, A unification-theoretic method for investigating thek-provability problem, Ann. Pure Appl. Logic 51 (1991) 173–214.

    Google Scholar 

  8. H. Friedman, One hundred and two problems in mathematical logic, J. Symbolic Logic 40 (1975) 113–129.

    Google Scholar 

  9. W.D. Goldfarb, The undecidability of the second-order unification problem, Theor. Comp. Sci. 13 (1981) 225–230.

    Google Scholar 

  10. S.C. Kleene,Introduction to Metamathematics (Van Nostrand, New York, 1952).

    Google Scholar 

  11. K. Knight, Unification: a multidisciplinary survey, ACM Comp. Surveys 21 (1989) 93–124.

    Google Scholar 

  12. J. Krajíček, Generalizations of proofs, in:Proc. 5th Easter Conf. on Model Theory, Seminarberichte, no. 93 (Humboldt University, East Berlin, 1987) pp. 82–91.

    Google Scholar 

  13. J. Krajíček and P. Pudlák, The number of proof lines and the size of proofs in first order logic, Arch. Math. Logic 27 (1988) 69–84.

    Google Scholar 

  14. G. Kreisel, Proof theory: some personal recollections, in: Appendix of G. Takeuti,Proof Theory, 2nd ed. (North-Holland, Amsterdam, 1987) pp. 395–405.

    Google Scholar 

  15. T. Miyatake, On the length of proofs in formal systems, Tsukuba J. Math. 4 (1980) 115–125.

    Google Scholar 

  16. T. Miyatake, On the length of proofs in a formal system of recursive arithmetic, in:Logic Symposia: Hakone 1979, 1980 (Proceedings), ed. G.H. Mueller, Lecture Notes in Mathematics, vol. 891 (Springer, New York, 1981) pp. 81–108.

    Google Scholar 

  17. J.D. Monk,Mathematical Logic (Springer, New York, 1976).

    Google Scholar 

  18. V.P. Orevkov, Theorems with very short proof can be strengthened, Semiotika i Informatika 12 (Moscow, 1979) 37–38 [in Russian; English translation: Selecta Mathematica Sovietica 7 (1988) 37–38].

    Google Scholar 

  19. R.J. Parikh, Some results on the length of proofs, Trans. Amer. Math. Soc. 117 (1973) 29–36.

    Google Scholar 

  20. M. Presburger, Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, Sprawozdanie z I Kongresu Matematyków Krajów Słowiańskich, Warszawa, 1929 (Warsaw, 1930) 92–101, 395.

  21. P. Pudlák, On a unification problem related to Kreisel's conjecture, Commentationes Mathematicae Universitatis Carolinae 29 (1988) 551–556.

    Google Scholar 

  22. D. Richardson, Sets of theorems with short proofs, J. Symbolic Logic 39 (1974) 235–242.

    Google Scholar 

  23. J. Siekmann, Unification Theory, J. Symbolic Computation 7 (1989) 207–274.

    Google Scholar 

  24. A. Tarski, A simplified formalization of predicate logic with identity, Archiv für Mathematische Logic und Grundlagenforschung 7 (1965) 61–79.

    Google Scholar 

  25. T. Yukami, A theorem on the formalized arithmetic with function symbols' and +, Tsukuba J. Math. 1 (1977) 195–211.

    Google Scholar 

  26. T. Yukami, A note on a formalized arithmetic with function symbols' and +, Tsukuba J. Math. 2 (1978) 69–73.

    Google Scholar 

  27. T. Yukami, Taking out LK parts from a proof in Peano arithmetic, J. Symbolic Logic 51 (1986) 682–700.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Farmer, W.M. The Kreisel length-of-proof problem. Ann Math Artif Intell 6, 27–55 (1992). https://doi.org/10.1007/BF01531022

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01531022

Keywords

Navigation