Abstract

We present a propositional logic for reasoning about higher-order upper and lower probabilities. The main technical result is the proof of decidability of the introduced logical system. We also show that the axiomatization for the corresponding logic without iterations of operators, which we developed in our previous work, is also complete for the new class of models presented in this paper.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call