The theory of 〈N , +, Vk, Vl〉 is undecidable
- 14 December 1992
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 106 (2) , 337-349
- https://doi.org/10.1016/0304-3975(92)90256-f
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERSMathematics of the USSR-Izvestiya, 1980
- A note on undecidable extensions of monadic second order successor arithmeticArchive for Mathematical Logic, 1975
- On the base-dependence of sets of numbers recognizable by finite automataTheory of Computing Systems, 1969
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successorThe Journal of Symbolic Logic, 1966
- J. Richard Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 6 (1960), pp. 66–92. - J. Richard Büchi. On a decision method in restricted second order arithmetic. Logic, methodology and philosophy of science, Proceedings of the 1960 International Congress, edited by Ernest Nagel, Patrick Suppes, and Alfred Tarski, Stanford University Press, Stanford, Calif., 1962, pp. 1–11.The Journal of Symbolic Logic, 1963
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960