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

Preprint English OPEN
Salehi, Saeed;
  • Subject: Mathematics - Logic | 03F40, 03B25, 03D35, 03A05 | Computer Science - Logic in Computer Science
    arxiv: Computer Science::Logic in Computer Science | Mathematics::Logic

We present a version of Godel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions (first discussed by M. Detlefsen 2001). We also argu... View more
Share - Bookmark