A graph-theoretic account of logics

Journal of Logic and Computation 19 (6):1281-1320 (2009)
Download Edit this record How to cite View on PhilPapers
Abstract
A graph-theoretic account of logics is explored based on the general notion of m-graph (that is, a graph where each edge can have a finite sequence of nodes as source). Signatures, interpretation structures and deduction systems are seen as m-graphs. After defining a category freely generated by a m-graph, formulas and expressions in general can be seen as morphisms. Moreover, derivations involving rule instantiation are also morphisms. Soundness and completeness theorems are proved. As a consequence of the generality of the approach our results apply to very different logics encompassing, among others, substructural logics as well as logics with nondeterministic semantics, and subsume all logics endowed with an algebraic semantics.
PhilPapers/Archive ID
SERAGA-3
Revision history
Archival date: 2019-01-09
View upload history
References found in this work BETA
Symbolic Logic.Venn, John
The Geometry of Non-Distributive Logics.Restall, Greg & Paoli, Francesco

Add more references

Citations of this work BETA
Importing Logics.Rasga, João; Sernadas, Amílcar & Sernadas, Cristina
Fibring as Biporting Subsumes Asymmetric Combinations.Rasga, J.; Sernadas, A. & Sernadas, C.

Add more citations

Added to PP index
2019-01-09

Total views
36 ( #34,381 of 40,133 )

Recent downloads (6 months)
36 ( #15,143 of 40,133 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.