Over 25 years ago, the first author conjectured in [15] that the existence of arbitrarily large primes is provable from the axioms I Δ₀(π) + def(π), where π(x) is the number of primes not exceeding x, IΔ₀(π) denotes the theory of Δ₀ induction for the language of arithmetic including the new function symbol π, and de f(π) is an axiom expressing the usual recursive definition of π. We prove a modified version in which π is replaced by a more general (...) function ξ that counts some of the primes below x (which primes depends on the values of parameters in ξ), and has the property that π is provably Δ₀(ξ) definable. (shrink)

It is shown that the elementary principles Count and Count are logically independent in the system IΔ0 of Bounded Arithmetic. More specifically it is shown that Count implies Count exactly when each prime factor in p is a factor in q.

We consider the theory and its weak fragments in the language of arithmetic expanded with the functional symbol . We prove that and its weak fragments, down to and , are subject to the Tennenbaum phenomenon with respect to , , and . For the last two theories it is still unknown if they may have nonstandard recursive models in the usual language of arithmetic.

It is demonstrated that we can represent Euler's φ-function by means of a Δ0-formula in such a way that the theory IΔ 0 proves the recursion equations that are characteristic for this function.

It is demonstrated that we can represent Euler's φ-function by means of a Δ0-formula in such a way that the theory IΔ 0 proves the recursion equations that are characteristic for this function.

We investigate the provability of some properties of abelian groups and quadratic residues in variants of bounded arithmetic. Specifically, we show that the structure theorem for finite abelian groups is provable in S22 + iWPHP, and use it to derive Fermat's little theorem and Euler's criterion for the Legendre symbol in S22 + iWPHP extended by the pigeonhole principle PHP. We prove the quadratic reciprocity theorem in the arithmetic theories T20 + Count2 and I Δ0 + Count2 with modulo-2 counting (...) principles. (shrink)

Finitism is given an interpretation based on two ideas about strings (sequences of symbols): a replacement principle extracted from Hilberts class 2 can be justified by means of an additional finitistic choice principle, thus obtaining a second equational theory . It is unknown whether is strictly stronger than since 2 may coincide with the class of lower elementary functions.

It can be argued that only the equational theories of some sub-elementary function algebras are finitistic or intuitive according to a certain interpretation of Hilbert's conception of intuition. The purpose of this paper is to investigate the relation of those restricted forms of equational reasoning to classical quantifier logic in arithmetic. The conclusion reached is that Edward Nelson's ‘predicative arithmetic’ program, which makes essential use of classical quantifier logic, cannot be justified finitistically and thus requires a different philosophical foundation, possibly (...) as a restricted form of logicism. (shrink)

In this second paper of the series we do a local analysis of quadratic forms over completions of a non-standard model of IΔ0+Ω1.

Gauss used quadratic forms in his second proof of quadratic reciprocity. In this paper we begin to develop a theory of binary quadratic forms over weak fragments of Peano Arithmetic, with a view to reproducing Gauss’ proof in this setting.

Gauss used quadratic forms in his second proof of quadratic reciprocity. In this paper we begin to develop a theory of binary quadratic forms over weak fragments of Peano Arithmetic, with a view to reproducing Gauss’ proof in this setting.

In [4] it is shown that only using exponentiation can one prove the existence of non trivial solutions of Pell equations in IΔ 0 . However, in this paper we will prove that any Pell equation has a non trivial solution modulo m for every m in IΔ 0.

We show that versions of the prime number theorem as well as equivalent statements hold in an arbitrary model ofIΔ 0+exp.

We investigate the “mathematical” strength of the theory I*2. In particular we prove the quadratic reciprocity law and Bertrand's postulate, using fragments of I*2 which employ some well-known number-theoretic functions.