# Inconsistency in a modal logic

I need a first order modal logic, where inconsistency between formulas in not binary: a pair of formulas may be more or less inconsistent. The modal operators express uncertainty. So the formulas which would be contradictory without the modal operators can have some "fuzzy" inconsistency with the modal operators. Did somebody encounter such a logic? If not, is there something wrong with such a logic?

• At a glance, it looks to me like this paper is about that idea, but only the propositional part of it, i.e., this paper doesn't handle predicate logic: sciencedirect.com/science/article/pii/S1570868304000497 Sorry if this isn't what you're looking for, or if that paper does not turn out to be useful.
– A.S.
Jul 23 at 21:41
• Actually, I meant two formulas having the same modality may have non binary consistency. Jul 23 at 21:53
• Say $\asymp \big(\varphi(x) = y \big)$ and $\asymp \big(\varphi(x) = z \big)$ may be more or less inconsistent depending on the difference $|y - z|.$ Jul 23 at 21:58
• This sounds more like probability than logic? E.g. maybe you want a belief network.
– none
Jul 23 at 23:35
• There are no probabilities. The modality I am talking about is interpreted as "it appears that". The only thing I care about is to evaluate inconsistency between atomic formulas with the same modality. Jul 24 at 0:02