Admissibility, compatibility, and deducibility in first-order sequent logics
暂无分享,去创建一个
[1] Jean H. Gallier,et al. Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .
[2] Konstantin Verchinine,et al. System for Automated Deduction (SAD): Linguistic and Deductive Peculiarities , 2002, Intelligent Information Systems.
[3] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[4] Boris Konev,et al. Tableau Method with Free Variables for Intuitionistic Logic , 2006, Intelligent Information Systems.
[5] Lincoln A. Wallen,et al. Automated proof search in non-classical logics - efficient matrix proof methods for modal and intuitionistic logics , 1990, MIT Press series in artificial intelligence.
[6] Alexander V. Lyaletski,et al. On the EA-style integrated processing of self-contained mathematical texts , 2001 .
[7] Hiroakira Ono,et al. Proof-Theoretic Methods in Nonclassical Logic --an Introduction , 1998 .
[8] S. Lindström,et al. A Simplified Proof Method for Elementary Logic , 2001 .
[9] Konstantin Verchinine,et al. System for Automated Deduction (SAD): A Tool for Proof Verification , 2007, CADE.
[10] Alexander V. Lyaletski,et al. Evidence Algorithm and Sequent Logical Inference Search , 1999, LPAR.
[11] Konstantin Verchinine,et al. Evidence algorithm and system for automated deduction: a retrospective view , 2010, AISC'10/MKM'10/Calculemus'10.