Author:
Bateman P. T.,Jockusch C. G.,Woods A. R.
Abstract
AbstractIt is shown, assuming the linear case of Schinzel's Hypothesis, that the first-order theory of the structure 〈ω; +, P〉, where P is the set of primes, is undecidable and, in fact, that multiplication of natural numbers is first-order definable in this structure. In the other direction, it is shown, from the same hypothesis, that the monadic second-order theory of 〈ω S, P〉 is decidable, where S is the successor function. The latter result is proved using a general result of A. L. Semënov on decidability of monadic theories, and a proof of Semënov's result is presented.
Publisher
Cambridge University Press (CUP)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Deciding ω-regular properties on linear recurrence sequences;Proceedings of the ACM on Programming Languages;2021-01-04
3. THE ADDITIVE GROUPS OF AND WITH PREDICATES FOR BEING SQUARE-FREE;The Journal of Symbolic Logic;2020-10-05
4. Extensions of ω-Regular Languages;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
5. DECIDABILITY AND CLASSIFICATION OF THE THEORY OF INTEGERS WITH PRIMES;The Journal of Symbolic Logic;2017-09