Show simple item record

dc.contributor.authorGlanfield, Joel.en_US
dc.date.accessioned2010-02-16T15:46:03Z
dc.date.available2010-02-16T15:46:03Z
dc.date.issued2008-02-16T15:46:03Z
dc.identifier.urihttp://hdl.handle.net/10464/2928
dc.description.abstractWe provide an algorithm that automatically derives many provable theorems in the equational theory of allegories. This was accomplished by noticing properties of an existing decision algorithm that could be extended to provide a derivation in addition to a decision certificate. We also suggest improvements and corrections to previous research in order to motivate further work on a complete derivation mechanism. The results presented here are significant for those interested in relational theories, since we essentially have a subtheory where automatic proof-generation is possible. This is also relevant to program verification since relations are well-suited to describe the behaviour of computer programs. It is likely that extensions of the theory of allegories are also decidable and possibly suitable for further expansions of the algorithm presented here.en_US
dc.language.isoengen_US
dc.publisherBrock Universityen_US
dc.subjectAllegories (Mathematics)en_US
dc.subjectComputer algorithms.en_US
dc.titleTowards automated derivation in the theory of allegoriesen_US
dc.typeElectronic Thesis or Dissertationen_US
dc.degree.nameM.Sc. Computer Scienceen_US
dc.degree.levelMastersen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.degree.disciplineFaculty of Mathematics and Scienceen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record