Abstract
Could Peirce?s Existential Graphs (EGs) have any advantage over propositional logical systems using symbols? Shin concludes that EGs are efficient compared to symbolic logic and comes up with ways to improve it. I consider how this argument can be interpreted. For that purpose, typical cases showing such efficiency are given and discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Shin, S.: The Iconic Logic of Peirce’s Graphs. The MIT Press, Cambridge (2002)
Sasaki, T.: Multiple readings of existential graphs. In: Chapman, P., Stapleton, G., Moktefi, A., Perez-Kriz, S., Bellucci, F. (eds.) Diagrams 2018. LNCS (LNAI), vol. 10871, pp. 598–604. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91376-6_54
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Sasaki, T. (2020). Typical Cases Showing the Efficiency of Existential Graphs. In: Pietarinen, AV., Chapman, P., Bosveld-de Smet, L., Giardino, V., Corter, J., Linker, S. (eds) Diagrammatic Representation and Inference. Diagrams 2020. Lecture Notes in Computer Science(), vol 12169. Springer, Cham. https://doi.org/10.1007/978-3-030-54249-8_42
Download citation
DOI: https://doi.org/10.1007/978-3-030-54249-8_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-54248-1
Online ISBN: 978-3-030-54249-8
eBook Packages: Computer ScienceComputer Science (R0)