In this article, we propose a belief revision approach for families of (non-classical) logics whose semantics are first-order axiomatisable. Given any such (non-classical) logic , the approach enables the definition of belief revision operators for , in terms of a belief revision operation satisfying the postulates for revision theory proposed by Alchourrrdenfors and Makinson (AGM revision, Alchourrukasiewicz's many-valued logic. In addition, we present a general methodology to translate algebraic logics into classical logic. For the examples provided, we analyse in what (...) circumstances the properties of the AGM revision are preserved and discuss the advantages of the approach from both theoretical and practical viewpoints. (shrink)

We investigate the semantics of the logical systems obtained by introducing the modalities and into the family of substructural implication logics (including relevant, linear and intuitionistic implication). Then, in the spirit of the LDS (Labelled Deductive Systems) methodology, we "import" this semantics into the classical proof system KE. This leads to the formulation of a uniform labelled refutation system for the new logics which is a natural extension of a system for substructural implication developed by the first two authors in (...) a previous paper. (shrink)

We propose a family of Labelled Deductive Conditional Logic systems by defining a Labelled Deductive formalisation for the propositional conditional logics of normality proposed by Boutilier and Lamarre. By making use of the Compilation approach to Labelled Deductive Systems we define natural deduction rules for conditional logics and prove that our formalisation is a generalisation of the conditional logics of normality.