Abstract
In the present paper we discuss a recent suggestion of Schroeder-Heister concerning the possibility of defining an intensional notion of harmony using isomorphism in second-order propositional logic. The latter is not an absolute notion, but its definition is relative to the choice of criteria for identity of proofs. In the paper, it is argued that in order to attain a satisfactory account of harmony, one has to consider a notion of identity stronger than the usual one (based on β- and η-conversions) that the authors have investigated in recent work.
Chapter PDF
Similar content being viewed by others
Keywords
References
Bainbridge, E. S., P. J. Freyd, A. Scedrov, and P. J. Scott (1990). Functorial polymorphism. Theoretical Computer Science 70, 35–64.
Belnap, N. D. (1962). Tonk, plonk and plink. Analysis 22, 130–134.
Carnap, R. (1931). Die logizistische grundlegung der mathematik. Erkenntnis 2, 91–105.
Carnap, R. (1956). Meaning and Necessity. Chicago Univerisity Press.
Došen, K. (2003). Identity of proofs based on normalization and generality. Bulletin of Symbolic Logic 9, 477–503.
Došen, K. and Z. Petrić (2001). The typed Böhm theorem. Electronic Notes in Theoretical Computer Science 50. BOTH 2001, Böhm’s theorem: applications to Computer Science Theory (Satellite Workshop of ICALP 2001), 117–129.
Dummett, M. (1991). The Logical Basis of Metaphysics. London: Duckworth.
Gentzen, G. (1935). Untersuchungen über das logische Schließen. Mathematische Zeitschrift 39. eng. transl. ‘Investigations into logical deduction’, in M. E. Szabo (ed.), The collected papers of Gerhard Gentzen, North-Holland, 1969, pp. 68–131.
Girard, J.-Y. (1986). The System F of variable types, fifteen years later. Theoretical Computer Science 45, 159–192.
Harper, R. and J. C. Mitchell (1999). Parametricity and variants of Girard’s J operator. Information Processing Letters 70 (1), 1–5.
Hermida, C., U. S. Reddy, and E. P. Robinson (2014). Logical relations and parametricity
Hermida, C., U. S. Reddy, and E. P. Robinson A Reynolds programme for category theory and programming languages. In: Proceedings of the Workshop on Algebra, Coalgebra and Topology (WACT 2013). Vol. 303. Electronic Notes in Theoretical Computer Science. Elsevier, 149–180.
Ilik, D. (2014). Axioms and decidability for type isomorphism in the presence of sums. In: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). CSLLICS ’14. New York, NY, USA: Association for Computing Machinery. doi: https://doi.org/10.1145/2603088.2603115. url: https://doi.org/10.1145/2603088.2603115.
Longo, G., K. Milsted, and S. Soloviev (1993). The genericity theorem and the notion of parametricity in the polymorphic λ-calculus. Theoretical Computer Science 121, 323–349.
Okada, M. and P. J. Scott (1999). A note on rewriting theory for uniqueness of iteration. Theory and Applications of Categories 6, 47–64.
Pistone, P. (2018). Polymorphism and the obstinate circularity of second order logic, a victims’ tale. The Bulletin of Symbolic Logic 24, 1–52.
Pistone, P. and L. Tranchini (2021). The Yoneda Reduction of Polymorphic Types. In: 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Ed. By C. Baier and J. Goubault-Larrecq. Vol. 183. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 35:1–35:22.
Pistone, P., L. Tranchini, and M. Petrolo (2021). The naturality of natural deduction (II). Some remarks on atomic polymorphism. To appear Studia Logica. Pre-print available at https://arxiv.org/abs/1908.11353.
Prawitz, D. (1965a). Natural deduction, a proof-theoretical study. Almqvist&Wiskell.
Prawitz, D. (1971). Ideas and results in proof theory. In: Proceedings of the Second Scandinavian Logic Symposium. Ed. by J. E. Fenstad. Vol. 63. Studies in Logic and the Foundations of Mathematics. Elsevier, 235–307.
Prawitz, D. (1979). Proofs and the meaning and completeness of the logical constants. In: Essays on Mathematical and Philosophical Logic: Proceedings of the Fourth Scandinavian Logic Symposium and the First Soviet-Finnish Logic Conference, Jyväskylä, Finland, June 29–July 6, 1976. Ed. by J. Hintikka, I. Niiniluoto, and E. Saarinen. Dordrecht: Kluwer, 25–40.
Prior, A. N. (1960). The runabout inference-ticket. Analysis 21, 38–39.
Reynolds, J. C. (1983). Types, abstraction and parametric polymorphism. In: Information Processing ’83. Ed. by R. E. A. Mason. North-Holland, 513–523.
Scherer, G. (2017). Deciding equivalence with sums and the empty type. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017. Ed. by G. Castagna and A. D. Gordon. ACM, 374–386. url: http://dl.acm.org/citation.cfm?id=3009901.
Schroeder-Heister, P. (1981). Untersuchungen zur regellogischen Deutung von Aussagenverknüpfungen. PhD thesis. Bonn University.
Schroeder-Heister, P. (Dec. 1984). A natural extension of natural deduction. Journal of Symbolic Logic 49, 1284–1300.
Schroeder-Heister, P. (2014a). Harmony in proof-theoretic semantics: A reductive analysis. In: Dag Prawitz on Proof and Meaning. Ed. by H. Wansing. Vol. 7. Outstanding Contributions to Logic. Springer.
Schroeder-Heister, P. (2014b). The calculus of higher-level rules, propositional quantification, and the foundational approach to proof-theoretic harmony. English. Studia Logica 102, 1185–1216. doi: https://doi.org/10.1007/s11225-014-9562-3.
Schroeder-Heister, P. (2016). Open problems in proof-theoretic semantics. In: Advances in Proof- Theoretic Semantics. Ed. by T. Piecha and P. Schroeder-Heister. Springer International Publishing, 253–283. doi: https://doi.org/10.1007/978- 3- 319- 22686- 6_16. url: https://doi.org/10.1007/978-3-319-22686-6_16.
Solov’ev, S. V. (1983). The category of finite sets and cartesian closed categories. Journal of Soviet Mathematics 22, 1387–1400.
Statman, R. (1983). λ-definable functionals and βη-conversion. Archiv für mathematische Logik und Grundlagenforschung 23, 21–26.
Strachey, C. (1967). Fundamental concepts in programming languages. Higher Order and Symbolic Computation 13, 11–49.
Tennant, N. (1978). Natural Logic. Edimburgh: Edimburgh University Press.
Tranchini, L. (2012). Truth from a proof-theoretic perspective. Topoi 31, 47–57.
Tranchini, L. (2016a). Proof-theoretic harmony: towards an intensional account. Synthese. doi: https://doi.org/10.1007/s11229-016-1200-3.
Tranchini, L. (2016b). Proof-theoretic semantics, paradoxes, and the distinction between sense and denotation. Journal of Logic and Computation 26, 495–512.
Tranchini, L. (2018). Stabilizing quantum disjunction. Journal of Philosophical Logic 47, 1029–1047.
Tranchini, L. 2019). Proof, meaning and paradox: some remarks. Topoi 38, 591–603.
Tranchini, L., P. Pistone, and M. Petrolo (2019). The naturality of natural deduction. Studia Logica 107, 195–231.
Widebäck, F. (2001). Identity of proofs. Stockholm: Almqvist & Wiksell.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-ShareAlike 4.0 International License (http://creativecommons.org/licenses/by-sa/4.0/), which permits use, sharing, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. If you remix, transform, or build upon this chapter or a part thereof, you must distribute your contributions under the same license as the original.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2024 The Author(s)
About this chapter
Cite this chapter
Pistone, P., Tranchini, L. (2024). Intensional Harmony as Isomorphism. In: Piecha, T., Wehmeier, K.F. (eds) Peter Schroeder-Heister on Proof-Theoretic Semantics. Outstanding Contributions to Logic, vol 29. Springer, Cham. https://doi.org/10.1007/978-3-031-50981-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-50981-0_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-50980-3
Online ISBN: 978-3-031-50981-0
eBook Packages: Religion and PhilosophyPhilosophy and Religion (R0)