Abstract

The set of arithmetic truths is neither recursive, nor recursively enumerable. Mathematician Alexander Kharazishvili explores how powerful the celebrated diagonal method is for general and descriptive set theory, recursion theory, and Gödel’s incompleteness theorem.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call