Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
45
From page
1
To page
45
Abstract
We define a class of functions, the descent recursive functions, relative to an arbitrary elementary recursive system of ordinal notations. By means of these functions, we provide a general technique for measuring the proof-theoretic strength of a variety of systems of first-order arithmetic. We characterize the provable well-orderings and provably recursive functions of these systems, and derive various conservation and equiconsistency results.
Journal title
Annals of Pure and Applied Logic
Serial Year
1995
Journal title
Annals of Pure and Applied Logic
Record number
889979
Link To Document