St Andrews Research Repository

St Andrews University Home
View Item 
  •   St Andrews Research Repository
  • Mathematics & Statistics (School of)
  • Mathematics & Statistics Theses
  • View Item
  •   St Andrews Research Repository
  • Mathematics & Statistics (School of)
  • Mathematics & Statistics Theses
  • View Item
  •   St Andrews Research Repository
  • Mathematics & Statistics (School of)
  • Mathematics & Statistics Theses
  • View Item
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.

Normalisation techniques in proof theory and category theory

Thumbnail
View/Open
TaherHamzaPhDThesis.pdf (22.01Mb)
Date
1986
Author
Hamza, Taher Tawfik Ahmed
Supervisor
Dyckhoff, Roy
Funder
Egypt (Government)
Metadata
Show full item record
Altmetrics Handle Statistics
Abstract
The word problem for the free categories with some structure generated by a category X can be solved using proof-theoretical means. These free categories give a semantics in which derivations of GENTZEN's propositional sequent calculus can be interpreted by means of arrows of those categories. In this thesis we describe, implement and document the cut-elimination and the normalization techniques in proof theory as outlined in SZABO [1978]: we show how these are used in order to solve, mechanically, the word problem for the free categories with structure of : cartesian, bicartesian, distributive bicartesian, cartesian closed, and bicartesian closed. This implementation is extended by a procedure to interpret intuitionistic propositional sequent derivations as arrows of the above categories. Implementation of those techniques has forced us to modify the techniques in various inessential ways. The description and the representation in the syntax of our implementation of the above categories is contained in chapters 1 - 5, where each chapter describes one theory and concludes with examples of the system In use to represent concepts and solve simple word problems from category theory ( of various typos ). Appendix 1 contains some apparent printing errors we have observed in the work done by SZABO. The algorithms used in the proof of the cut-elimination theorems and normalization through chapters 1 - 5 are collected in appendices 2 - 4. Appendices 5 - 8 concern the implementation and its user manual.
Type
Thesis, PhD Doctor of Philosophy
Collections
  • Mathematics & Statistics Theses
URI
http://hdl.handle.net/10023/13371

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

Advanced Search

Browse

All of RepositoryCommunities & CollectionsBy Issue DateNamesTitlesSubjectsClassificationTypeFunderThis CollectionBy Issue DateNamesTitlesSubjectsClassificationTypeFunder

My Account

Login

Open Access

To find out how you can benefit from open access to research, see our library web pages and Open Access blog. For open access help contact: openaccess@st-andrews.ac.uk.

Accessibility

Read our Accessibility statement.

How to submit research papers

The full text of research papers can be submitted to the repository via Pure, the University's research information system. For help see our guide: How to deposit in Pure.

Electronic thesis deposit

Help with deposit.

Repository help

For repository help contact: Digital-Repository@st-andrews.ac.uk.

Give Feedback

Cookie policy

This site may use cookies. Please see Terms and Conditions.

Usage statistics

COUNTER-compliant statistics on downloads from the repository are available from the IRUS-UK Service. Contact us for information.

© University of St Andrews Library

University of St Andrews is a charity registered in Scotland, No SC013532.

  • Facebook
  • Twitter