Article contents
An extension of the Cobham-Semënov Theorem
Published online by Cambridge University Press: 12 March 2014
Abstract
Let θ, θ′ be two multiplicatively independent Pisot numbers, and let U, U′ be two linear numeration systems whose characteristic polynomial is the minimal polynomial of θ and θ′, respectively. For every n ≥ 1, if A ⊆ ℕn is U-and U′ -recognizable then A is definable in 〈ℕ: + 〉.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2000
References
REFERENCES
- 8
- Cited by