publication . Preprint . 2015

Theorems of Tarski's Undefinability and Godel's Second Incompleteness-Computationally

Salehi, Saeed;
Open Access English
  • Published: 01 Sep 2015
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.
Subjects
arXiv: Mathematics::LogicComputer Science::Logic in Computer Science
free text keywords: Mathematics - Logic, Computer Science - Logic in Computer Science, 03F40, 03B25, 03D35, 03A05
Download from
arXiv.org e-Print Archive
Preprint . 2015
Provider: arXiv.org e-Print Archive
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue