Show simple item record

dc.contributor.author Kortink, Mark
dc.date.accessioned 2011-06-21T01:55:56Z
dc.date.accessioned 2022-10-26T21:06:11Z
dc.date.available 2011-06-21T01:55:56Z
dc.date.available 2022-10-26T21:06:11Z
dc.date.copyright 1983
dc.date.issued 1983
dc.identifier.uri https://ir.wgtn.ac.nz/handle/123456789/24918
dc.description.abstract It is a common phenomenon in Mathematics that once a logic has been created one can extract from it a species of algebras that mimic the behaviour of the logic. For example, Boolean algebra comes from propositional logic, cylindric algebra comes from first order logic, and dynamic algebra comes from dynamic logic. In Rob Goldblatt's book "Axiomatizing the Logic of Computer Programming" a series of new logics has been created. This thesis extracts two new species of algebras from two of the logics in this book, namely command modules and L-command modules. The thesis is then concerned with proving representation theorems for these algebras and relating these theorems back to the completeness theorems for the original parent logics. en_NZ
dc.format pdf en_NZ
dc.language en_NZ
dc.language.iso en_NZ
dc.publisher Te Herenga Waka—Victoria University of Wellington en_NZ
dc.title Command algebra en_NZ
dc.type Text en_NZ
vuwschema.type.vuw Awarded Research Masters Thesis en_NZ
thesis.degree.discipline Mathematics en_NZ
thesis.degree.grantor Te Herenga Waka—Victoria University of Wellington en_NZ
thesis.degree.level Masters en_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account