Title of article
Δ0-complexity of the relation y = Πi ⩽ nF(i) Original Research Article
Author/Authors
Alessandro Berarducci، نويسنده , , Paola DʹAquino، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
8
From page
49
To page
56
Abstract
We prove that if G is a Δ0-definable function on the natural numbers and F(n) = Πi = 0nG(i), then F is also Δ0-definable. Moreover, the inductive properties of F can be proved inside the theory IΔ0.
Journal title
Annals of Pure and Applied Logic
Serial Year
1995
Journal title
Annals of Pure and Applied Logic
Record number
890016
Link To Document