Abstract:

Fibring Labelled Deduction Systems

João Rasga and Amílcar Sernadas and Cristina Sernadas and Luca Viganò


We give a categorial characterization of how labelled deduction systems for logics with a propositional basis 
behave under unconstrained fibring and under fibring that is constrained by symbol sharing. At the semantic 
level, we introduce a general semantics for our systems and then give a categorial characterization of fibring 
of models. 

Based on this, we establish the conditions under which our systems are sound and complete with respect to 
the general semantics for the corresponding logics, and establish requirements on logics and systems so that 
completeness is preserved by both forms of fibring.