Re: My talk about Godel to the post-grads.



MoeBlee <jazzmobe@xxxxxxxxxxx> writes:

On Jun 24, 9:21 am, Peter_Smith <ps...@xxxxxxxxx> wrote:

2) Give an example of a consistent theory which does prove its own
negation completeness.

ThN. I.e., the set of sentences in the language of PA that are true in
the standard model of PA.

Fail! This theory, which is not definable in the language of
arithmetic, does not prove its own completeness.

--
Aatu Koskensilta (aatu.koskensilta@xxxxxx)

"Wovon man nicht sprechen kann, daruber muss man schweigen"
- Ludwig Wittgenstein, Tractatus Logico-Philosophicus
.



Relevant Pages

  • Re: My talk about Godel to the post-grads.
    ... negation completeness. ... ThN. ... the set of sentences in the language of PA that are true in ... the standard model of PA. ...
    (sci.logic)
  • Re: My talk about Godel to the post-grads.
    ... negation completeness. ... the standard model of PA. ... Fail! ... which is not definable in the language of ...
    (sci.logic)
  • Re: Obstacles for Tcl/Tk commercial application development ?
    ... language, if variable X is declared as integer it will remain so forever ... Yeah, well, I figured if you fail at some point, you better be able to recover. ... A sane type system would prevent this. ... may fail because some caller is passing something that are not numbers. ...
    (comp.lang.tcl)
  • Re: Help with Conditional Code
    ... If you fail to quote, I will fail to respond further] ... the option to select another language. ... Your unwillingness to quote has dropped the implementation ... Books today and could not find one book on Jscript. ...
    (microsoft.public.scripting.jscript)
  • Re: Formulating sentences in a possibly consistent ZF
    ... ZF is an infinite set of sentences and as such can't be presented to ... sometimes asked how we can recognise the standard model of arithmetic, ... think some description in the language of thought of which the structure ... nonstandard models of first-order theories, ...
    (sci.logic)