Prime numbers and factorization in IE1 and weaker systems

DOI10.2307/2275449zbMath0768.03022OpenAlexW2152324692MaRDI QIDQ4032881

Stuart T. Smith

Publication date: 1 April 1993

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275449

zbMATH Keywords

models of arithmeticprime numbersweak systems of arithmeticbounded existential inductionfactorization into prime powersfrugal homomorphismpowers of irreducibles

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62)

Related Items (1)

The Skolem-Bang theorems in ordered fields with an IP

Cites Work

• Primes and their residue rings in models of open induction
• Fermat's last theorem and Bezout's theorem in GCD domains
• Unnamed Item
• Unnamed Item

This page was built for publication: Prime numbers and factorization in IE₁ and weaker systems