Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem (Q4382476): Difference between revisions

@@ Property / cites work @@
+On the base-dependence of sets of numbers recognizable by finite automata
+Normal rank
@@ Property / cites work @@
+Weak Second‐Order Arithmetic and Finite Automata
+Normal rank
@@ Property / cites work @@
+The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
+Normal rank
@@ Property / cites work @@
+STACS 92. Theoretical aspects of computer science. Proceedings of the 9th annual symposium, Cachan, France, February 13--15, 1992
+Normal rank
@@ Property / cites work @@
+Presburgerness of predicates regular in two number systems
+Normal rank
@@ Property / cites work @@
+Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
+Normal rank
@@ Property / cites work @@
+A note on undecidable extensions of monadic second order successor arithmetic
+Normal rank