Abstract
The paper is concerned with definability of functions and relations in the FE language of functional equations of a countable-valued logic. The class of relations definable by functional equations over the set of functions {0, x + 1} is shown to coincide with the class ∑ 1 1 of the analytical Kleene hierarchy. Two extensions of the FE language are proposed that are equivalent in their expressibility to the FE language with functional constants for all homogeneous functions. This research was carried out with the financial support of the Russian Foundation for Basic Research (grant no. 13-01-00958).
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.
