dc.rights.license | In Copyright | en_US |
dc.creator | Berghel, William Wesley | |
dc.date.accessioned | 2023-04-21T19:15:43Z | |
dc.date.available | 2023-04-21T19:15:43Z | |
dc.date.created | 1983 | |
dc.identifier | WLURG038_Berghel_thesis_1983 | |
dc.identifier.uri | https://dspace.wlu.edu/handle/11021/36128 | |
dc.description.abstract | My goal is to write a theorem-proving assistant that can , to s ome extent, take a hypothesis (that works on IF-THEN rules) and make some progress toward a realizable goal. However, since I need a more concrete problem set, I
have restricted my goal to writing a program that might, when given minimal help by the user, be able to pass Mathematics 301, "Fundamental Concepts of Mathematics," with flying colors. So, this program should be able to perform some tasks with symbolic logic, as well as prove that, if x<y, then y>x. [From Introduction] | en_US |
dc.format.extent | 28 pages | en_US |
dc.language.iso | en_US | en_US |
dc.rights | This material is made available for use in research, teaching, and private study, pursuant to U.S. Copyright law. The user assumes full responsibility for any use of the materials, including but not limited to, infringement of copyright and publication rights of reproduced materials. Any materials used should be fully credited with the source. | en_US |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en_US |
dc.subject.other | Washington and Lee University -- Honors in Mathematics | en_US |
dc.title | An Elementary Theorem-Proving Program | |
dc.type | Text | en_US |
dcterms.isPartOf | WLURG38 - Student Papers | |
dc.rights.holder | Berghel, William Wesley | |
dc.subject.fast | Automatic theorem proving -- Computer programs | en_US |
dc.subject.fast | Logic, Symbolic and mathematical -- Computer programs | en_US |
local.department | Mathematics | en_US |
local.scholarshiptype | Honors Thesis | en_US |