effective formal system immediately realized new definitions computability could used purpose allowing state incompleteness theorems generality could implied original paper numerous results recursion theory obtained stephen cole kleene emil leon post kleene introduced concepts relative computability foreshadowed turing arithmetical hierarchy kleene later generalized recursion theory higher order functionals kleene georg kreisel studied formal versions intuitionistic mathematics particularly context proof theory formal logical systems
Humanities Philosophy Logic Mathematical logic