Recognition: unknown
Automorphisms of the truth-table degrees are fixed on some cone
read the original abstract
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' is not tt below X + 0'. We next prove that for every real X >=tt 0' there is a real Y such that Y + 0' =tt Y' =tt X. Finally, we use this to demonstrate that every automorphism of the truth-table degrees is fixed on some cone.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Krylov Distribution and Universal Convergence of Quantum Fisher Information
A spectral-resolvent Krylov framework defines a distribution for quantum Fisher information and identifies universal exponential or algebraic convergence regimes based on the Liouville spectrum.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.