Recursive functions and existentially closed structures

10/26/2017
by   Emil Jeřábek, et al.
0

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 T in which all partially recursive functions are representable, yet T does not interpret Robinson's theory R. 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 ∃∀ theories interpretable in existential theories in the process.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2022

A recursive function coding number theoretic functions

We show that there exists a fixed recursive function e such that for all...
research
03/21/2019

First steps to a constructor theory of cognition

This article applies the conceptual framework of constructor theory of i...
research
03/09/2022

On proving consistency of equational theories in Bounded Arithmetic

We consider pure equational theories that allow substitution but disallo...
research
11/15/2018

Axiomatic approach to the theory of algorithms and relativized computability

It is well known that many theorems in recursion theory can be "relativi...
research
12/27/2022

Foundations of self-progressive choice theories

Consider a population of agents whose choice behaviors are partially com...
research
12/24/2021

Decompositions of Stratified Institutions

The theory of stratified institutions is a general axiomatic approach to...
research
02/22/2021

Polymorphic Automorphisms and the Picard Group

We investigate the concept of definable, or inner, automorphism in the l...

Please sign up or login with your details

Forgot password? Click here to reset