On 31 Dec 2010, at 13:31, Brian Tenneson wrote:
So if a TOE is not recursively enumerable, it still might be captured
in some finite set of statements like how arithmetic can be captured
in the Peano axioms. That arithmetical truth is not recursively
enumerable can somehow be derived from thes
On Dec 31, 1:42 am, Bruno Marchal wrote:
> On 29 Dec 2010, at 13:50, Brian Tenneson wrote:
>
> >>> If a complete description of arithmetical truth is not possible,
> >>> what
> >>> exactly are we talking about?
>
> >> We, humans, have a rather good intuition of what is a true
> >> arithmetical
On 29 Dec 2010, at 13:50, Brian Tenneson wrote:
If a complete description of arithmetical truth is not possible,
what
exactly are we talking about?
We, humans, have a rather good intuition of what is a true
arithmetical sentence, independently of the fact that we have to
recognize that it c
3 matches
Mail list logo