Abstract
We introduce a model-complete theory which completely axiomatizes the structure Zα=〈Z,+,0,1,f〉 where f:x↦⌊αx⌋ is a unary function with α a fixed transcendental number. Moreover, we show that decidability of Zα is equivalent to computability of α. This result fits into the more general theme of adding traces of multiplication to integers without losing decidability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
