Fibring Labelled Deduction Systems

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of logic and computation 2002-06, Vol.12 (3), p.443-473
Main Authors: Rasga, João, Sernadas, Amílcar, Sernadas, Cristina, Viganò, Luca
Format: Article
Language:English
Subjects:
category theory
Fibring of logics
general semantics
labelled deduction systems
natural deduction
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0955-792X
1465-363X
DOI:10.1093/logcom/12.3.443