Abstract
Assertive graphs (AGs) modify Peirce’s Alpha part of Existential Graphs (EGs) and are used to reason about assertions without any ad hoc sign of assertion. This paper presents an extension of propositional AGs to Beta by lines. Absence of polarities necessitate Beta-AGs to resort to two kinds of lines: standard lines (a certain method of asserting), and barbed lines (a general method of asserting). A new set of rules of transformations for Beta-AGs is presented that derive theorems of quantificational intuitionistic logic. Beta-AGs offer a new system to analyse assertions through quantificational diagrams.
Author supplied keywords
Cite
CITATION STYLE
Bellucci, F., Chiffi, D., & Pietarinen, A. V. (2020). Beta Assertive Graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12169 LNAI, pp. 525–529). Springer. https://doi.org/10.1007/978-3-030-54249-8_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
