Recursive models and the divisibility poset

DOI10.1305/ndjfl/1039293026zbMath0968.03078OpenAlexW2085074242MaRDI QIDQ5937812

James H. Schmerl

Publication date: 17 July 2001

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1039293026

zbMATH Keywords

nonstandard modelsPeano arithmeticrecursive divisibility latticerecursive divisibility poset

Mathematics Subject Classification ID

Nonstandard models of arithmetic (03H15) Computable structure theory, computable model theory (03C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The elementary theory of the natural lattice is finitely axiomatizable
• The completeness of Peano multiplication
• Skolem functions and constructive models
• Every recursive enumerable extension of a theory of linear order has a constructive model
• Theories with recursive models
• Some problem in elementary arithmetics
• Nonarithmetical ℵ₀-categorical theories with recursive models
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Recursive models and the divisibility poset