DeepAI

AI Chat AI Image Generator AI Video AI Music Generator

Incompleteness Ex Machina

09/06/2019

∙

by Sebastian Oberhoff, et al.

∙

∙

In this essay we'll prove Gödel'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ödel's work, rightly viewed, needs to be split into two parts: the transport of computation into the arena of arithmetic on the one hand and the actual incompleteness theorems on the other. After we're done there will be cake.

research

∙ 03/02/2022

A Modern Gauss-Markov Theorem? Really?

We show that the theorems in Hansen (2021a) (the version accepted by Eco...

0 Benedikt M. Pötscher, et al. ∙

research

∙ 04/20/2020

Eigenvalues of graphs and spectral Moore theorems

In this paper, we describe some recent spectral Moore theorems related t...

0 Sebastian M. Cioabă, et al. ∙

research

∙ 01/29/2019

Representation theorems for extended contact algebras based on equivalence relations

The aim of this paper is to give new representation theorems for extende...

0 Philippe Balbiani, et al. ∙

research

∙ 02/16/2021

Decidability for Sturmian words

We show that the first-order theory of Sturmian words over Presburger ar...

0 Philipp Hieronymi, et al. ∙

research

∙ 03/20/2021

Discrete Helly-type theorems for pseudohalfplanes

We prove discrete Helly-type theorems for pseudohalfplanes, which extend...

0 Balázs Keszegh, et al. ∙

research

∙ 03/31/2023

Teaching Gödel's incompleteness theorems

The basic notions of logic-predicate logic, Peano arithmetic, incomplete...

0 Gilles Dowek, et al. ∙

research

∙ 08/09/2022

Incompleteness for stably computable formal systems

We prove, for stably computably enumerable formal systems, direct analog...

0 Yasha Savelyev, et al. ∙