We consider extending the modal logic KD45, commonly taken as the baseline system for belief, with propositional quantifiers that can be used to formalize natural language sentences such as ...
This is a preview. Log in through your library . Abstract We prove that the problem of determining the minimum propositional proof length is NP- hard to approximate within a factor of 2 log 1 - o(1) n ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback