Abstract
The topic of identity of proofs was put on the agenda of general (or structural) proof theory at an early stage. The relevant question is: When are the differences between two distinct proofs (understood as linguistic entities, proof figures) of one and the same formula so inessential that it is justified to identify the two proofs? The paper addresses another question: When are the differences between two distinct formulas so inessential that these formulas admit of identical proofs? The question appears to be especially natural if the idea of working with more than one kind of derivations is taken seriously. If a distinction is drawn between proofs and disproofs (or refutations) as primitive entities, it is quite conceivable that a proof of one formula amounts to a disproof of another formula, and vice versa. A notion of inherited identity of derivations is introduced for derivations in a cut-free sequent system for Almukdad and Nelson’s constructive paraconsistent logic N4 with strong negation. The notion is obtained by identifying sequent rules the application of which has no effect on the identity of derivations. Then the notion of inherited identity is used to define a bilateralist notion of synonymy between formulas, which is a relation drawing more fine-grained distinctions between formulas than strong equivalence.
Chapter PDF
Similar content being viewed by others
Keywords
References
Almukdad, A. and D. Nelson (1984). Constructible falsity and inexact predicates. Journal of Symbolic Logic 49, 231–233.
Ayhan, S. (2021). What is the meaning of proofs? A Fregean distinction in prooftheoretic semantics. Journal of Philosophical Logic 50. Published online October 22, 571–59.
Carnap, R. (1947). Meaning and Necessity. A Study in Semantics and Modal Logic. Chicago: University of Chicago Press.
Cosmo, R. di (1995). Isomorphisms of Types: from λ-Calculus to Information Retrieval and Language Design. Basel: Birkhäuser.
Cosmo, R. di (2005). A short survey of isomorphisms of types. Mathematical Structures in Computer Science 15.
Cozzo, C. (1994). Meaning and Argument: A Theory of Meaning Centred on Immediate Argumental Role. Stockholm: Almqvist & Wiksel.
Danos, V., J.-B. Joinet, and H. Schellinx (2003). Computational isomorphisms in classical logic. Theoretical Computer Science 294, 353–378.
de Campos Sanz,W. and T. Piecha (2014). A critical remark on the BHK interpretation of implication. Philosophia Scientiae 18, 13–22.
Dean, W. and H. Kurokawa (2016). Kreisel’s theory of constructions, the Kreisel-Goodman paradox, and the second clause. In: Advances in Proof-Theoretic Semantics. Ed. by T. Piecha and P. Schroeder-Heister. Trends in Logic Vol. 43, Cham: Springer, 27–63.
Došen, K. (1997). Logical consequence: a turn in style. In: Logic and Scientific Methods. Volume One of the Tenth International Congress of Logic, Methodology and Philosophy of Science. Ed. by M. L. D. Chiara, K. Doets, D. Mundici, and J. van Benthem. Florence, August 1995, Synthese Library Vol. 259. Dordrecht: Kluwer, 289–311.
Došen, K. (2006). Models of deduction. Synthese 148, 639–657.
Došen, K. and Z. Petrić (2012). Isomorphic formulae in classical propositional logic. Mathematical Logic Quarterly 58, 5–17.
Drobyshevich, S. (2021). Tarskian consequence relations bilaterally: some familiar notions. Synthese 198. Published online May 30, 2019, 5213–5240.
Francez, N. (2014). Bilateralism in proof-theoretic semantics. Journal of Philosophical Logic 43, 239–259.
Francez, N. (2015). Proof-theoretic Semantics. London: College Publications.
Girard, J.-Y. (1989). Proofs and Types. Translated and with appendices by P. Taylor and Y. Lafont. Cambridge: Cambridge University Press.
Goranko, V., G. Pulcini, and T. Skura (2020). Refutation systems: an overview and some applications to philosophical logics. In: Knowledge, Proof and Dynamics. Ed. by F. Liu, H. Ono, and J. Yu. Springer: Cham, 173–197.
Goré, R. (2000). Dual intuitionistic logic revisited. In: Automated Reasoning with Analytic Tableaux and Related Methods. Ed. by R. Dyckhoff. Springer Lecture Notes in Artificial Intelligence, Vol. 1847. Berlin: Springer, 252–267.
Goré, R. and I. Shillito (2020). Bi-intuitionistic logics: a new instance of an old problem. In: Advances in Modal Logic. Volume 13. Ed. byN. Olivetti, R.Verbrugge, S. Negri, and G. Sandu. London: College Publications, 296–288.
Harper, R., F. Honsell, and G. Plotkin (1993). A framework for defining logics. Journal of the ACM 40, 143–184.
Kamide, N. and H. Wansing (2012). Proof theory of Nelson’s paraconsistent logic: A uniform perspective. Theoretical Computer Science 415, 1–38.
Kamide, N. and H. Wansing (2015). Proof Theory of N4-related Paraconsistent Logics. London: College Publications.
Kreisel, G. (1962). Foundations of intuitionistic logic. In: Logic Methodology and Philosophy of Science, Proceedings of the 1960 International Congress. Ed. by E. Nagel, P. Suppes, and A. T. A. Tarski. Stanford: Stanford UP, 198–210.
KĂĽrbis, N. (2019). Proof and Falsity: A Logical Investigation. Cambridge: Cambridge UP.
López-Escobar, E. G. K. (1972). Refutability and elementary number theory. Indagationes. Mathematicae 43, 362–374.
Moschovakis, Y. (2006). A logical calculus of meaning and synonymy. Linguistics and Philosophy 29, 27–89.
Nelson, D. (1949). Constructible falsity. Journal of Symbolic Logic 14, 16–26.
Odintsov, S. P. (2008). Constructive Negations and Paraconsistency. Dordrecht: Springer.
Omori, H. and H. Wansing (2020). An extension of connexive logic C. In: Advances in Modal Logic. Ed. by N. Olivetti, R. Verbrugge, S. Negri, and G. Sandu. Vol. 13. London: College Publications, 503–522.
Pearce, D. (1992). Reasoning with negative information, ii: hard negation, strong negation and logic programs. In: Nonclassical Logics and Information Processing. Ed. by D. Pearce and H. Wansing. Lecture Notes in AI 619. Berlin: Springer, Berlin, 63–79.
Poggiolesi, F. (2020). Grounding rules and (hyper-)isomorphic formulas. Australasian Journal of Logic 1, 70–80.
Prawitz, D. (1971). Ideas and results in proof theory. In: Proceedings of the Second Scandinavian Logic Symposium. Ed. by J. E. Fenstad. Amsterdam: North-Holland, 235–307.
Rauszer, C. (1980). An algebraic and Kripke-style approach to a certain extension of intuitionistic logic. Dissertationes Mathematicae 167.
Restall, G. (2019). Isomorphisms in a category of proofs. Tech. rep. Working Paper, 1–20.
Rezende de Castro Alves, T. (2019). Synonymy and Identity of Proofs: APhilosophical Essay. PhD thesis. University of TĂĽbingen.
Rumfitt, I. (2000). “Yes” and “no”. Mind 109, 781–823.
Schroeder-Heister, P. (2011). Schluß und Umkehrschluß. Ein Beitrag zur Definitionstheorie. In: Lebenswelt undWissenschaft. Akten des XXI. Deutschen Kongresses für Philosophie 2009. Ed. by C. F. Gethmann. Vol. 3. Deutsches Jahrbuch Philosophie, 1065–1092.
Schroeder-Heister, P (2018). Proof-theoretic semantics. In: The Stanford Encyclopedia of Philosophy. Spring 2018 Edition. E. N. Zalta. url: https://plato.stanford.edu/archives/spr2018/entries/proof-theoretic-semantics/.
Sørensen, M. and P. Urzyczyn (2006). Lectures on the Curry-Howard Isomorphism. Amsterdam: Elsevier.
Sundholm, G. (1999). Identity: propositional, criterial, absolute. In: The Logca Yearbook 1998. Ed. by T. Childers. Prague: Filosofia Publishers, 20–26.
Tranchini, L. (2016). Proof-theoretic semantics, paradoxes and the distinction between sense and denotation. Journal of Logic and Computation. Published online June 02, 2014, 495–512.
Tranchini, L. (2021). Proof-theoretic harmony: towards an intensional account. Synthese 198. Published online September 21, 2016, 1145–1176.
Troelstra, A. (1999). From constructivism to computer science. Theoretical Computer Science 211, 233–252.
Troelstra, A. and D. van Dalen (1988). Constructivism in Mathematics. Vol. 1. Amsterdam: North-Holland.
Troelstra, A. and H. Schwichtenberg (2000). Basic Proof Theory. 2nd ed. Cambridge: Cambridge UP.
von Kutschera, F. (1969). Ein verallgemeinerter Widerlegungsbegriff für Gentzenkalküle. Archiv für mathematische Logik 12, 104–118.
Wansing, H. (1993). The Logic of Information Structures. Vol. 681. Springer Lecture Notes in AI. Berlin: Springer.
Wansing, H (2005). Connexive modal logic. In: Advances in Modal Logic. Ed. by R. Schmidt, I. Pratt-Hartmann, M. Reynolds, and H. Wansing. Vol. 5. London: King’s College Publications, 367–383. url: http://www.aiml.net/volumes/volume5/.
Wansing, H (2010). Proofs, disproofs, and their duals. In: Advances in Modal Logic. Ed. by L. Beklemishev, V. Goranko, and V. Shehtman. Vol. 8. London: College Publications, 483–505.
Wansing, H (2016a). Falsification, natural deduction, and bi-intuitionistic logic. Journal of Logic and Computation 26. Published online July 17, 2013, 425–450.
Wansing, H. (2016b). On split negation, strong negation, information, falsification, and verification. In: J. Michael Dunn on Information Based Logics. Ed. by K. Bimbó. Cham: Springer, 161–189.
Wansing, H. (2017). A more general general proof theory. Journal of Applied Logic 25, 23–46.
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
Wansing, H. (2024). A Note on Synonymy in Proof-Theoretic Semantics. 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-031-50981-0_11
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)