Does reductive proof theory have a viable rationale?

Erkenntnis 53 (1-2):63-96 (2000)
Abstract
The goals of reduction andreductionism in the natural sciences are mainly explanatoryin character, while those inmathematics are primarily foundational.In contrast to global reductionistprograms which aim to reduce all ofmathematics to one supposedly ``universal'' system or foundational scheme, reductive proof theory pursues local reductions of one formal system to another which is more justified in some sense. In this direction, two specific rationales have been proposed as aims for reductive proof theory, the constructive consistency-proof rationale and the foundational reduction rationale. However, recent advances in proof theory force one to consider the viability of these rationales. Despite the genuine problems of foundational significance raised by that work, the paper concludes with a defense of reductive proof theory at a minimum as one of the principal means to lay out what rests on what in mathematics. In an extensive appendix to the paper,various reduction relations betweensystems are explained and compared, and arguments against proof-theoretic reduction as a ``good'' reducibilityrelation are taken up and rebutted.
Keywords Philosophy   Philosophy   Epistemology   Ethics   Logic   Ontology
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1005622403850
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,756
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Essay Review.Enrico Moriconi - 2017 - History and Philosophy of Logic 38 (2):190-200.
Proof Theory in Philosophy of Mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.
Universes Over Frege Structures.Reinhard Kahle - 2003 - Annals of Pure and Applied Logic 119 (1-3):191-223.
Forcing for Hat Inductive Definitions in Arithmetic.Kentaro Sato - 2014 - Mathematical Logic Quarterly 60 (4-5):314-318.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

19 ( #261,648 of 2,177,962 )

Recent downloads (6 months)

1 ( #316,663 of 2,177,962 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums