# Kurt Gödel **Domain:** Mathematical Logic / Foundations of Mathematics **Doc Type:** Person **Maturity:** Developed **Related:** [[Gödel's Incompleteness Theorems]], [[Gödel Numbering]], [[Hilbert Program]], [[Formal Systems]], [[wiki/Bauhaus Architects of AI|Bauhaus Architects of AI]] ## Definition **Kurt Gödel** (1906–1978) was a logician born in Brünn, now Brno, whose work transformed mathematical logic, proof theory and the foundations of mathematics. He studied at the University of Vienna from 1924, completed his doctorate in 1930 and published the incompleteness results in 1931. ## Principal Contributions - the completeness theorem for first-order logic; - the First and Second [[Gödel's Incompleteness Theorems|Incompleteness Theorems]]; - the arithmetization of syntax through [[Gödel Numbering]]; - major results in set theory concerning the axiom of choice and continuum hypothesis; and - philosophical work on mathematics, mechanism and the relation between formal proof and mathematical truth. ## Corpus Context Gödel is a foundational figure for [[Self-Reference]], [[Formal Systems]], [[Undecidability]] and the limits of system-internal certification. His connection to [[wiki/Bauhaus Architects of AI|Bauhaus Architects of AI]] is biographical and structural rather than a claim that his mathematics originated in Prague or directly influenced Czech art, architecture or computing. ## Evidence Boundary Gödel's theorems apply to specified classes of formal systems. They do not establish that every system is incomplete, that consciousness is noncomputable, or that any self-referential machine is conscious. Those extensions belong under [[Gödelian Analogy]] and must be argued separately. ## Sources / Provenance - [[articles/Bauhaus Architects of AI|Bauhaus Architects of AI]] - [University of Vienna — Kurt Gödel](https://geschichte.univie.ac.at/de/personen/kurt-goedel) - [Stanford Encyclopedia of Philosophy — Kurt Gödel](https://plato.stanford.edu/entries/goedel/)