Skip to main content

All Questions

Filter by
Sorted by
Tagged with
18 votes
3 answers
1k views

Computable nonstandard models for weak systems of arithmetic

By Tennenbaum's theorem, PA itself does not have any computable nonstandard models. The integer polynomials which are 0 or have a positive leading coefficient form a computable nonstandard model of ...
user avatar