Searching for "On the Cobham-Semenov Theorem." – sorted by Relevance.
-
An Extension of the Cobham-Semënov Theorem
- An Extension of the Cobham-Semenov Theorem Alexis Bes Published in J.Symb.Logic 65(1), 201
- Cited by 4 (1 self) – Add To MetaCart
-
Undecidable Extensions of Büchi Arithmetic and Cobham-Semënov Theorem
- Undecidable Extensions of Buchi Arithmetic and Cobham-Semenov Theorem Alexis Bes Published in J
- Cited by 6 (1 self) – Add To MetaCart
-
Definability and Regularity in Automatic Presentations of Subsystems of Arithmetic
- the standard algorithm for base m addition. The Cobham-Semenov theorem (see [2]) states that for R _ c , if (Ak
- Add To MetaCart
-
Automata and Logic
- . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 8.5 The Cobham-Semenov Theorem . . . . . . . . . . . . . . . . . . . . . . . . . 88 3 Chapter 1
- Add To MetaCart
-
Bibliography
- of the Cobham-Semenov theorem, J. Symbolic Logic. To appear. Blanchard, F. (1989). -expansions and symbolic
- Add To MetaCart

