ABSTRACT
This chapter looks at some problems of the following type can be shown to be unsolvable: find an algorithm by which we can decide if a given sentence is derivable from a system of axioms. The approach given here is due to Tarski. The chapter introduces an infinite sequence of symbols called variables. It contains several propositions.
