On the length of proofs in a formal system of recursive arithmetic
Part of the Lecture Notes in Mathematics book series (LNM, volume 891)
- 172 Downloads
KeywordsInference 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.
- Cleave, J.P. & Rose, H.E.: n-arithmetic, in “Sets, models and recursion theory” ed. by Crossley, North-Holland, Amsterdam, 1967.Google Scholar
- Gentzen, G.: Investigations into logical deduction, in “The collected papers of G. Gentzen”, ed. by M. E. Szabo, North-Holland, 1969.Google Scholar
- Goodstein, R.J.: Recusive number theory, Amsterdam, 1957.Google Scholar
© Springer-Verlag 1981