Finding theorems in NBG set theory by automated forward deduction based on strong relevant logic

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Automated theorem finding is one of 33 basic research problems in automated reasoning which was originally proposed by Wos in 1988, and it is still an open problem. For the problem, Cheng has proposed a forward deduction approach based on strong relevant logic. To verify the effectiveness of the approach, we tried to rediscover already known theorems in NBG set theory by using the approach, and succeeded in rediscovery of several known theorems. However, the method of the rediscovery is ad hoc, but not systematic. This paper gives an analysis and discussion for our experiment method and results from the viewpoint of the systematic method. The paper also presents some issues and future research directions for a systematic method of automated theorem finding based on Cheng's approach. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gao, H., Shi, K., Goto, Y., & Cheng, J. (2013). Finding theorems in NBG set theory by automated forward deduction based on strong relevant logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7936 LNCS, pp. 697–704). https://doi.org/10.1007/978-3-642-38768-5_62

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free