Korean Journal of Logic 3 (24):245-280 (2021)

Authors
Abstract
Dag Prawitz (1971) put forward the idea that an admissible reduction process does not affect the identity of proofs represented by derivations in natural deduction. The idea relies on his conjecture that two derivations represent the same proof if and only if they are equivalent in the sense that they are reflexive, transitive and symmetric closure of the immediate reducibility relation. Schroeder-Heister and Tranchini (2017) accept Prawitz’s conjecture and propose the triviality test as the criterion for admissible reductions. In the present paper, we will consider two main troubles of the triviality test. The first is the obscurity of a method of evaluating admissible reductions. The second is the circularity problem that the triviality test already assumes the set of admissible reduction procedures. For the solution of the problems, we will propose the spoiler test which immunes the problems of the triviality test and has the role of the criterion for admissible reductions. At last, we shall cover a plausible problem of the spoiler test that can be caused by Crabbé’s case.
Keywords admissible reductions  Ekman paradox  the identity of proofs  Crabbé’s case  The triviality test
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,226
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Investigations Into Logical Deduction.Gerhard Gentzen - 1964 - American Philosophical Quarterly 1 (4):288 - 306.
Ideas and Results in Proof Theory.Dag Prawitz & J. E. Fenstad - 1975 - Journal of Symbolic Logic 40 (2):232-234.
Core Logic.Neil Tennant - 2017 - Oxford, England: Oxford University Press.
Proof Theory and Logical Complexity.Helmut Pfeifer & Jean-Yves Girard - 1989 - Journal of Symbolic Logic 54 (4):1493.
Proof and Paradox.Neil Tennant - 1982 - Dialectica 36 (2‐3):265-296.

View all 11 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Ekman’s Paradox.Peter Schroeder-Heister & Luca Tranchini - 2017 - Notre Dame Journal of Formal Logic 58 (4):567-581.
Paths to Triviality.Tore Øgaard - 2016 - Journal of Philosophical Logic 45 (3):237-276.
HC of an Admissible Set.Sy D. Friedman - 1979 - Journal of Symbolic Logic 44 (1):95-102.
Propositions in Prepositional Logic Provable Only by Indirect Proofs.Jan Ekman - 1998 - Mathematical Logic Quarterly 44 (1):69-91.
What Inductive Explanations Could Not Be.John Dougherty - 2018 - Synthese 195 (12):5473-5483.
Wellordering Proofs for Metapredicative Mahlo.Thomas Strahm - 2002 - Journal of Symbolic Logic 67 (1):260-278.
Sequent Calculi for SCI.Szymon Chlebowski - 2018 - Studia Logica 106 (3):541-563.
Criteria of Identity: Strong and Wrong.Hannes Leitgeb - 2013 - British Journal for the Philosophy of Science 64 (1):61-68.
The Single-Conclusion Proof Logic and Inference Rules Specification.Vladimir N. Krupski - 2001 - Annals of Pure and Applied Logic 113 (1-3):181-206.
On the Rules of Intermediate Logics.Rosalie Iemhoff - 2006 - Archive for Mathematical Logic 45 (5):581-599.
The Bodily Criterion of Personal Identity.Eric T. Olson - 2006 - In Fraser MacBride (ed.), Identity and Modality. Clarendon Press. pp. 242.
Characterizing Strongly Admissible Sets.Paul E. Dunne - 2020 - Argument and Computation 11 (3):239-255.

Analytics

Added to PP index
2021-11-19

Total views
7 ( #1,064,351 of 2,499,692 )

Recent downloads (6 months)
4 ( #169,778 of 2,499,692 )

How can I increase my downloads?

Downloads

My notes