The Block Relation in Computable Linear Orders

Details The Block Relation in Computable Linear Orders The Block Relation in Computable Linear Orders

2009-04-28

arxiv.org/abs/0904.4286v1

Mathematics

Logic

Scientific paper

A block in a linear order is an equivalence class when factored by the block relation B(x,y), satisfied by elements that are finitely far apart. We show that every computable linear order with dense condensation-type (i.e. a dense collection of blocks) but no infinite, strongly \eta-like interval (i.e. with all blocks of size less than some fixed, finite k) has a computable copy with the non-block relation \neg B(x,y) computably enumerable. This implies that every computable linear order has a computable copy with a computable non-trivial self-embedding, and that the long-standing conjecture characterizing those computable linear orders every computable copy of which has a computable non-trivial self-embedding (as precisely those that contain an infinite, strongly \eta-like interval) holds for all linear orders with dense condensation-type.

Affiliated with

Also associated with

No associations

Rating

The Block Relation in Computable Linear Orders 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 Block Relation in Computable Linear Orders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Block Relation in Computable Linear Orders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-712637