On Graph-theoretic Fibring of Logics

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.

[1]  Joseph Y. Halpern,et al.  Complete Axiomatizations for Reasoning about Knowledge and Time , 2002, SIAM J. Comput..

[2]  Jon Barwise,et al.  Logical reasoning with diagrams , 1996 .

[3]  João Rasga.  Sufficient conditions for cut elimination with complexity analysis , 2007, Ann. Pure Appl. Log..

[4]  J. A. Goguen,et al.  Completeness of many-sorted equational logic , 1981, SIGP.

[5]  G. Birkhoff,et al.  On the Structure of Abstract Algebras , 1935 .

[6]  Cristina Sernadas,et al.  Preservation of Interpolation Features by Fibring , 2008, J. Log. Comput..

[7]  Frank Wolter,et al.  Products of ‘transitive” modal logics , 2005, Journal of Symbolic Logic.

[8]  Joseph A. Goguen,et al.  Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3: Indexed Categories , 1991, Theor. Comput. Sci..

[9]  S. Lane.  Categories for the Working Mathematician , 1971 .

[10]  W. Carnielli,et al.  Logics of Formal Inconsistency , 2007 .

[11]  Cristina Sernadas,et al.  Fibring: completeness preservation , 2001, Journal of Symbolic Logic.

[12]  Arnon Avron,et al.  Non-deterministic Multiple-valued Structures , 2005, J. Log. Comput..

[13]  D. Gabbay,et al.  Many-Dimensional Modal Logics: Theory and Applications , 2003 .

[14]  Dov M. Gabbay,et al.  Interpolation and definability , 2005 .

[15]  Silvio Ghilardi,et al.  A comprehensive combination framework , 2008, TOCL.

[16]  Cristina Sernadas,et al.  A Graph-theoretic Account of Logics , 2009, J. Log. Comput..

[17]  Jaime Ramos,et al.  From Fibring to Cryptofibring. A Solution to the Collapsing Problem , 2007, Logica Universalis.

[18]  Janusz Czelakowski,et al.  Weakly Algebraizable Logics , 2000, J. Symb. Log..

[19]  Cristina Sernadas,et al.  Modulated Fibring and The Collapsing Problem , 2002, J. Symb. Log..

[20]  L. L. Maksimova,et al.  A method of proving interpolation in paraconsistent extensions of the minimal logic , 2007 .

[21]  J. Michael Dunn,et al.  Relevance Logic and Entailment , 1986 .

[22]  R. Sikorski,et al.  The mathematics of metamathematics , 1963 .

[23]  Dov M. Gabbay,et al.  Analysis and Synthesis of Logics: How to Cut and Paste Reasoning Systems , 2008 .

[24]  Frank Wolter,et al.  Spatial Logic + Temporal Logic = ? , 2007, Handbook of Spatial Logics.

[25]  Cristina Sernadas,et al.  Fibring of Logics as a Categorial Construction , 1999, J. Log. Comput..

[26]  Joseph A. Goguen,et al.  Some Fundamental Algebraic Tools for the Semantics of Computation. Part II: Signed and Abstract Theories , 1984, Theor. Comput. Sci..

[27]  Dov M. Gabbay,et al.  Value-based Argumentation Frameworks as Neural-symbolic Learning Systems , 2005, J. Log. Comput..

[28]  L. F. D. Cerro,et al.  Combining Classical and Intuitionistic Logic , 1996 .

[29]  Zohar Manna,et al.  The calculus of computation - decision procedures with applications to verification , 2007 .

[30]  H. Ono.  Substructural Logics and Residuated Lattices — an Introduction , 2003 .