Exercises

1.

Is it possible that the machine can print all true sentences? If ``No," provide a true sentence S_g that the machine cannot print.

2.

How can it be proved that S_g is true but can't be printed?

3.

What about $P M (\sim P M)$ -- can it be printed? Why?