Article thumbnail

COMPUTABLE LINEARIZATIONS OF WELL-PARTIAL-ORDERINGS

By Antonio Montalbán

Abstract

We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results. De Jongh and Parikh showed that every well-partial-order has a linearization of maximal order type. We show that such a linearization can be found computably. We also show that the process of finding such a linearization is not computably uniform, not even hyperarithmetically

Year: 2007
DOI identifier: 10.1007/s11083-007-9058-0
OAI identifier: oai:CiteSeerX.psu:10.1.1.169.312
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.uchicago.edu/%... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.