Computably extendible order types
In this thesis we consider, from a computability perspective, the question of what order-theoretic properties of a partial order can be preserved under linear extension. It is well-known that such properties as well-foundedness or scatteredness can be preserved, that is, given any well-founded parti...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of Leeds
2016
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.694112 |