Re: Jan Burse gives support that godels use of impredicative s



(*) The collected works of Gödel

it is what he states in his 1931 paper and his On undecidable
propositions of formal mathematical systems

we are concerned with here not what he may have said in other places
and in these works he states he constructs impredicative statements -which
you admitt are problematical -and others say are invalid

as well as useing the axiom of reducibility


--
Message posted using http://www.talkaboutscience.com/group/sci.logic/
More information at http://www.talkaboutscience.com/faq.html

.



Relevant Pages

  • Re: Jan Burse gives support that godels use of impredicative s
    ... propositions of formal mathematical systems ... as well as useing the axiom of reducibility ...
    (sci.logic)
  • Re: Godel did not destroy the Hilbert Frege Russell programme
    ... formally undecidable propositions of Principia Mathematica and related ... order arithmetical truths is not recursively enumerable. ... the axiom of infinity to PM, in the form "there exist denumerably many ... recursive subset of the set of well-formed formulas  of the language ...
    (sci.logic)
  • Re: Godel did not destroy the Hilbert Frege Russell programme
    ... formally undecidable propositions of Principia Mathematica and related ... the axiom of infinity to PM, in the form "there exist denumerably many ... recursive subset of the set of well-formed formulas  of the language ... truth values, such that, for all valuations v of S, the truth- ...
    (sci.logic)
  • Re: Rovelli on EPR
    ... constitutes a reasonable axiom. ... and Boole refers only to propositions about classical objects. ... For quantum objects we need to take into account the statistical nature ... Pure mathematics is built upon logic. ...
    (sci.physics.research)
  • Re: Godel did not destroy the Hilbert Frege Russell programme
    ... formally undecidable propositions of Principia Mathematica and related ... the axiom of infinity to PM, in the form "there exist denumerably many ... recursive subset of the set of well-formed formulas  of the language ... truth values, such that, for all valuations v of S, the truth- ...
    (sci.logic)