Mar. 20, 2001 item notes1 Subject: Notes For Puma Grass lecture (Mar.

2001 )

@:= S ea! ":=#rite on boar$ @% First, & 'oul$ li!e to t(an! #illiam )or (is tal! last 'ee! in '(ic( (e e* laine$ some o) t(e man+ 'a+s in '(ic( eo le (a,e misinter rete$ Go$els )irst incom leteness t(eorem %&n t(is tal! & (o e, amon- ot(er t(in-s, to -i,e a roo) o) t(is t(eorem %& 'ill t(en lea,e +ou to ma!e +our o'n misinter retations @%#(at 'e are -oin- to ro,e is "%For an+ consistent )ormal s+stem . 'it( com utable a*ioms '(ic( is o'er)ul enou-( to contain (N, 0, 1, /,0) t(ere is a sentence G suc( t(at neit(er G nor 1G can be ro,e$. @%No', t(e roo) & 'ill resent (ere is not t(e one '(ic( Go$el )irst came u 'it(. &n )act, '(en Go$el ori-inall+ ro,e$ (is t(eorem, (e coul$ onl+ ro,e it )or 2ome-a%consistent t(eories. %3(e sentence 'e 'ill tr+ an$ construct is a )ormali4e$ ,ersion o) t(e liars ara$o*. #e 'ant t(e statement to sa+ t(at & am not ro,able. %5e)ore 'e start, 'e (a,e to $etermine '(ic( s+stem 'e are 'or!in- in. %#e 'ill let our lan-ua-e be: 1 0 12 *?2 2 S 16 *?6 6 1 > > 7 , 8 " 9 = : / ; 0 < ( 10 )

"% =: 11 *?1

"3erm% 0, *?& are terms i) a, b are terms t(en so are Sa, (a/b), an$ (a0b) "Formulas% i) s, t are terms t(en s=t is a )ormula i) @,G are )ormulaAs an$ , is a ,ariable t(en 1(F), (F) , (G) an$ , "(F) are )ormulaAs @%Bur a*ioms 'ill be all lo-ical a*ioms an$ eCualit+ a*ioms as 'ell as t(e )ollo'in"%Number 3(eoretic D*ioms &) F is a )ormula, *,+ are terms an$ ,,' is a ,ariable *?i 1) Number 3(eoretic D*ioms a) 1(S* = 0) b) S*=S+ E%F *=+ c) */0 = * $) */S+=S(*/+) e) *00=0

)) *0S+=(*0+)/* -) F(0) an$ '(F(') %F F(S')) %F F(,) @%&t is im ortant to note t(at '(ile t(ere are in)initel+ man+ a*ioms, -i,en a )ormula, it is ossible to $etermine absolutel+ i) it is an a*iom. Go$els t(eorem onl+ a lies to s+stems 'it( t(is ro ert+. %No' t(at 'e (a,e $e)ine$ our s+stem, 'e (a,e to come u 'it( a 'a+ to tal! about sentences o) our s+stem. 3(is is $one b+ Go$el numberin- t(e lan-ua-e. "%Put t(e Go$el numbers abo,e eac( s+mbol. @%No' t(at 'e (a,e enco$e$ our lan-ua-e b+ numbers, 'e 'ant a 'a+ to enco$e a )ormula b+ a number in an e))ecti,e manner. %#e 'ill $o t(is b+ loo!in- at t(e e* onents o) t(e number 'e are intereste$ in. %For e*am le "%*?1/6 = 7: is enco$e$ b+ 2G11 0 6G: 0 8G2 0 :G2 0 11G2 0 16G1 0 1:G9 0 1<G2 0 26G2 0 2<G2 0 61G2 0 6:G1 "%#e 'ill let H2 (iI be t(e Go$el number o) t(e )ormula 2 (i, an$ 'e 'ill let 2-amma(*) H2-(*)I be t(e )ormula re resentin- t(e number *. @%No' t(is enco$in- isnAt ,er+ use)ul unless 'e can mirror t(e mani ulations $one in t(e s+stem in t(e Go$el numbers. %&n or$er to $o t(is, 'e )irst nee$ t(e notion o) a com utable )unction an$ a com utable relation. %For sim licit+ o) notation, 'e 'ill onl+ -i,e t(e $e)inition )or one ,ariable. &t can easil+ be e*ten$e$ to more t(an one ,ariable. "%#e sa+ t(at / is a com utable )unction %*E=+ is a com utable relation %&) ), - are com utable )unctions, J,K are com utable relations t(en so are 1) (?1(*)=)(-(*)) (recursion) 2) Kecursion: (?2(0)= c (?2(!/1):= )(!,(?2(!)) 6) 5oun$e$ leastness: ((n) = least *E= )(n) L K(*) 7)1J, J , K 8) 5oun$e$ Juanti)ication: 3(*)E=F ," (,E )(n) %F K(,)) 9) K(*,+)E=F )(*)=+ @%#e 'ill not ro,e it (ere, but i) K is a com utable relation t(en t(ere is a )ormula 2 (i?K o) our s+stem suc( t(at: "M%2 (i?K(*,+) E=F K(*,+) M%12 (i?K(*,+) E=F 1K(*,+) @% Furt(er, i) K is a com utable )unction 'e can sa+ (a,e "%Nescri tion =emma &) K is a com utable )unction, 'it( )ormula 2 (i?K an$ C=2 (i(m) t(en M%F(.(C)) E=FM% F(2 (i?K(.(m))) @%5asicall+ '(at t(is sa+s, is t(at i) 'e (a,e a com utable )unction '(ic( (as a ,alue C at m

t(en 'e can ro,e t(at )or an+ )ormula F i) 'e a l+ F to C 'e -et t(e same trut( ,alue as 'e 'oul$ i) 'e )irst com ose$ F 'it( 2 (i?K an$ t(en too! t(e ,alue at %#it( t(is in (an$, 'e can be-in to construct t(e mac(iner+ 'e 'ill nee$. %#e 'ill )irst nee$ se,eral )unctions (O* lain '(at t(e+ are): "%Ne-(*) =H1( 2-(*) ) I %Nis(*,+) =H( 2-(*) ) , ( 2-(+) )) I %Gen(*,+) =H"2-(*) ( 2-(+) )I D*iom(*) E=F* is an a*iom PG(*,+) E=F 2-(+) is a ,ariable, an$ 2-(*) = 2-(+) ( 2-(*) ) MP(*,+,4) E=F 2-(*) = a L 2-(+) = a%Fb L 2-(4)= b %Bur -oal no' is to create a com utable )unction an$ a com utable relation suc( t(at "%Sub(*,,,+)=H2-(*) 'it( 2-(+) substitute$ )or all )ree occurances o) ,ariable 2-(+)I %Proo)(*,+)E%F+ is a roo) o) 2-(*) E%F (+= 2Ga?1 6Ga?2> Prime(n)Ga?n ) L (a?n=*) L ( iE=n (D*iom(a?i) , (j,!Ei MP(a?j,a?!,a?i)) , (jEi ,, MP(a?j,,,a?i))) @%&n Go$elAs ori-inal a er, (e -a,e ,er+ e* licit $e)initions o) all t(e )unctions (e nee$e$. 5ut as 'e $onQt (a,e t(at muc( time, & 'ill just (o e +ou belie,e t(e t(e+ are com utable @%No' t(at 'e (a,e )inall+ establis(e$ t(e mac(iner+ 'e just nee$ one more )act be)ore 'e can ro,e t(e Go$elQs t(eorem o) t(e lecture: 3(e )i*e$ oint t(eorem. "%3(e Fi*e$ Point 3(eorem =et F(*?1) be an+ )ormula 'it( onl+ one )ree ,ariable. 3(en t(ere is a )ormula G suc( t(at M%GE=FF( HGI ) Proo): =et C=HF(s(*?1))I an$ let G = F(s( .(C) )) No', HGI = Sub (HF(s(*?1))I, H*?1I, C) = Sub (C, H*?1I, C) = s(C) So, M%G E=F F(s(C)) E=F F(HGI) JON. @%No' 'e are )inall+ rea$+ to ro,e Go$elAs incom leteness 3(eorem. %"Ne)ine Pro,(*)E=F (+ Proo)(*,+)) L (4E+ 1Proo)(Ne-(*), 4) "=et G be t(e )i*e$ oint o) t(e )ormula 1Pro,(*). So 'e (a,e M%G E=F 1Pro,(HGI) "Dssume M%G (an$ so 'e (a,e Proo)(HGI, ) )or a s eci)ic M%1Pro,(HGI) M%+1Proo)(HGI,+) M%1Proo)(HGI, ) =FE= 'e can )in$)

"Dssume M%1G (an$ so 'e (a,e Proo)(H1GI, ) )or a s eci)ic 'e can )in$) M%Pro,(HGI) M%(+ Proo)(HGI,+)) L (+E ) So, 'e can c(ec! eac( Proo)(HGI, +) at eac( ,alue less t(an an$ )in$ t(e ,alue suc( t(at

M%Proo)(HGI, ) an$ so 'e can t(ere)ore con,ert t(is number to an actual roo) an$ -et M%G =FE= %&) 'e (a,e time. %No' t(at 'e (a,e t(e )i*e$ oint t(eorem, it is eas+ to ro,e 3ars!iAs Pn$e)inabilit+ o) 3rut( 3(eorem '(ic( sa+s %"3(ere is no )ormula '(ic( $e)ines trut(.