In this paper we investigate AGM belief contraction operators by using the tools of algebraic logic. We generalize the notion of contraction to arbitrary finitary propositional logics, and we show… Click to show full abstract
In this paper we investigate AGM belief contraction operators by using the tools of algebraic logic. We generalize the notion of contraction to arbitrary finitary propositional logics, and we show how to switch from a syntactic-based approach to a semantic one. This allows to build a solid bridge between the validity of AGM postulates in a propositional logic and specific algebraic properties of its intended algebraic counterpart. Such a connection deserves particular attention when we deal with maxichoice contractions, as studied in the final part of the paper.
               
Click one of the above tabs to view related content.