Theorems of Tarski's Undefinability and Godel's Second Incompleteness-Computationally
Logic
2019-11-12 v3 Logic in Computer Science
Abstract
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.
Keywords
Cite
@article{arxiv.1509.00164,
title = {Theorems of Tarski's Undefinability and Godel's Second Incompleteness-Computationally},
author = {Saeed Salehi},
journal= {arXiv preprint arXiv:1509.00164},
year = {2019}
}
Comments
12 pages