Return to search

Automated rewriting for higher categories and applications to quantum theory

The contribution of this thesis is a novel framework for rewriting in higher categories. Its theoretical foundation is the theory of quasistrict higher categories and the practical realisation is a proof assistant Globular. The framework introduces the notions of diagrams and signatures as new mutually-recursive structures that give the algebraic basis for the approach. These structures are related the notion of an n-polygraph, but allow reasoning about quasistrict higher categorical structures in a way amenable to computer implementation. Building on this, we propose a new definition of a quasistrict 4-category, and prove a result that in a quasistrict 4-category, an adjunction of 1-morphisms gives rise to a coherent adjunction satisfying the butterfly equations.

Identiferoai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:740809
Date January 2016
CreatorsBar, Krzysztof
ContributorsAbramsky, Samson ; Coecke, Bob
PublisherUniversity of Oxford
Source SetsEthos UK
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation
Sourcehttps://ora.ox.ac.uk/objects/uuid:ba1d3341-873d-4255-8400-c2277b7648f3

Page generated in 0.002 seconds