Notre Dame Journal of Formal Logic

Ekman’s Paradox

Peter Schroeder-Heister and Luca Tranchini

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

Prawitz observed that Russell’s paradox in naive set theory yields a derivation of absurdity whose reduction sequence loops. Building on this observation, and based on numerous examples, Tennant claimed that this looping feature, or more generally, the fact that derivations of absurdity do not normalize, is characteristic of the paradoxes. Striking results by Ekman show that looping reduction sequences are already obtained in minimal propositional logic, when certain reduction steps, which are prima facie plausible, are considered in addition to the standard ones. This shows that the notion of reduction is in need of clarification. Referring to the notion of identity of proofs in general proof theory, we argue that reduction steps should not merely remove redundancies, but must respect the identity of proofs. Consequentially, we propose to modify Tennant’s paradoxicality test by basing it on this refined notion of reduction.

Article information

Source
Notre Dame J. Formal Logic Volume 58, Number 4 (2017), 567-581.

Dates
Received: 26 February 2014
Accepted: 6 July 2015
First available in Project Euclid: 18 July 2017

Permanent link to this document
https://projecteuclid.org/euclid.ndjfl/1500364943

Digital Object Identifier
doi:10.1215/00294527-2017-0017

Zentralblatt MATH identifier
06803188

Subjects
Primary: 03F05: Cut-elimination and normal-form theorems 03A05: Philosophical and critical {For philosophy of mathematics, see also 00A30}
Secondary: 00A30: Philosophy of mathematics [See also 03A05]

Keywords
paradoxes Russell’s paradox normalization general proof theory identity of proofs

Citation

Schroeder-Heister, Peter; Tranchini, Luca. Ekman’s Paradox. Notre Dame J. Formal Logic 58 (2017), no. 4, 567--581. doi:10.1215/00294527-2017-0017. https://projecteuclid.org/euclid.ndjfl/1500364943


Export citation

References

  • [1] Crabbé, M., “Non-normalisation de ZF/Counterexample to normalisation for ZF,” Proof Theory Symposium, Kiel 1974, http://www.logic-center.be/Publications/Bibliotheque/contreexemple.pdf.
  • [2] Došen, K., “Logical consequence: A turn in style,” pp. 289–311 in Logic and Scientific Methods: Volume One of the Tenth International Congress of Logic, Methodology and Philosophy of Science, Florence, August 1995, edited by M. L. Dalla Chiara, K. Doets, D. Mundici, and J. van Benthem, Kluwer, Dordrecht, 1997.
  • [3] Došen, K., Cut Elimination in Categories, Springer, Berlin, 2000.
  • [4] Došen, K., “Identity of proofs based on normalization and generality,” Bulletin of Symbolic Logic, vol. 9 (2003), pp. 477–503.
  • [5] Došen, K., “Models of deduction,” Synthese, vol. 148 (2006), pp. 639–57.
  • [6] Došen, K., and Z. Petrić, “The typed Böhm theorem,” Electronic Notes in Theoretical Computer Science, vol. 50 (2001), pp. 117–29.
  • [7] Došen, K., and Z. Petrić, Proof-Theoretical Coherence, College Publications, London, 2004.
  • [8] Ekman, J., Normal Proofs in Set Theory, Ph.D. dissertation, Unversity of Göteborg, Gotenberg, Germany, 1994.
  • [9] Ekman, J., “Propositions in propositional logic provable only by indirect proofs,” Mathematical Logic Quarterly, vol. 44 (1998), pp. 69–91.
  • [10] Hallnäs, L., “On Normalization of Proofs in Set Theory,” Ph.D. thesis, University of Göteborg, 1983, Dissertationes Mathematicae, vol. 261, Polska Akademia Nauk, Warszawa, 1988.
  • [11] Prawitz, D., Natural Deduction: A Proof-Theoretical Study, Almqvist & Wiksell, Stockholm, 1965. Reprinted Mineola, NY: Dover Publications, 2006.
  • [12] Prawitz, D., “Ideas and results in proof theory,” pp. 235–308 in Proceedings of the Second Scandinavian Logic Symposium (Oslo 1970), edited by J. E. Fenstad, North-Holland, Amsterdam, 1971.
  • [13] Rogerson, S., “Natural deduction and Curry’s paradox,” Journal of Philosophical Logic, vol. 36 (2007), pp. 155–79.
  • [14] Schroeder-Heister, P., “Proof-theoretic semantics, self-contradiction, and the format of deductive reasoning,” Topoi, vol. 31 (2012), pp. 77–85.
  • [15] Schroeder-Heister, P., Proof-Theoretic Semantics, Stanford Encyclopedia of Philosophy, edited by E.N. Zalta, plato.stanford.edu, Stanford, 2012.
  • [16] Stålmarck, G., “Normalization theorems for full first order classical natural deduction,” The Journal of Symbolic Logic, vol. 56 (1991), pp. 129–49.
  • [17] Sundholm, G., “Review of Michael Dummett, elements of intuitionism,” Theoria, vol. 45 (1979), pp. 90–5.
  • [18] Tennant, N., “Proof and paradox,” Dialectica, vol. 36 (1982), pp. 265–96.
  • [19] Tennant, N., “On paradox without self-reference,” Analysis, vol. 55 (1995), pp. 199–207.
  • [20] Tranchini, L., “Harmonising harmony,” Review of Symbolic Logic, vol. 8 (2015), pp. 411–23.
  • [21] Tranchini, L., “Proof-theoretic semantics, paradoxes and the distinction between sense and denotation,” Journal of Logic and Computation, vol. 26 (2016), pp. 495–512.
  • [22] Widebäck, F., Identity of Proofs, Almqvist & Wiksell, Stockholm, 2001.