Prime numbers and factorization in IE1 and weaker systems

Journal of Symbolic Logic 57 (3):1057 - 1085 (1992)
  Copy   BIBTEX

Abstract

We show that IE1 proves that every element greater than 1 has a unique factorization into prime powers, although we have no way of recovering the exponents from the prime powers which appear. The situation is radically different in Bézout models of open induction. To facilitate the construction of counterexamples, we describe a method of changing irreducibles into powers of irreducibles, and we define the notion of a frugal homomorphism into Ẑ = ΠpZp, the product of the p-adic integers for each prime p

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
249 (#49,961)

6 months
2 (#302,213)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Primes and their residue rings in models of open induction.Angus Macintyre & David Marker - 1989 - Annals of Pure and Applied Logic 43 (1):57-77.

Add more references