<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-11-16 09:11:59Computability theory Mathematical logic Mathematics Theoretical computer science Primitive recursive function Primitive recursive arithmetic ELEMENTARY Reverse mathematics Pairing function Ackermann function Sequence Recursion |
Add to Reading List |
Things that can and things that can’t be done in PRA Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade, Bldg. 540![REMARKS ON FINITISM W. W. TAIT† The background of these remarks is that in 1967, in ‘’Constructive reasoning” [27], I sketched an argument that finitist arithmetic coincides with primitive recursive arithmetic,](https://www.pdfsearch.io/img/a0492d1d9ffdda471bb50a2dbffbdffb.jpg "REMARKS ON FINITISM W. W. TAIT† The background of these remarks is that in 1967, in ‘’Constructive reasoning” [27], I sketched an argument that finitist arithmetic coincides with primitive recursive arithmetic,")
