We address the problem of proof-search in the natural deduction calculus for Classical propositional logic. Our aim is to improve the usual na¨ıve proof-search procedure where introduction rules are applied upwards and elimination rules downwards. In particular, we introduce Ncr, a variant of the usual natural deduction calculus for Classical propositional logic, and we show that it can be used as a base for a proof-search procedure which does not require backtracking nor loop-checking.
CITATION STYLE
Ferrari, M., & Fiorentini, C. (2015). Proof-search in natural deduction calculus for classical propositional logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9323, pp. 237–252). Springer Verlag. https://doi.org/10.1007/978-3-319-24312-2_17
Mendeley helps you to discover research relevant for your work.