Δ0-complexity of the relation y = Πi ⩽ nF

Annals of Pure and Applied Logic 75 (1-2):49-56 (1995)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,346

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Relation algebras of every dimension.Roger D. Maddux - 1992 - Journal of Symbolic Logic 57 (4):1213-1229.

Analytics

Added to PP
2014-01-16

Downloads
9 (#937,492)

6 months
1 (#450,993)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Abelian groups and quadratic residues in weak arithmetic.Emil Jeřábek - 2010 - Mathematical Logic Quarterly 56 (3):262-278.
Iterated multiplication in $$ VTC ^0$$.Emil Jeřábek - forthcoming - Archive for Mathematical Logic.

Add more citations

References found in this work

On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
Local behaviour of the chebyshev theorem in models of iδ.Paola D'Aquino - 1992 - Journal of Symbolic Logic 57 (1):12 - 27.

Add more references