Some consequences of interpreting the associated logic of the rst-order Peano Arithmetic PA nitarily
Bhupinder Singh Anand · arXiv (Cornell University) · 2012
We show that the classical interpretations of Tarski’s inductive denitions actually allow us to dene the satisfaction and truth of the quantied formulas of the rst-order Peano Arithmetic PA over the domain N of the natural numbers in two essentially dierent ways: (a) in terms of algorithmic veriabilty; and (b) in terms of algorithmic computability. We show that the classical Standard interpretation IPA(N; Standard) of PA essentially denes the satisfaction and truth of the formulas of the rst-order Peano Arithmetic PA in terms of algorithmic veriability. It is accepted that this classical interpretation|in terms of algorithmic veriabilty|canno