Gödel’s Incompleteness Phenomenon—Computationally
We argue that Gödel's completeness theorem is equivalent to completability of consistent theories, and Gödel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some consistent and recursively enumerable theories which ca...
| Autor principal: | |
|---|---|
| Formato: | Artículo |
| Lenguaje: | deu |
| Publicado: |
Éditions Kimé
2014-10-01
|
| Colección: | Philosophia Scientiæ |
| Acceso en línea: | https://journals.openedition.org/philosophiascientiae/968 |