Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?

From: Torkel Franzen (torkel_at_sm.luth.se)
Date: 01/12/05 

Date: 12 Jan 2005 12:39:17 +0100

"LordBeotian" <pokipsy76@CANCELLAMIyahoo.it> writes:

> There is not a recursive procedure to assign names to costructive Ordinals.
> We could obtain a NON-r.e. set of "possible recognizable truths" by
> collecting the sentances "A is an ordinal" for any costructive
> ordinal...

  What I was wondering was on what grounds Daryl took the notion of
"possible truth recognizable to mathematicians" to be well-defined.
What does it mean to "recognize" a mathematical truth, say of the
form "for every natural number n, P(n)", where P is a mechanically
decidable property.

Relevant Pages

  • Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?
    ... > What I was wondering was on what grounds Daryl took the notion of ... really are only a handful of tricks that mathematicians use to ... seem to be pretty much captured by ZFC, together with reflection-type ... principles ("I believe ZFC, so Con(ZFC) is not much of a stretch". ...
    (comp.theory)
  • Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?
    ... > What I was wondering was on what grounds Daryl took the notion of ... really are only a handful of tricks that mathematicians use to ... seem to be pretty much captured by ZFC, together with reflection-type ... principles ("I believe ZFC, so Con(ZFC) is not much of a stretch". ...
    (sci.math)
  • Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?
    ... > What I was wondering was on what grounds Daryl took the notion of ... really are only a handful of tricks that mathematicians use to ... seem to be pretty much captured by ZFC, together with reflection-type ... principles ("I believe ZFC, so Con(ZFC) is not much of a stretch". ...
    (sci.logic)
  • Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?
    ... "LordBeotian" writes: ... What I was wondering was on what grounds Daryl took the notion of ... "possible truth recognizable to mathematicians" to be well-defined. ... decidable property. ...
    (sci.logic)
  • Re: THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?
    ... "LordBeotian" writes: ... What I was wondering was on what grounds Daryl took the notion of ... "possible truth recognizable to mathematicians" to be well-defined. ... decidable property. ...
    (comp.theory)