The definable criterion for definability in Presburger arithmetic and its applications. (Q1401169): Difference between revisions

@@ Property / author @@
-Andrej A. Muchnik
@@ Property / author: Andrej A. Muchnik / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q56059273
@@ Property / Wikidata QID: Q56059273 / rank @@
+Normal rank
@@ Property / author @@
+Andrej A. Muchnik
@@ Property / author: Andrej A. Muchnik / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
+Normal rank
@@ Property / cites work @@
+Logic and \(p\)-recognizable sets of integers
@@ Property / cites work: Logic and \(p\)-recognizable sets of integers / rank @@
+Normal rank
@@ Property / cites work @@
+Weak Second‐Order Arithmetic and Finite Automata
+Normal rank
@@ Property / cites work @@
+On the base-dependence of sets of numbers recognizable by finite automata
+Normal rank
@@ Property / cites work @@
+Cobham's Theorem seen through Büchi's Theorem
@@ Property / cites work: Cobham's Theorem seen through Büchi's Theorem / rank @@
+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 @@
+Q4147966
@@ Property / cites work: Q4147966 / rank @@
+Normal rank
@@ Property / cites work @@
+Some results in the effective descriptive set theory
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1401169