The quantified extension of a canonical propositional intermediate logic is complete with respect to the generalization of Kripke semantics taking into consideration set-valued functors defined on a ...
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