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
Upload history
Archival date: 2019-01-09
View other versions
Added to PP index
2019-01-09

Total views
147 ( #34,397 of 2,433,135 )

Recent downloads (6 months)
22 ( #31,960 of 2,433,135 )

How can I increase my downloads?

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