ADC method of proof search for intuitionistic propositional natural deduction

DOI10.1093/LOGCOM/EXT032zbMath1444.03160OpenAlexW2028154605MaRDI QIDQ2804335

Shane Steinert-Threlkeld, Grigori Mints

Publication date: 28 April 2016

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/ext032

zbMATH Keywords

natural deductionintuitionistic logicpolynomial decidability

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Proof theory in general (including proof-theoretic semantics) (03F03) Subsystems of classical logic (including intuitionistic logic) (03B20) Complexity of proofs (03F20)

Related Items (1)

Goal-oriented proof-search in natural deduction for intuitionistic propositional logic

This page was built for publication: ADC method of proof search for intuitionistic propositional natural deduction