Paper detail

Automorphisms of the truth-table degrees are fixed on some cone

Let Dtt denote the set of truth-table degrees. A bijection p from Dtt to Dtt is an automorphism if for all truth-table degrees x and y we have x <=tt y if and only if p(x) <=tt p(y). We say an automorphism p is fixed on some cone if there is a degree b such that for all x >=tt b we have p(x) = x. We first prove that for every 2-generic real X we have X&#39; is not tt below X + 0&#39;. We next prove that for every real X >=tt 0&#39; there is a real Y such that Y + 0&#39; =tt Y&#39; =tt X. Finally, we use this to demonstrate that every automorphism of the truth-table degrees is fixed on some cone.

preprint2008arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.