The Rank of Tree-Automatic Linear Orderings

Details The Rank of Tree-Automatic Linear Orderings The Rank of Tree-Automatic Linear Orderings

2012-04-13

arxiv.org/abs/1204.3048v1

Computer Science

Logic in Computer Science

20 pages, 3 figures

Scientific paper

We generalise Delhomm\'e's result that each tree-automatic ordinal is strictly below \omega^\omega^\omega{} by showing that any tree-automatic linear ordering has FC-rank strictly below \omega^\omega. We further investigate a restricted form of tree-automaticity and prove that every linear ordering which admits a tree-automatic presentation of branching complexity at most k has FC-rank strictly below \omega^k.

Affiliated with

Also associated with

No associations

Rating

The Rank of Tree-Automatic Linear Orderings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Rank of Tree-Automatic Linear Orderings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Rank of Tree-Automatic Linear Orderings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-144527