Proof complexity investigates the inherent difficulty of demonstrating that a given propositional formula is unsatisfiable. By analysing measures such as proof length, size, width and degree across ...
This is a preview. Log in through your library . Abstract THINKER is an automated natural deduction first-order theorem proving program. This paper reports on how it was adapted so as to prove ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results