读《On formally undecidable propositions of Principia Mathematica and related systems》

读《On formally undecidable propositions of Principia Mathematica and related systems》

 

A formula is a finite sequence of natural numbers, and a proof is a finite sequence of finite sequences of natural numbers.

formulas are sequences of natural numbers -> expressible in PM

class-sign: a formula of PM with exactly one free variable of type natural numbers

K = {n belongs IN | not provable(R _n(n))}

K is the set of numbers where the formla R _n(n) that you get when you insert n into its own formula R _{n is improvable.}

for a speci c natural number q. We will now prove that the theorem Rq(q) is

undecidable within PM. We can understand this by simply plugging in the de nitions:

Rq(q) , S(q) , q 2 K , :prov