skip to main content
LOTERRE

LOTERRE

Search from vocabulary

Lengua del contenido

| français English
Ayuda para la búsqueda

Concept information

mathematical logic > Gödel's incompleteness theorem

Término preferido

Gödel's incompleteness theorem  

Definición

  • Gödel's incompleteness theorems are two theorems of mathematical logic that are concerned with the limits of provability in formal axiomatic theories. These results, published by Kurt Gödel in 1931, are important both in mathematical logic and in the philosophy of mathematics. The theorems are widely, but not universally, interpreted as showing that Hilbert's program to find a complete and consistent set of axioms for all mathematics is impossible.
    (Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems)

Concepto genérico

En otras lenguas

URI

http://data.loterre.fr/ark:/67375/PSR-J3KL8M8V-R

Descargue este concepto:

RDF/XML TURTLE JSON-LD última modificación 12/10/23