Abstract
In this paper the author studies the decision problem for logical languages intended to describe the properties of one-place functions on the set of natural numbers. For functions taking a finite number of values a criterion for decidability of the monadic theory of the structure is obtained. For a large class of monotone functions , conditions are found under which the elementary theory of the structure is decidable; corresponding conditions are also found for structures of the form .Bibliography: 20 titles.
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 callDisclaimer: 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.
