[FOM] Absolute undecidability

[Noah David Schweber]

Note that your $g_n$ is not always defined: if $T_n$ is consistent but
proves its own inconsistency (e.g. if $A_n=~Con(PA)$) then $T_n$
(vacuously) proves "If $T_n$ is consistent, then $B$ is undecidable in
$T_n$" for **every** sentence $B$.

On Wed, Aug 3, 2016 at 6:06 AM, Arne Hole <arne.hole at ils.uio.no> wrote:

> I have once again updated my presentation concerning absolute
> undecidability, and comments on the new version are very welcome. You will
> find it on
>
> http://folk.uio.no/arnehole
>
> The presentation is a pdf of a PowerPoint, and it only takes a couple of
> minutes to scan through. It is readable even on a smartphone screen.
>
> Best wishes, Arne H.
>
>
>
> >-----Original Message-----
> >From: Arne Hole
> >Sent: Monday, June 06, 2016 3:29 PM
> >To: 'fom at cs.nyu.edu'
> >Subject: RE: Absolute undecidability
> >
> >Last autumn, I posted the message cited below to FOM concerning my
> >project on absolute undecidability. Since then, I have become aware of
> some
> >(known) results on incompressibility making it possible to carry this much
> >further. On my draft sharing page
> >
> >http://folk.uio.no/arnehole/
> >
> >you will find the current version of my paper. You will also find a PP
> >presentation aimed at getting the main point across in the simplest way
> >possible. You get directly to the PP at
> >
> >http://folk.uio.no/arnehole/AbsUndec.pdf
> >
> >As before, comments are very welcome.
> >Best wishes, Arne H.
>
> _______________________________________________
> FOM mailing list
> FOM at cs.nyu.edu
> http://www.cs.nyu.edu/mailman/listinfo/fom
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20160803/766f7adc/attachment.html>