Abstract
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory [Formula: see text] in which all partially recursive functions are representable, yet [Formula: see text] does not interpret Robinson’s theory [Formula: see text]. To this end, we borrow tools from model theory — specifically, we investigate model-theoretic properties of the model completion of the empty theory in a language with function symbols. We obtain a certain characterization of [Formula: see text] theories interpretable in existential theories in the process.
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.
