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 ...
We investigate and classify the notion of final derivability of two basic inconsistency-adaptive logics. Specifically, the maximal complexity of the set of final consequences of decidable sets of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback