Assertive graphs

2018

Closed access Metadata (CSL-JSON)
DOI 10.1080/11663081.2017.1418101
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Peirce and Frege both distinguished between the propositional content of an assertion and the assertion of a propositional content, but with different notational means. We present a modification of Peirce’s graphical method of logic that can be used to reason about assertions in a manner similar to Peirce’s original method. We propose a new system of Assertive Graphs (AGs), which unlike the tradition that follows Frege involves no ad hoc sign of assertion. We show that axioms of intuitionistic logic can be derived from AGs, and argue that AGs analyse and represent assertions and illocutionary content in a way which is motivated both by its logical properties and its historical connection with the ideas that led to the development of the graphical method.