Computability Learning Seminar

Luke MacLean, Department of Pure Mathematics, University of Waterloo

"Effectively defining formulas in Robinson's Arithmetic"

It was proven by Alfred Tarski that all general recursive functions are definable in Robinson's Arithmetic. I will give his proof of this fact with supplementary information on how to make the process of finding the defining formula effective.

MC 5479