Abstract We define a finitary model of firstorder Peano Arithmetic in which quantification is interpreted constructively in terms of Turingcomputability, and show that it is incons...
We define a finitary model of first-order Peano Arithmetic in which satisfaction and quantification are interpreted constructively in terms of Turing-computability.