A systematic methodology for automated theorem finding
DOI10.1016/J.TCS.2014.06.028zbMATH Open1360.68749OpenAlexW2000227239MaRDI QIDQ744079FDOQ744079
Authors: Hongbiao Gao, Yuichi Goto, Jingde Cheng
Publication date: 6 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.028
Recommendations
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Mechanization of proofs and logical operations (03B35) Nonclassical and second-order set theories (03E70) First-order arithmetic and fragments (03F30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The problem of automated theorem finding
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding theorems in NBG set theory by automated forward deduction based on strong relevant logic
Cited In (3)
This page was built for publication: A systematic methodology for automated theorem finding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744079)