Show simple item record

dc.contributor.advisorMeltzer, Bernard
dc.contributor.authorHayes, Patrick J.
dc.date.accessioned2013-11-11T16:14:23Z
dc.date.available2013-11-11T16:14:23Z
dc.date.issued1973
dc.identifier.urihttp://hdl.handle.net/1842/8115
dc.description.abstractThis dissertation is concerned with theorem-proving by computer. It does not contain a great number of new results, in the sense of new computational devices for improving the efficiency of theorem-proving programs. Rather it is intended as an account of a new approach to the fundamentals of the subject. It is a work, in the main, of consolidation and entrenchment rather than of extension. Accordingly, rather a large fraction of the total is devoted to an examination - a re-examination in fact, since there have been others before me - of the ideas and presuppositions underlying theorem-proving, and an attempt to uncover the underlying reasons why certain ideas - notably that of search - have arisen so consistently in the history of the -" subject.en_US
dc.language.isoenen_US
dc.publisherThe University of Edinburghen_US
dc.subjectcomputer scienceen_US
dc.titleSemantic trees: New foundations for automatic theorem-provingen_US
dc.typeThesis or Dissertationen_US
dc.type.qualificationlevelDoctoralen_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US


Files in this item

This item appears in the following Collection(s)

Show simple item record