Proof-finding algorithms for classical and subclassical propositional logics
From MaRDI portal
Publication:1049689
DOI10.1215/00294527-2009-011zbMath1202.03024OpenAlexW1998289751MaRDI QIDQ1049689
R. M. Rizkalla, Martin W. Bunder
Publication date: 13 January 2010
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1215/00294527-2009-011
Mechanization of proofs and logical operations (03B35) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40)
This page was built for publication: Proof-finding algorithms for classical and subclassical propositional logics
