Search results

Jump to navigation Jump to search
  • {{r|Kurt Gödel}}
    907 bytes (146 words) - 15:31, 11 May 2011
  • First (in 1938) [[Kurt Gödel]] showed that it cannot be disproved,
    1 KB (214 words) - 13:35, 6 July 2009
  • The first step towards a solution was done in 1938 by Kurt Gödel == Kurt Gödel 1947 ==
    8 KB (1,289 words) - 20:20, 15 July 2009
  • ...lidity of the axiom is not universally accepted among mathematicians and [[Kurt Gödel]] showed that it was independent of the other axioms of set theory.
    2 KB (266 words) - 13:28, 5 January 2013
  • ...e time, a revolution in mathematical thought was already underway due to [[Kurt Gödel|Gödel]]'s [[Incompleteness Theorem]] of 1931, which demonstrated that cert
    6 KB (988 words) - 00:43, 6 February 2010
  • ...ed it to solve the [[halting problem]], the computer science analogue of [[Kurt Gödel]]'s [[Incompleteness Theorem]]. This, together with work by [[Alonzo Church
    5 KB (782 words) - 05:57, 8 April 2024
  • *The logician and mathematician '''[[Kurt Gödel]]''', who proved the completeness of [[first-order logic]] and the [[Gödel ...Bonn]] and [[Vienna]]; among his students there were [[Karl Popper]] and [[Kurt Gödel]].
    30 KB (4,343 words) - 13:59, 18 February 2024
  • ...ss]]. (1939). The [[Königsberg]] congress (1930) was very important, for [[Kurt Gödel]] announced that he has proved the [[completeness]] of [[first-order logic]
    10 KB (1,279 words) - 10:47, 9 September 2023
  • ...John von Neumann|von '''N'''eumann]], [[Paul Bernays|'''B'''ernays]] and [[Kurt Gödel|'''G'''ödel]] between about 1920 and 1940. Its objects explicitly include
    22 KB (3,815 words) - 15:46, 23 September 2013
  • ...John von Neumann|von '''N'''eumann]], [[Paul Bernays|'''B'''ernays]] and [[Kurt Gödel|'''G'''ödel]] between about 1920 and 1940. Its objects explicitly include
    24 KB (4,193 words) - 15:48, 23 September 2013
  • Not all systems achieve all three virtues. It has been proven by [[Kurt Gödel]] that a system with enough axioms and/or rules of derivation to derive the ...ne: [[Alan Turing]]'s work on the [[Entscheidungsproblem]] followed from [[Kurt Gödel]]'s work on the [[incompleteness theorems]], and the notion of general purp
    32 KB (4,979 words) - 21:47, 12 November 2011
  • * [[User:J. Noel Chiappa|Noel]] wasn't [[Kurt Gödel|logical]] about it at all - this was purely an accident, filling in a red l ...me song/Definition|Olympic theme song]] as well as [[Kurt Gödel/Definition|Kurt Gödel]]. -- [[User:Daniel Mietchen|Daniel Mietchen]] 11:35, 4 June 2008 (CDT)
    21 KB (3,350 words) - 16:53, 12 March 2024
  • ...name=GODEL>[http://www.exploratorium.edu/complexity/CompLexicon/godel.html Kurt Gödel]</ref>.
    32 KB (4,727 words) - 23:15, 7 March 2024
  • ...throughout the 20th Century, by logicians of the stature of David Hilbert, Kurt Gödel, and many others. The foundations for the theory of machine computation was
    10 KB (1,529 words) - 16:45, 10 February 2024
  • ...orem.<ref>The first [[Incompleteness Theorem|incompleteness theorem]] of [[Kurt Gödel|Gödel]], somewhat stronger than this conclusion, states that a consistent
    34 KB (5,174 words) - 21:32, 25 October 2013
  • ...tav Bergmann]], [[Rudolf Carnap]], [[Herbert Feigl]], [[Philipp Frank]], [[Kurt Gödel]], [[Hans Hahn]], [[Felix Kaufmann]], [[Victor Kraft]], [[Karl Menger]], [[
    15 KB (2,134 words) - 13:48, 18 February 2024
  • ...]], and [[Herbert Feigl]], with occasional appearances by Hahn's student [[Kurt Gödel]]. When [[Ludwig Wittgenstein|Wittgenstein]] visited Vienna, Carnap would m
    15 KB (2,251 words) - 14:06, 2 February 2023
  • ...diacritics, thus [[Hermann Goering]] rather than [[Hermann Göring]], but [[Kurt Gödel]] not [[Kurt Goedel]], because the best-known work about the mathematician
    141 KB (23,142 words) - 07:53, 2 March 2024
View ( | ) (20 | 50 | 100 | 250 | 500)