This HTML5 document contains 1 embedded RDF statements represented using HTML+Microdata notation.
The embedded RDF content will be recognized by any processor of HTML5 Microdata.
| Prefix | Namespace IRI |
|---|
| n2 | http://dbpedia.org/resource/Gödel' |
| rdfs | http://www.w3.org/2000/01/rdf-schema# |
| rdf | http://www.w3.org/1999/02/22-rdf-syntax-ns# |
| xsdh | http://www.w3.org/2001/XMLSchema# |
- Subject Item
- n2:s_completeness_theorem
- rdfs:comment
-
Gödel's completeness theorem is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first-order logic. It makes a close link between model theory that deals with what is true in different models, and proof theory that studies what can be formally proven in particular formal systems.It was first proved by Kurt Gödel in 1929. It was then simplified in 1947, when Leon Henkin observed in his Ph.D.