Skip to main content
Log in

Reconstituting Beta Graphs into an Efficacious System

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

Logicians have strongly preferred first-order natural deductive systems over Peirce's Beta Graphs even though both are equivalent to each other. One of the main reasons for this preference, I claim, is that inference rules for Beta Graphs are hard to understand, and, therefore, hard to apply for deductions. This paper reformulates the Beta rules to show more fine-grained symmetries built around visual features of the Beta system, which makes the rules more natural and easier to use and understand. Noting that the rules of a natural deductive system are natural in a different sense, this case study shows that the naturalness and the intuitiveness of rules depends on the type of representation system to which they belong. In a diagrammatic system, when visual features are discovered and fully used, we have a more efficacious deductive system. I will also show that this project not only helps us to apply these rules more easily but to understand the validity of the system at a more intuitive level.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Gardner, M., 1982 [1958], Logic Machines and Diagrams, 2nd edn., Chicago: University of Chicago Press.

    Google Scholar 

  • Peirce, C.S., 1933, Collected Papers of Charles Sanders Peirce, Vol. 4, C. Hartshorne and P. Weiss, eds., Cambridge, MA: Harvard University Press.

    Google Scholar 

  • Roberts, D., 1963, “The existential graphs of Charles S. Peirce,” Ph.D. Dissertation, University of Illinois.

  • Roberts, D., 1973, The Existential Graphs of Charles S. Peirce, The Hague: Mouton.

    Google Scholar 

  • Shin, S.-J., 1994, The Logical Status of Diagrams, New York: Cambridge University Press.

    Google Scholar 

  • Shin, S.-J., 1998a, “Peirce' Alpha system reconsidered,” ms.

  • Shin, S.-J., 1998b, “An algorithm for reading Beta diagrams,” ms.

  • Sowa, J., 1984, Conceptual Structure: Information Processing in Mind and Machine, Reading, MA: Addison-Wesley.

    Google Scholar 

  • White, R., 1984, “Peirce' Alpha graphs: The completeness of propositional logic and the fast simplification of truth-function,” Transactions of the Charles S. Peirce Society 20, 351–361.

    Google Scholar 

  • Zeman, J., 1964, “The graphical logic of C.S. Peirce,” Ph.D. Dissertation, University of Chicago.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shin, SJ. Reconstituting Beta Graphs into an Efficacious System. Journal of Logic, Language and Information 8, 273–295 (1999). https://doi.org/10.1023/A:1008303204427

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008303204427

Navigation