<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-11-12 10:34:29Computability theory Proof theory Mathematical logic Metalogic Reverse mathematics Primitive recursive functional Second-order arithmetic Peano axioms Primitive recursive function Primitive recursive arithmetic Model theory Symbol |
Add to Reading List |
FOUNDATIONAL AND MATHEMATICAL USES OF HIGHER TYPES ULRICH KOHLENBACH† DEDICATED TO SOLOMON FEFERMAN FOR HIS 70TH BIRTHDAY §1. Introduction. A central theme of proof theory is expressed by the following question:![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,")
