Abstract
It is known that the arithmetic of natural and integer numbers is unsolvable. Even the universal theory of integers with addition and multiplication is unsolvable. It is proved herein that an elementary theory of integers with addition, order, and multiplication by one arbitrary number is solvable and multiplication by the power of one number is unsolvable. For a certain n, the universal theory of integers with addition and n multiplications by an arbitrary number is also unsolvable.
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 callMore From: Mathematical Notes of the Academy of Sciences of the USSR
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.
