Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A Graph-theoretic Account of Logics
Author: Sernadas, A
Sernadas, C
Rasga, J
Coniglio, M
Abstract: A graph-theoretic account of logics is explored based on the general notion of in-graph (i.e: a graph where each edge can have a finite sequence of nodes as source). Signatures, interpretation structures and deduction systems are seen as multi-graphs (in-graphs). After defining a category freely generated by a in-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 non-deteministic semantics, and subsume all logics endowed with an algebraic semantics,
Subject: Graph-theoretic account of logics
non-deterministic semantics
diagrammatic reasoning via morphisms
completeness results
Country: Inglaterra
Editor: Oxford Univ Press
Rights: fechado
Identifier DOI: 10.1093/logcom/exp023
Date Issue: 2009
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000273177000018.pdf613.45 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.