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 ...

Computability theory establishes which problems can in principle be solved by mechanical procedures, formalised by the Turing machine model and its equivalents. It draws a firm boundary between ...