1 research outputs found
Theorems of Tarski's Undefinability and Godel's Second Incompleteness-Computationally
We present a version of G\"odel's Second Incompleteness Theorem for
recursively enumerable consistent extensions of a fixed axiomatizable theory,
by incorporating some bi-theoretic version of the derivability conditions. We
also argue that Tarski's theorem on the Undefinability of Truth is G\"odel's
First Incompleteness Theorem relativized to definable oracles; a unification of
these two theorems is given.Comment: 12 page