Search results

MyWikiBiz, Author Your Legacy — Sunday April 28, 2024
Jump to navigationJump to search
Results 1 – 9 of 9
Advanced search

Search in namespaces:

  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  • |[[Kurt Gödel]]
    8 KB (1,221 words) - 15:38, 16 February 2007
  • ||00:45, 29 October 2005 (hist) (diff) Kurt Gödel ||
    27 KB (3,495 words) - 08:46, 28 November 2010
  • * [[Jean van Heijenoort|van Heijenoort, Jean]] (ed. 1967), ''From Frege To Gödel: A Source Book in Mathematical Logic, 1879–1931'', Harvard University Pr * [[Kurt Gödel|Gödel, Kurt]] (1931), "[[On Formally Undecidable Propositions of Principia Mathematica
    61 KB (7,563 words) - 18:26, 15 June 2010
  • * [[Jean van Heijenoort|van Heijenoort, Jean]] (ed. 1967), ''From Frege To Gödel: A Source Book in Mathematical Logic, 1879–1931'', Harvard University Pr * [[Kurt Gödel|Gödel, Kurt]] (1931), "[[On Formally Undecidable Propositions of Principia Mathematica
    61 KB (7,562 words) - 18:18, 18 March 2008
  • ...thesis, might prove not be decidable just on the basis of such principles. Gödel suggested quasi-empirical methodology could be used to provide sufficient e ...gain access to this separate world and discover truths about the entities? Gödel's and Plato's answers to each of these questions are much criticised. An im
    177 KB (26,694 words) - 02:20, 15 December 2010
  • ...ypothesis]], might prove undecidable just on the basis of such principles. Gödel suggested that quasi-empirical methodology could be used to provide suffici Gödel's platonism postulates a special kind of mathematical intuition that lets u
    105 KB (15,873 words) - 11:53, 20 August 2007
  • ...ypothesis]], might prove undecidable just on the basis of such principles. Gödel suggested that quasi-empirical methodology could be used to provide suffici Gödel's platonism postulates a special kind of mathematical intuition that lets u
    105 KB (15,875 words) - 22:02, 25 January 2008
  • ...[Hilbert's program]] at the turn of the [[20th century]] to the proof of [[Gödel's theorem]] and the development of the [[Church-Turing thesis]] in the earl ...''The Honors Class. Hilbert's Problems and Their Solvers'' (2002).</ref> Gödel and [[Paul Cohen]] showed that this hypothesis cannot be proved or disprove
    237 KB (37,371 words) - 11:22, 20 August 2007
  • ...[Hilbert's program]] at the turn of the [[20th century]] to the proof of [[Gödel's theorem]] and the development of the [[Church-Turing thesis]] in the earl ...''The Honors Class. Hilbert's Problems and Their Solvers'' (2002).</ref> Gödel and [[Paul Cohen]] showed that this hypothesis cannot be proved or disprove
    237 KB (37,371 words) - 22:14, 25 January 2008