We slightly improve on characterization results already in the literature for base revision. We show that consistency-based partial meet revision operators can be axiomatized for any sentential logic
satisfying finitarity and monotonicity conditions (neither the deduction theorem nor supraclassicality are required to hold in
). 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.