This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
August 1976 (vol. 25 no. 8)
pp. 852-862
C.G. Morgan, Department of Philosophy, University of Victoria
In this paper we outline two basic methods for automated theorem proving in nonclassical logics, including modal, many-valued, relevance, and intuitionistic logics. We discuss advantages and disadvantages of each method and give several illustrative examples. We outline a procedure for attacking more complex problems using a combination of the two basic methods. Results of experimental applications of the techniques are reported.
Index Terms:
Inductive logic, intuitionism, modal logic, relevance logic, theorem proving.
Citation:
C.G. Morgan, "Methods for Automated Theorem Proving in Nonclassical Logics," IEEE Transactions on Computers, vol. 25, no. 8, pp. 852-862, Aug. 1976, doi:10.1109/TC.1976.1674704
Usage of this product signifies your acceptance of the Terms of Use.