Computing Maximal Chains
Published in arXiv (Cornell University) • Jan 20, 2012
NobleIDNI7P92W41R10S86
Authors:,,
Alberto Marcone
Antonio Montalbán
Richard A. Shore
Abstract
In 1967 Wolk proved that every well partial order (wpo) has a maximal chain; that is a chain of maximal order type. (Note that all chains in a wpo are well-ordered.) We prove that such maximal chain cannot be found computably, not even hyperarithmetically: No hyperarithmetic set can compute maximal ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!