Publisher
Springer Science and Business Media LLC
Reference4 articles.
1. Büchi, J.R.: On a decision method in restricted second order arithmetic. Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960, Stanford Univ. Press, 1962.
2. Elgot, C.C., Rabin, M.O.: Decidability and undecidability of second (first) order theories of (generalized) successor. J. Symb. Logic31 (1966), 169–181.
3. Robinson, R.M.: Restricted set-theoretical definitions in arithmetic. Proc. AMS9 (1958), 238–242.
4. Siefkes, D.: Undecidable extensions of monadic second order successor arithmetic. Zeitschr. f. Math. Logik u. Grundl. d. Math.17 (1971), 385–394.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Strong Version of Cobham’s Theorem;SIAM Journal on Computing;2024-01-17
2. A strong version of Cobham’s theorem;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
3. Extensions of ω-Regular Languages;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
4. Spectra and satisfiability for logics with successor and a unary function;Mathematical Logic Quarterly;2018-10-23
5. Defining Multiplication in Some Additive Expansions of Polynomial Rings;Communications in Algebra;2016-04-25