\(\Delta_ 0\)-complexity of the relation \(y= \prod_{i\leq n} F(i)\) (Q1899142): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0168-0072(94)00055-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008286614 / rank | |||
Normal rank | |||
Revision as of 21:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\Delta_ 0\)-complexity of the relation \(y= \prod_{i\leq n} F(i)\) |
scientific article |
Statements
\(\Delta_ 0\)-complexity of the relation \(y= \prod_{i\leq n} F(i)\) (English)
0 references
5 November 1995
0 references
The authors prove that if \(G\) is a \(\Delta_0\)-definable function on the natural numbers and \(F(n)= \prod^n_{i=0} G(i)\), then \(F\) is also \(\Delta_0\)-definable. Moreover, the inductive properties of \(F\) can be proved inside that theory \(I\Delta_0\). The authors use the standard notation \(I\Delta_0\) to denote the fragment of Peano arithmetic where induction is restricted to bounded formulas (\(\Delta_0\)-formulas).
0 references
induction restricted to bounded formulas
0 references
\(\Delta_ 0\)-definable function
0 references
fragment of Peano arithmetic
0 references
