Abstract
Residuation has become an important concept in the study of algebraic structures and algebraic logic. Relation algebras, for example, are residuated Boolean algebras and residuation is now recognized as a key feature of substructural logics. Early work on residuation can be traced back to studies in the logic of relations by De Morgan, Peirce and Schröder. We know now that Peirce studied residuation enough to have listed equivalent forms that residuals may take and to have given a method for arriving at the different permutations. Here, we present for the first time a graphical treatment of residuation in Peirce’s Beta part of Existential Graphs (EGs). Residuation is captured by pairing the ordinary transformations of rules of EGs—in particular those concerning the cuts—with simple topological deformations of lines of identity. We demonstrate the effectiveness and elegance of the graphical presentation with several examples. While there might have been speculation as to whether Peirce recognized the importance of residuation in his later work, or whether residuation in fact appears in his work on EGs, we can now put the matter to rest. We cite passages where Peirce emphasizes the importance of residuation and give examples of graphs Peirce drew of residuals. We conclude that EGs are an effective means of enlightening this concept.
Supported by (Haydon) the ESF funded Estonian IT Academy research measure (2014-2020.4.05.19-0001) and (Pietarinen) the Basic Research Program of the HSE University and the TalTech grant SSGF21021.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
On the history of residuation (adjunctions) and its relation to Galois connections, see [2].
- 2.
While Peirce emphasizes this ordering in his algebraic work, he says little about reading such an ordering off the graphs. The few such places on the ordering of the ‘hooks’ around the relation terms appear in the early drafts of EGs from late 1886, in which Peirce notices how the connections of the lines to the relations should be read “clockwise” or “counterclockwise” (their converses) “beginning at the left/right” of the relation term; see [18, pp.220,263,295,302,303]. A further advantage of the notation in [5] is that the ordering is always explicit.
- 3.
One such derivation is [21, p. 42] which we forego here due to space limitations. Schmidt speculates that equational reasoning using predicate logic results in derivations that are six times longer than the corresponding algebraic handling of relations [p. xi].
References
Brink, C., Kahl, W., Schmidt, G.: Relational methods in computer science. Springer, Wien (1997). https://doi.org/10.1007/978-3-7091-6510-2. ISBN 3-211-82971-7
Erné, M. Adjunctions and Galois connections: origins, history and development. In: Denecke, K., Erné, M., Wismath, S. (eds.) Galois Connections and Applications, pp. 1–138. Springer, Dordrecht (2004). https://doi.org/10.1007/978-1-4020-1898-5_1
De Morgan, A.: On the Syllogism, no. IV, and on the Logic of Relations. Trans. Cambridge Phil. Soc. 10, 331–358 (2016)
Givant, S.: Introduction to Relation Algebras. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-65235-1
Haydon, N., Sobociński, P.: Compositional diagrammatic first-order logic. In: Pietarinen, A.-V., Chapman, P., Bosveld-de Smet, L., Giardino, V., Corter, J., Linker, S. (eds.) Diagrams 2020. LNCS (LNAI), vol. 12169, pp. 402–418. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-54249-8_32
Heath, P.: On the Syllogism, and Other Logical Writings. Routledge, London (1966)
Lambek, J.: The mathematics of sentence structure. American Math. Monthly 65(3), 154–170 (1958)
Lambek, J.: Pregroups and natural language processing. Math. Intell. 28(2), 41–48 (2006). https://doi.org/10.1007/BF02987155
Ma, M., Pietarinen, A.-V.: Peirce’s sequent proofs of distributivity. In: Ghosh, S., Prasad, S. (eds.) ICLA 2017. LNCS, vol. 10119, pp. 168–182. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-54069-5_13
Ma, M., Pietarinen, A.-V.: A graphical deep inference system for intuitionistic logic. Logique & Analyse 245, 73–114 (2018)
Ma, M., Pietarinen, A.-V.: Peirce’s Calculi for classical propositional logic. Rev. Symbolic Logic 13(3), 509–540 (2020)
Maddux, R.D.: Relation algebras. In: Brink, C., Kahl, W., Schmidt, G. (eds.) Relational Methods in Computer Science. Springer, New York (1997). ISBN 3-211-82971-7
Maddux, R.D.: The origin of relation algebras in the development and axiomatization of the calculus of relations. Studia Logica 50, 421–455 (1991)
Ono, H.: Substructural logics and residuated lattices: an introduction. In: Hendriks, V.F., Malinowski (eds.) Trends in Logic, vol. 20, pp. 177–212 (2003)
Peirce, C.S.: Note B. In: Peirce, C.S. (ed.) Studies in Logic by Members of Johns Hopkins University. Little, Brown, pp. 187–203 (1883)
Peirce, C.S.: The collected papers of Charles S. Peirce (CP). Hartshorne, C., Weiss, P., Burks, A.W. (eds.) Harvard University Press, Cambridge (1931–66)
Peirce, C.S.: The New Elements of Mathematics by Charles S. Peirce (NEM). In: Eisele, C. (ed.) The Hague: Mouton (1976)
Peirce, C.S.: Logic of the future: writings on existential graphs. In: Pietarinen, A.-V. (ed.) Volume 1: History and Applications, volume 2/1: The Logical Tracts; 2/2: The 1903 Lowell Lectures; volume 3: Pragmaticism and Correspondence. De Gruyter (2019)
Pratt, V.: Origins of the Calculus of Binary Relations. In: Proceedings Seventh Annual IEEE Symposium on Logic in Computer Science, vol. 1, pp. 248–254 (1992)
Roberts, D.D.: The Existential Graphs of C.S. Peirce. Mouton, The Hague (1973)
Schmidt, G.: Relational Mathematics. Cambridge University Press, Cambridge (2010)
Schröder, E.: Vorlesungen über die Algebra der Logik (Exakte Logik). Algebra und Logik der Relative. B.G. Teubner, Leipzig, Dritter Band (1895)
Tarski, A.: On the calculus of relations. J. Symbolic Logic 6, 73–89 (1941)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Haydon, N., Pietarinen, AV. (2021). Residuation in Existential Graphs. In: Basu, A., Stapleton, G., Linker, S., Legg, C., Manalo, E., Viana, P. (eds) Diagrammatic Representation and Inference. Diagrams 2021. Lecture Notes in Computer Science(), vol 12909. Springer, Cham. https://doi.org/10.1007/978-3-030-86062-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-86062-2_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-86061-5
Online ISBN: 978-3-030-86062-2
eBook Packages: Computer ScienceComputer Science (R0)