Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

CSL

2008

Springer

2008

Springer

We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some "minimal" reasoning (i.e., in the theory I0) using concepts such as (the logarithm) of a binomial coefficient. In fact we prove Bertrand's Postulate (that there is at least a prime number between n and 2n, for all n > 1) and the fact that the number of prime numbers between n and 2n is of order (n/ ln(n)). The proofs that we formalize are much simpler than several existing formalizations, and our theory turns out to be a sub-theory of a recent theory proposed by Woods and Cornaros that extends I0 by a special counting function.

Added |
19 Oct 2010 |

Updated |
19 Oct 2010 |

Type |
Conference |

Year |
2008 |

Where |
CSL |

Authors |
Phuong Nguyen |

Comments (0)