Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.559609
Title: Types, rings, and games
Author: Chen, Wei
Awarding Body: University of Nottingham
Current Institution: University of Nottingham
Date of Award: 2012
Availability of Full Text:
Access from EThOS:
Access from Institution:
Abstract:
Algebraic equations on complex numbers and functional equations on generating functions are often used to solve combinatorial problems. But the introduction of common arithmetic operators such as subtraction and division always causes panic in the world of objects which are generated from constants by applying products and coproducts. Over the years, researchers have been endeavouring to interpretate some absurd calculations on objects which lead to meaningful combinatorial results. This thesis investigates connections between algebraic equations on complex numbers and isomorphisms of recursively defined objects. We are attempting to work out conditions under which isomorphisms between recursively defined objects can be decided by equalities between polynomials on multi-variables with integers as coefficients.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.559609  DOI: Not available
Keywords: QA150 Algebra
Share: