© 2002 by Oxford University Press
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Original Article |
Fibring Labelled Deduction Systems
1 CMA, Departamento de Matemática, IST, Av. Rovisco Pais, 1049-001 Lisbon, Portugal. E-mail: {jfr,acs,css}@math.ist.utl.pt 2 Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Georges-Köhler-Allee 52, D-79110 Freiburg, Germany. E-mail: luca@informatik.uni-freiburg.de
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.
Keywords: Fibring of logics; labelled deduction systems; natural deduction; general semantics; category theory
Received 1 June 2000.
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
L. Cruz-Filipe, A. Sernadas, and C. Sernadas Heterogeneous Fibring of Deductive Systems Via Abstract Proof Systems Logic Jnl IGPL, April 1, 2008; 16(2): 121 - 153. [Abstract] [PDF] |
||||
![]() |
W. Carnielli, J. Rasga, and C. Sernadas Preservation of Interpolation Features by Fibring J Logic Computation, February 1, 2008; 18(1): 123 - 151. [Abstract] [PDF] |
||||

