Find link

language:

Find link is a tool written by Edward Betts.

searching for On Formally Undecidable Propositions of Principia Mathematica and Related Systems 6 found (25 total)

alternate case: on Formally Undecidable Propositions of Principia Mathematica and Related Systems

Computable set (586 words) [view diff] case mismatch in snippet view article find links to article

described in Kurt Gödel's paper "On formally undecidable propositions of Principia Mathematica and related systems I" is computable; see Gödel's incompleteness

History of the Church–Turing thesis (8,298 words) [view diff] exact match in snippet view article find links to article

Gödel published his famous paper On Formally Undecidable Propositions of Principia Mathematica and Related Systems I. In his preface to this paper Martin

Proof sketch for Gödel's first incompleteness theorem (2,996 words) [view diff] case mismatch in snippet view article find links to article

Hirzel, Martin (trans.), 2000, "On formally undecidable propositions of Principia Mathematica and related systems I.". 1951, "Some basic theorems on

Brouwer–Hilbert controversy (4,440 words) [view diff] case mismatch in snippet view article find links to article

on completeness and consistency. On formally undecidable propositions of Principia mathematica and related systems I, and on compleness and consistency

Halting problem (7,344 words) [view diff] exact match in snippet view article find links to article

view" 1931 (1931): Gödel publishes "On Formally Undecidable Propositions of Principia Mathematica and Related Systems I" 19 April 1935 (1935-04-19): Alonzo

Quantum mind (8,318 words) [view diff] exact match in snippet view article find links to article

ISBN 0-14-01-4534-6. Gödel, Kurt (1992). On Formally Undecidable Propositions of Principia Mathematica and Related Systems (Reprint ed.). New York: Dover Publications