Journal of Logic and Computation 19 (6):1321-1357 (2009)

Authors
Marcelo E. Coniglio
University of Campinas
Abstract
A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems is an m-graph whose nodes are language expressions and the m-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided.
Keywords Combination of logics  fibring  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

Fibring: Completeness Preservation.Alberto Zanardo, Amilcar Sernadas & Cristina Sernadas - 2001 - Journal of Symbolic Logic 66 (1):414-439.
Sufficient Conditions for Cut Elimination with Complexity Analysis.João Rasga - 2007 - Annals of Pure and Applied Logic 149 (1-3):81-99.

Add more references

Citations of this work BETA

Combining Logics.Walter Carnielli & Marcelo E. Coniglio - 2008 - Stanford Encyclopedia of Philosophy.

Add more citations

Similar books and articles

Importing Logics.João Rasga, Amílcar Sernadas & Cristina Sernadas - 2012 - Studia Logica 100 (3):545-581.
Dov M. Gabbay, Fibring Logics.A. Sernadas - 2000 - Journal of Logic Language and Information 9 (4):511-513.
Fibring Logics, Dov M. Gabbay.Amílcar Sernadas - 2000 - Journal of Logic, Language and Information 9 (4):511-513.
Fibring Logics.Dov M. Gabbay - 1999 - Clarendon Press.
Graph-Theoretic Models of Dispositional Structures.Matthew Tugby - 2013 - International Studies in the Philosophy of Science 27 (1):23-39.

Analytics

Added to PP index
2014-03-12

Total views
57 ( #180,788 of 2,433,130 )

Recent downloads (6 months)
6 ( #114,871 of 2,433,130 )

How can I increase my downloads?

Downloads

My notes