Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

ORDER
2007

favoriteEmaildiscussreport

79views more ORDER 2007»

Computable Linearizations of Well-partial-orderings

13 years 3 months ago

Computable Linearizations of Well-partial-orderings

Download www.math.uchicago.edu

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 ﬁnding such a linearization is not computably uniform, not even hyperarithmetically.

Antonio Montalbán

Real-time Traffic

Diana Schmidt | Linearization | Maximal Order Type | ORDER 2007 |

claim paper

Related Content

» Linear and NonLinear Detection for MIMOOFDM Systems with Linear Precoding and Spatial Corr...

» Motion From 3D Line Correspondences Linear and NonLinear Solutions

» Testing LinearInvariant NonLinear Properties

» On Camera Calibration with Linear Programming and Loop Constraint Linearization

» Musings around the geometry of interaction and coherence

» Computing Optimized Representations for Nonconvex Polyhedra by Detection and Removal of Re...

» Abstract Geometrical Computation and the Linear Blum Shub and Smale Model

» A computational stability analysis of discretetime piecewise linear systems

» Computational Interpretations of Classical Linear Logic

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	ORDER
Authors	Antonio Montalbán

Comments (0)