skip to main content
LOTERRE

LOTERRE

Choisissez le vocabulaire dans lequel chercher

Langue des données

| español English
Aide à la recherche

Concept information

mathematical logic > Gödel's incompleteness theorem

Terme préférentiel

Gödel's incompleteness theorem  

Définition(s)

  • 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)

Concept(s) générique(s)

Traductions

URI

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

Télécharger ce concept:

RDF/XML TURTLE JSON-LD Dernière modif. 12/10/2023