: Mathématiques: Gödel's incompleteness theorem

mathematical logic > Gödel's incompleteness theorem

Gödel's incompleteness theorem

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)

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

RDF/XML TURTLE JSON-LD

Loterre