Abstract
AbstractLet be the restriction of usual order relation to integers which are primes or squares of primes, and let ⊥ denote the coprimeness predicate. The elementary theory of is undecidable. Now denote by <π the restriction of order to primary numbers. All arithmetical relations restricted to primary numbers are definable in the structure (ℕ; ⊥, <π). Furthermore, the structures (ℕ; ∣, <π) (ℕ; =, ×, <π) and (ℕ; =, +, ×) are interdefinable.
Publisher
Cambridge University Press (CUP)
Reference8 articles.
1. All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate
2. Woods, A. R. , Some problems in logic and number theory and their connections, Ph.D. thesis , University of Manchester, 1981.
3. über gewisse Satzfunktionen in der Arithmetik;Skolem;Skr. Norske Videnskaps-Akademie i Oslo,1930
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献