The Complexity of Non-Iterated Probabilistic Justification Logic

Ioannis Kokkinis

The logic PJ is a probabilistic logic defined by adding (non-iterated) probability operators to the basic justification logic J. In this paper we establish upper and lower bounds f…