Hilbert's tenth problem for weak theories of arithmetic (Q685070): Difference between revisions

Hilbert's tenth problem for a theory \(T\) asks if there is an algorithm which decides for a given polynomial \(p(x)\) from \(\mathbb{Z}[x]\) whether \(p(x)\) has a root in some model of \(T\). The author examines some of the model-theoretic consequences that an affirmative answer would have in cases such as \(T=\) Open Induction and others, and applies these methods by providing a negative answer in the cases when \(T\) is some particular finite fragment of the weak theories \(IE_ 1\) (bounded existential induction) or \(IU^ -_ 1\) (parameter-free bounded universal induction).