Semantic trees: New foundations for automatic theorem-proving
dc.contributor.advisor
Meltzer, Bernard
en
dc.contributor.author
Hayes, Patrick J.
en
dc.date.accessioned
2013-11-11T16:14:23Z
dc.date.available
2013-11-11T16:14:23Z
dc.date.issued
1973
dc.description.abstract
This 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
dc.identifier.uri
http://hdl.handle.net/1842/8115
dc.language.iso
en
dc.publisher
The University of Edinburgh
en
dc.subject
computer science
en
dc.title
Semantic trees: New foundations for automatic theorem-proving
en
dc.type
Thesis or Dissertation
en
dc.type.qualificationlevel
Doctoral
en
dc.type.qualificationname
PhD Doctor of Philosophy
en
This item appears in the following Collection(s)