Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T02:39:15.621Z Has data issue: false hasContentIssue false

Prime numbers and factorization in IE1 and weaker systems

Published online by Cambridge University Press:  12 March 2014

Stuart T. Smith*
Affiliation:
School of Mathematical Sciences, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel, E-mail: mtshamsh@weizmann.bitnet

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable