We slightly improve on characterization results already in the literature for base revision. We show that in order to axiomatically characterize revision operators in a logic the only conditions this logic is required to satisfy are: finitarity and monotonicity. A characterization of limiting cases of revision operators, full meet and maxichoice, is also offered. In the second part of the paper, as a particular case, we focus on the class of graded fuzzy logics and distinguish two types of bases, naturally arising in that context, exhibiting different behavior.
Links:
[1] http://www.iiia.csic.es/en/individual/pere-pardo
[2] http://www.iiia.csic.es/en/individual/pilar-dellunde
[3] http://www.iiia.csic.es/en/individual/lluis-godo
[4] http://www.iiia.csic.es/en/publications/export/tagged/3604
[5] http://www.iiia.csic.es/en/publications/export/xml/3604
[6] http://www.iiia.csic.es/en/publications/export/bib/3604
[7] http://www.iiia.csic.es/en/project/at
[8] http://www.iiia.csic.es/en/project/locomotion-0