Open Access
Winter 1998 Recursive Models and the Divisibility Poset
James H. Schmerl
Notre Dame J. Formal Logic 39(1): 140-148 (Winter 1998). DOI: 10.1305/ndjfl/1039293026

Abstract

In contrast to Tennenbaum's theorem asserting that there are no nonstandard models of Peano Arithmetic in which either addition or multiplication is recursive, the result here is that there is a nonstandard model of Peano Arithmetic having a recursive divisibility poset and a recursive divisibility lattice.

Citation

Download Citation

James H. Schmerl. "Recursive Models and the Divisibility Poset." Notre Dame J. Formal Logic 39 (1) 140 - 148, Winter 1998. https://doi.org/10.1305/ndjfl/1039293026

Information

Published: Winter 1998
First available in Project Euclid: 7 December 2002

zbMATH: 0968.03078
MathSciNet: MR1671738
Digital Object Identifier: 10.1305/ndjfl/1039293026

Subjects:
Primary: 03H15
Secondary: 03C57 , 03C62 , 03D45

Rights: Copyright © 1998 University of Notre Dame

Vol.39 • No. 1 • Winter 1998
Back to Top