Importing Logics

The novel notion of importing logics is introduced, subsuming as special cases several kinds of asymmetric combination mechanisms, like temporalization [8, 9], modalization [7] and exogenous enrichment [13, 5, 12, 4, 1]. The graph-theoretic approach proposed in [15] is used, but formulas are identified with irreducible paths in the signature multi-graph instead of equivalence classes of such paths, facilitating proofs involving inductions on formulas. Importing is proved to be strongly conservative. Conservative results follow as corollaries for temporalization, modalization and exogenous enrichment.

[1]  M. Newman.  On Theories with a Combinatorial Definition of "Equivalence" , 1942 .

[2]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  Rohit Chadha,et al.  Extending Classical Logic for Reasoning About Quantum Systems , 2009 .

[4]  Marcelo Finger,et al.  The Unrestricted Combination of Temporal Logic Systems , 2002, Log. J. IGPL.

[5]  Burghard von Karger,et al.  Temporal algebra , 1998, Mathematical Structures in Computer Science.

[6]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[7]  P. Mateus,et al.  Exogenous Semantics Approach to Enriching Logics , 2005 .

[8]  Robert Goldblatt,et al.  Mathematical modal logic: A view of its evolution , 2003, J. Appl. Log..

[9]  Cristina Sernadas,et al.  Parameterisation of Logics , 1998, WADT.

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

[11]  Marcelo Finger,et al.  Non-normal Modalisation , 2002, Advances in Modal Logic.

[12]  Rohit Chadha,et al.  Reasoning about probabilistic sequential programs , 2007, Theor. Comput. Sci..

[13]  Amílcar Sernadas,et al.  Weakly complete axiomatization of exogenous quantum propositional logic , 2005, Inf. Comput..

[14]  Rajagopal Nagarajan,et al.  Exogenous Probabilistic Computation Tree Logic , 2007, QAPL.

[15]  Dov M. Gabbay,et al.  Adding a temporal dimension to a logic system , 1992, J. Log. Lang. Inf..

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

[17]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[18]  Yuri Gureoich.  Intuitionistic Logic , 2008 .