On the Logical Philosophy of Assertive Graphs

Daniele Chiffi, Ahti Veikko Pietarinen*

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

6 Citations (Scopus)

Abstract

The logic of assertive graphs (AGs) is a modification of Peirce’s logic of existential graphs (EGs), which is intuitionistic and which takes assertions as its explicit object of study. In this paper we extend AGs into a classical graphical logic of assertions (ClAG) whose internal logic is classical. The characteristic feature is that both AGs and ClAG retain deep-inference rules of transformation. Unlike classical EGs, both AGs and ClAG can do so without explicitly introducing polarities of areas in their language. We then compare advantages of these two graphical approaches to the logic of assertions with a reference to a number of topics in philosophy of logic and to their deep-inferential nature of proofs.

Original languageEnglish
Pages (from-to)375-397
Number of pages23
JournalJournal of Logic, Language and Information
Volume29
Issue number4
DOIs
Publication statusPublished - Dec 2020

Scopus Subject Areas

  • Computer Science (miscellaneous)
  • Philosophy
  • Linguistics and Language

User-Defined Keywords

  • Assertion
  • Assertive graphs
  • Classical vs. non-classical logical graphs
  • Deep inference
  • Existential graphs
  • Inferentialism
  • Peirce

Fingerprint

Dive into the research topics of 'On the Logical Philosophy of Assertive Graphs'. Together they form a unique fingerprint.

Cite this