Recursive models and the divisibility poset
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3933028 (Why is no real title available?)
- scientific article; zbMATH DE number 3745136 (Why is no real title available?)
- scientific article; zbMATH DE number 3750921 (Why is no real title available?)
- scientific article; zbMATH DE number 3781145 (Why is no real title available?)
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- scientific article; zbMATH DE number 3001281 (Why is no real title available?)
- Every recursive enumerable extension of a theory of linear order has a constructive model
- Nonarithmetical ℵ0-categorical theories with recursive models
- Ordering by Divisibility in Abstract Algebras
- Skolem functions and constructive models
- Some problem in elementary arithmetics
- The completeness of Peano multiplication
- The elementary theory of the natural lattice is finitely axiomatizable
- Theories with recursive models
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
Cited in
(3)
This page was built for publication: Recursive models and the divisibility poset
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5937812)