This is a preview. Log in through your library . Abstract We prove the following surprising property of Heyting's intuitionistic propositional calculus, IpC. Consider the collection of formulas, φ, ...
Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback