96
Voted
FCS
2008
15 years 4 months ago
2008
We define a finitary model of first-order Peano Arithmetic in which satisfaction and quantification are interpreted constructively in terms of Turing-computability.