Prev: How Can ZFC/PA do much of Math - it Can't Even Prove PA is Consistent (EASY PROOF)
Next: Beyond Incompleteness
From: Charlie-Boo on 14 Jun 2010 11:51
Is there a way to prove that some relation is r.e. without giving
enough information to make the construction of a program to enumerate
it obvious (extractable from the proof)?

C-B
From: Aatu Koskensilta on 14 Jun 2010 11:55
Charlie-Boo <shymathguy(a)gmail.com> writes:

> Is there a way to prove that some relation is r.e. without giving
> enough information to make the construction of a program to enumerate
> it obvious (extractable from the proof)?

Yes.

--
Aatu Koskensilta (aatu.koskensilta(a)uta.fi)

"Wovon man nicht sprechan kann, dar�ber muss man schweigen"
- Ludwig Wittgenstein, Tractatus Logico-Philosophicus
From: Charlie-Boo on 24 Jun 2010 13:42
On Jun 14, 11:55 am, Aatu Koskensilta <aatu.koskensi...(a)uta.fi> wrote:
> Charlie-Boo <shymath...(a)gmail.com> writes:
> > Is there a way to prove that some relation is r.e. without giving
> > enough information to make the construction of a program to enumerate
> > it obvious (extractable from the proof)?
>
> Yes.

Assuming that any sets postulated as being r.e. include a program to
enumerate it, any example?

> --
> Aatu Koskensilta (aatu.koskensi...(a)uta.fi)
>
> "Wovon man nicht sprechan kann, darüber muss man schweigen"
>  - Ludwig Wittgenstein, Tractatus Logico-Philosophicus

 | 
Pages: 1
Prev: How Can ZFC/PA do much of Math - it Can't Even Prove PA is Consistent (EASY PROOF)
Next: Beyond Incompleteness