Prime numbers and factorization in IE1 and weaker systems

Publisher: Cambridge University Press

E-ISSN: 1943-5886|57|3|1057-1085

ISSN: 0022-4812

Source: The Journal of Symbolic Logic, Vol.57, Iss.3, 1992-09, pp. : 1057-1085

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

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 , the product of the p-adic integers for each prime p.