\(\Delta_ 0\)-complexity of the relation \(y= \prod_{i\leq n} F(i)\)
From MaRDI portal
Publication:1899142
DOI10.1016/0168-0072(94)00055-8zbMath0838.03042OpenAlexW2008286614MaRDI QIDQ1899142
Paola D'Aquino, Alessandro Berarducci
Publication date: 5 November 1995
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(94)00055-8
fragment of Peano arithmetic\(\Delta_ 0\)-definable functioninduction restricted to bounded formulas
Related Items (3)
Iterated multiplication in \(VTC^0\) ⋮ Commutative unital rings elementarily equivalent to prescribed product rings ⋮ Non-standard finite fields over \(I\Delta_0+\Omega_1\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the scheme of induction for bounded arithmetic formulas
- Counting $Δ_0$ sets
- Local behaviour of the Chebyshev theorem in models of I⊿0
- Expectations for Inbreeding Depression on Self-Fertilization of Tetraploids
- Rudimentary Predicates and Relative Computation
- Provability of the pigeonhole principle and the existence of infinitely many primes
This page was built for publication: \(\Delta_ 0\)-complexity of the relation \(y= \prod_{i\leq n} F(i)\)
