Anand, Bhupinder Singh - 2018
If we assume the Thesis that any classical Turing machine , which halts on every n-ary sequence of natural numbers as input, determines a -provable formula, whose standard interpretation is an -ary arithmetical relation (, ..., ) that holds if, and only if, halts, then standard can model the...