Annals of Pure and Applied Logic 75 (1-2):49-56 (1995)
| Abstract |
We prove that if G is a Δ 0 -definable function on the natural numbers and F = Π i = 0 n G , then F is also Δ 0 -definable. Moreover, the inductive properties of F can be proved inside the theory IΔ 0
|
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.1016/0168-0072(94)00055-8 |
| Options |
Edit this record
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
On the Scheme of Induction for Bounded Arithmetic Formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (3):261-302.
Provability of the Pigeonhole Principle and the Existence of Infinitely Many Primes.J. B. Paris, A. J. Wilkie & A. R. Woods - 1988 - Journal of Symbolic Logic 53 (4):1235-1244.
Local Behaviour of the Chebyshev Theorem in Models of Iδ.Paola D'Aquino - 1992 - Journal of Symbolic Logic 57 (1):12 - 27.
Local Behaviour of the Chebyshev Theorem in Models of $I\Delta_0$.Paola D'Aquino - 1992 - Journal of Symbolic Logic 57 (1):12-27.
Citations of this work BETA
Abelian Groups and Quadratic Residues in Weak Arithmetic.Emil Jeřábek - 2010 - Mathematical Logic Quarterly 56 (3):262-278.
Similar books and articles
< I> Δ< Sub> 0-Complexity of the Relation< I> Y_=< I> Π_< Sub> I⩽ N< I> F_(< I> I).Alessandro Berarducci & Paola D'Aquino - 1995 - Annals of Pure and Applied Logic 75 (1):49-56.
Computing the Complexity of the Relation of Isometry Between Separable Banach Spaces.Julien Melleray - 2007 - Mathematical Logic Quarterly 53 (2):128-131.
Complexity of Networks II: The Set Complexity of Edge‐Colored Graphs.Tomasz M. Ignac, Nikita A. Sakhanenko & David J. Galas - 2012 - Complexity 17 (5):23-36.
Relation Algebras of Every Dimension.Roger D. Maddux - 1992 - Journal of Symbolic Logic 57 (4):1213-1229.
Computationally Tractable Pairwise Complexity Profile.Yaneer Bar‐Yam & Dion Harmon - 2013 - Complexity 18 (5):20-27.
Peirce on Complexity.Jaime Nubiola - 2001 - In Schmitz Walter (ed.), Proceedings of the 7th International Congress of the IASS-AIS.
Computational Complexity of Some Ramsey Quantifiers in Finite Models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
Analytics
Added to PP index
2014-01-16
Total views
8 ( #917,864 of 2,348,958 )
Recent downloads (6 months)
1 ( #512,628 of 2,348,958 )
2014-01-16
Total views
8 ( #917,864 of 2,348,958 )
Recent downloads (6 months)
1 ( #512,628 of 2,348,958 )
How can I increase my downloads?
Downloads
