No label defined (Q3767346)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4025439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4025439 |
Statements
1985
0 references
subsystems of second order arithmetic
0 references
full comprehension principle
0 references
theories for classical analysis
0 references
weak systems
0 references
logical reductions
0 references
proof theory
0 references
model theory
0 references
provability
0 references
0.7742113471031189
0 references
0.7742113471031189
0 references
0.7738792896270752
0 references
0.7419565320014954
0 references
0.7402631044387817
0 references
[For the entire collection see Zbl 0598.00008.] This is a very leisurely account of work on justifying and unwinding proofs by means of logical reductions, mainly in proof theory, but also model theory; more pedantically, relating proofs, resp. provability, in the input and output of the reductions considered. The painstaking exposition corrects wide-spread misconceptions and misrepresentations of foundational schemes (around Hilbert's program) that spawned those reductions. But, contrary to p. 200, it fails to provide the material most pertinent for examining the (very dubious) assumptions of the schemes themselves; at the present time certainly the first order of business in `reflections on the epistemology of mathematics'. Specifically, in connection with (a) justification: To what extent are restrictions to, say, finitist methods justified? They are not, if additional principles are sound, too, and the reduction destroys elements of proofs that are more significant for reliability than mere soundness (of principles). In connection with (b) unwinding, especially, of proofs for \(\Pi^ 0_ 2\)-theorems (cf. p. 221), the restriction mentioned is, demonstrably, futile; quite concretely, compared with the following alternative: (i) permit arbitrary correct proofs of \(\Pi^ 0_ 1\)- lemmas, but (ii) restrict the end piece (from those lemmas) much more sharply, since primitive recursive or even Kalmar elementary procedures are algorithmically ineffective. Reviewer's note (concerning the `epistemology' of mathematical reasoning, or, in modern jargon, data processing). Generally, specific properties of the data are more decisive than logical generalities about - possibilities of - processing. But when logical aspects do contribute they are often quite different from those stressed in the schemes (which are thus not first steps in the right direction); cf., for example, \textit{J.-Y. Girard}'s book [Proof theory and logical complexity (Napoli, 1987)] on transforming proofs that are not well-founded or on the effect, on the reductions, of `small' changes in the input. Preoccupation with (misrepresentations of) discretized schemes tends to distract from these matters.
0 references