Journal of Logic and Computation 19 (6):1281-1320 (2009)

Authors
Marcelo E. Coniglio
University of Campinas
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.
Keywords combination of ogics  multi-graphs
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

 PhilArchive page | Other versions
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Symbolic Logic.John Venn - 1881 - New York: B. Franklin.
The Geometry of Non-Distributive Logics.Greg Restall & Francesco Paoli - 2005 - Journal of Symbolic Logic 70 (4):1108 - 1126.

Add more references

Citations of this work BETA

Importing Logics.João Rasga, Amílcar Sernadas & Cristina Sernadas - 2012 - Studia Logica 100 (3):545-581.

Add more citations

Similar books and articles

On Graph-Theoretic Fibring of Logics.A. Sernadas, C. Sernadas, J. Rasga & M. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1321-1357.
Importing Logics.João Rasga, Amílcar Sernadas & Cristina Sernadas - 2012 - Studia Logica 100 (3):545-581.
The Downward Transfer of Elementary Satisfiability of Partition Logics.Y. Chen & E. Shen - 2000 - Mathematical Logic Quarterly 46 (4):477-488.
On the Finiteness of the Recursive Chromatic Number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Twilight Graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Infinitary Logics and Very Sparse Random Graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
Many-Dimensional Arrow Logics.Dimiter Vakarelov - 1996 - Journal of Applied Non-Classical Logics 6 (4):303-345.
Forking and Dividing in Henson Graphs.Gabriel Conant - 2017 - Notre Dame Journal of Formal Logic 58 (4):555-566.
The Unrestricted Combination of Temporal Logic Systems.Marcelo Finger & M. Weiss - 2002 - Logic Journal of the IGPL 10 (2):165-189.
Fibring: Completeness Preservation.Alberto Zanardo, Amilcar Sernadas & Cristina Sernadas - 2001 - Journal of Symbolic Logic 66 (1):414-439.

Analytics

Added to PP index
2019-01-09

Total views
135 ( #71,941 of 2,411,653 )

Recent downloads (6 months)
23 ( #33,562 of 2,411,653 )

How can I increase my downloads?

Downloads

My notes