Abstract
Peirce introduced the Alpha part of the logic of Existential Graphs (egs) as a diagrammatic syntax and graphical system corresponding to classical propositional logic. The logic of quasi-Boolean algebras (De Morgan algebras) is a weakening of classical propositional logic. We develop a graphical system of weak Alpha graphs for quasi-Boolean algebras, and show its soundness and completeness with respect to this algebra. Weak logical graphs arise with only minor modifications to the transformation rules of the original theory of egs. Implications of these modifications to the meaning of the sheet of assertion are then also examined.
M. Ma—The work supported by the Project Supported by Guangdong Province Higher Vocational Colleges & Schools Pearl River Scholar Funded Scheme (2017).
A.-V. Pietarinen—The work supported by the Estonian Research Council Personal Research Grant PUT 1305 (Abduction in the Age of Fundamental Uncertainty) and Nazarbayev University Social Policy Grant 2018–2019.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
The reference R is to Peirce’s manuscripts by the Robin number [19].
- 2.
He presented the 1880 system as an instrument for the analysis of the logical consequence relation, and thus came close to a sequent-style calculus in that presentation.
- 3.
The De Morgan law \(\lnot (a\wedge b)\le \lnot a\vee \lnot b\) with intuitionistic negation \(\lnot \) does not hold in Heyting algebras while its converse \(\lnot a\vee \lnot b\le \lnot (a\wedge b)\) does. However, both De Morgan laws hold in quasi-Boolean algebras.
- 4.
Peirce knew well this point: “[I]f an operation is thoroughly commutative ..., it is necessarily associative; and associative property is a mere corollary from its commutative property” (R 482).
- 5.
- 6.
Instead of a weakening of the classical Alpha to get the proposed quasi-Boolean graphs, we could strengthen the implication-free fragment of the intuitionistic system of Alpha [13] for the same effect. There the scroll would only represent involution and there is no implication. A new rule is
References
Bellucci, F., Pietarinen, A.-V.: Existential graphs as an instrument of logical analysis: part I. Alpha. Rev. Symb. Logic 9, 209–237 (2016)
Bellucci, F., Pietarinen, A.-V.: From Mitchell to Carus: 14 years of logical graphs in the making. Trans. Charles S. Peirce Soc. 52(4), 539–575 (2017a)
Bellucci, F., Pietarinen, A.-V.: Assertion and denial: a contribution from logical notations. J. Appl. Logics 25, 1–22 (2017b)
Bellucci, F., Chiffi, D., Pietarinen, A.-V.: Assertive graphs. J. Appl. Non-Class. Logics (2018). https://doi.org/10.1080/11663081.2017.1418101
Belnap Jr., N.D.: A useful four-valued logic. In: Dunn, J.M., Epstein, G. (eds.) Modern Uses of Multiple-Valued Logic, pp. 5–37. Springer, Dordrecht (1977). https://doi.org/10.1007/978-94-010-1161-7_2
Brünnler, K.: Deep Inference and Symmetry in Classical Proofs. Logos, Berlin (2003)
Dunn, J.M.: A relational representation of quasi-Boolean algebras. Notre Dame J. Formal Logic 23(4), 353–357 (1982)
Guglielmi, A.: Deep Inference. http://alessio.guglielmi.name/res/cos/
Ma, M., Fei, L.: Sequent calculi for semi-De Morgan and De Morgan algebras. Stud. Logica (2017). https://doi.org/10.1007/s11225-017-9755-7
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.: Proof analysis of Peirce’s alpha system of graphs. Stud. Logica 105(3), 625–647 (2017)
Ma, M., Pietarinen, A.-V.: Gamma graph calculi for modal logics. Synthese (2017). https://doi.org/10.1007/s11229-017-1390-3
Ma, M., Pietarinen, A.-V.: A graphical deep inference system for intuitionistic logic. Log. Anal. (in press)
Oostra, A.: Los gráficos Alfa de Peirce aplicados a la lógica intuicionista. Cuad. Sist. Peirceana 2, 25–60 (2010)
Peirce, C.S.: On an improvement in Boole’s calculus of logic. Proc. Am. Acad. Arts Sci. 7, 250–261 (1867)
Peirce, C.S.: On the algebra of logic. Am. J. Math. 3(1), 15–57 (1880)
Peirce, C.S.: On the algebra of logic: a contribution to the philosophy of notation. Am. J. Math. 7(2), 180–196 (1885)
Peirce, C.S.: Letter to Christine Ladd-Franklin, 9 November 1900. (R L 237)
Peirce, C.S.: Manuscripts in the Houghton Library of Harvard University, as identified by Richard Robin (1967). Cited as R followed by manuscript number
Pietarinen, A.-V.: Signs of Logic: Peircean Themes on the Philosophy of Language, Games, and Communication. Springer, Dordrecht (2006). https://doi.org/10.1007/1-4020-3729-5
Pietarinen, A.-V.: Is non-visual diagrammatic logic possible? In: Gerner, A. (ed.) Diagrammatology and Diagram Praxis. College Publications, London (2010)
Pietarinen, A.-V.: Exploring the Beta quadrant. Synthese 192, 941–970 (2015)
Roberts, D.D.: The existential graphs and natural deduction. In: Studies in the Philosophy of C. S. Peirce, pp. 109–121. University of Massachusetts Press (1964)
Roberts, D.D.: The Existential Graphs of Charles S. Peirce. Mouton, The Hague (1973)
Shin, S.-J.: The Iconic Logic of Peirce’s Graphs. MIT Press, Cambridge (2002)
Sowa, J.: Knowledge Representation. Brooks, Pacific Grove (2000)
Zeman, J.: The Graphical Logic of Charles S. Peirce. Ph.D. dissertation, University of Chicago (1964)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Ma, M., Pietarinen, AV. (2018). A Weakening of Alpha Graphs: Quasi-Boolean Algebras. In: Chapman, P., Stapleton, G., Moktefi, A., Perez-Kriz, S., Bellucci, F. (eds) Diagrammatic Representation and Inference. Diagrams 2018. Lecture Notes in Computer Science(), vol 10871. Springer, Cham. https://doi.org/10.1007/978-3-319-91376-6_50
Download citation
DOI: https://doi.org/10.1007/978-3-319-91376-6_50
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91375-9
Online ISBN: 978-3-319-91376-6
eBook Packages: Computer ScienceComputer Science (R0)