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

  • Tohru Miyatake
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 891)


Inference Rule Free Variable Basic Sequent Main Lemma Remainder Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Chang, C.C. & Keisler, H.J.: Model Theory, North-Holland, Amsterdam, 1973.zbMATHGoogle Scholar
  2. [2]
    Curry, H.B.: A formalization of recursive arithmetic, Amer. J. Math. 63 (1941), 263–282.MathSciNetCrossRefzbMATHGoogle Scholar
  3. [3]
    Cleave, J.P. & Rose, H.E.: n-arithmetic, in “Sets, models and recursion theory” ed. by Crossley, North-Holland, Amsterdam, 1967.Google Scholar
  4. [4]
    Gentzen, G.: Investigations into logical deduction, in “The collected papers of G. Gentzen”, ed. by M. E. Szabo, North-Holland, 1969.Google Scholar
  5. [5]
    Goodstein, R.J.: Recusive number theory, Amsterdam, 1957.Google Scholar
  6. [6]
    Parikh, R.J.: Some results on the length of proofs, Trans. Amer. Math. Soc. 177 (1973), 29–36.MathSciNetCrossRefzbMATHGoogle Scholar
  7. [7]
    Rose, H.E.: On the consistency and undecidability of recursive arithmetic, Zeitschr. f. math. Logik u. Grundlagen d. Math., Bd. 7 S. 124–135, (1961).MathSciNetCrossRefzbMATHGoogle Scholar
  8. [8]
    Miyatake, T.: On the length of proofs in formal systems, Tsukuba J. Math. 4 (1980), 115–125.MathSciNetzbMATHGoogle Scholar
  9. [9]
    Yukami, T.: A theorem on the formalized arithmetic with function symbol ′ and +, Tsukuba J. Math. 1 (1977), 195–211.MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag 1981

Authors and Affiliations

  • Tohru Miyatake

There are no affiliations available

Personalised recommendations