In mathematical logic, the diagonal lemma or fixed point theorem establishes the existence of self-referential sentences in formal theories of the natural numbers, if those theories are strong enough to represent all computable functions. Such sentences can be used to prove fundamental results such as Gödel's incompleteness theorems and Tarski's indefinability theorem.
| Property | Value |
|---|
| dbpprop:abstract
|
- In mathematical logic, the diagonal lemma or fixed point theorem establishes the existence of self-referential sentences in formal theories of the natural numbers, if those theories are strong enough to represent all computable functions. Such sentences can be used to prove fundamental results such as Gödel's incompleteness theorems and Tarski's indefinability theorem.
|
| dbpprop:hasPhotoCollection
| |
| rdf:type
| |
| rdfs:comment
|
- In mathematical logic, the diagonal lemma or fixed point theorem establishes the existence of self-referential sentences in formal theories of the natural numbers, if those theories are strong enough to represent all computable functions. Such sentences can be used to prove fundamental results such as Gödel's incompleteness theorems and Tarski's indefinability theorem.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
| is dbpprop:redirect
of | |
| is owl:sameAs
of | |
![[RDF Data]](/statics/sw-cube.png)
