This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chang, C.C. & Keisler, H.J.: Model Theory, North-Holland, Amsterdam, 1973.
Curry, H.B.: A formalization of recursive arithmetic, Amer. J. Math. 63 (1941), 263–282.
Cleave, J.P. & Rose, H.E.: n-arithmetic, in “Sets, models and recursion theory” ed. by Crossley, North-Holland, Amsterdam, 1967.
Gentzen, G.: Investigations into logical deduction, in “The collected papers of G. Gentzen”, ed. by M. E. Szabo, North-Holland, 1969.
Goodstein, R.J.: Recusive number theory, Amsterdam, 1957.
Parikh, R.J.: Some results on the length of proofs, Trans. Amer. Math. Soc. 177 (1973), 29–36.
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).
Miyatake, T.: On the length of proofs in formal systems, Tsukuba J. Math. 4 (1980), 115–125.
Yukami, T.: A theorem on the formalized arithmetic with function symbol ′ and +, Tsukuba J. Math. 1 (1977), 195–211.
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Miyatake, T. (1981). On the length of proofs in a formal system of recursive arithmetic. In: Müller, G.H., Takeuti, G., Tugué, T. (eds) Logic Symposia Hakone 1979, 1980. Lecture Notes in Mathematics, vol 891. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090981
Download citation
DOI: https://doi.org/10.1007/BFb0090981
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11161-0
Online ISBN: 978-3-540-38633-9
eBook Packages: Springer Book Archive