Sciweavers

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

78

Voted

APAL
2006

75views more APAL 2006»

On self-embeddings of computable linear orderings

15 years 2 months ago

On self-embeddings of computable linear orderings

Download www.math.uiuc.edu

The Dushnik

Rodney G. Downey, Carl G. Jockusch Jr., Joseph S.

Real-time Traffic

APAL 2006 | DushnikMiller Theorem | Infinite Countable Linear | Nontrivial Self-embedding |

claim paper

Related Content

» An algorithm to compute Liouvillian solutions of prime order linear differencedifferential...

» Computable Linearizations of Wellpartialorderings

» Complexity of some Path Problems in DAGs and Linear Orders

» An Undecidable Linear Order That Is nDecidable for All n

» Linear SecondOrder Unification and Context Unification with TreeRegular Constraints

» Decidable Expansions of Labelled Linear Orderings

» Linear HigherOrder Matching Is NPComplete

» Linear Orderings of Random Geometric Graphs

» Logic and Rational Languages of Words Indexed by Linear Orderings

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	APAL
Authors	Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller

Comments (0)