ADC method of proof search for intuitionistic propositional natural deduction

DOI10.1093/LOGCOM/EXT032MaRDI QIDQ2804335zbMATHOpenAlexFDO

Authors Sh. Steinert-Threlkeld, G. E. 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

intuitionistic logicnatural deductionpolynomial decidability

Mathematics Subject Classification ID

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

Recommendations

• Proof-Search in Natural Deduction Calculus for Classical Propositional Logic
• A proof-search procedure for intuitionistic propositional logic
• An alternative natural deduction for the intuitionistic propositional logic
• Goal-oriented proof-search in natural deduction for intuitionistic propositional logic
• A proof procedure for adaptive logics
• scientific article; zbMATH DE number 1348467
• Natural deduction for dual-intuitionistic logic
• Natural deduction and sequent calculus for intuitionistic relevant logic
• Natural deduction for intuitionistic linear logic
• scientific article; zbMATH DE number 970712

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804335)