Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Oberhoff, Sebastian"'
Autor:
Oberhoff, Sebastian
The overarching theme of the following pages is that mathematical logic -- centered around the incompleteness theorems -- is first and foremost an investigation of $\textit{computation}$, not arithmetic. Guided by this intuition we will show the foll
Externí odkaz:
http://arxiv.org/abs/2406.08494
Autor:
Oberhoff, Sebastian
Publikováno v:
Bulletin of the European Association for Theoretical Computer Science, No 128, June 2019
In this essay we'll prove G\"odel's incompleteness theorems twice. First, we'll prove them the good old-fashioned way. Then we'll repeat the feat in the setting of computation. In the process we'll discover that G\"odel's work, rightly viewed, needs
Externí odkaz:
http://arxiv.org/abs/1909.04569