Permutations of the integers induce only the trivial automorphism of the Turing degrees

DOI10.1017/BSL.2018.15MaRDI QIDQ4580034zbMATH OpenOpenAlexFDO

Authors Bjørn Kjos-Hanssen

Publication date 13 August 2018

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.00525

zbMATH Keywords

computabilitygroup of automorphismorder theorypermutation groupTuring degree

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Recommendations

• Permutations of the integers induce only the trivial automorphism of the Turing degrees
• Permutations and Presentations
• Automorphisms in the PTIME-Turing degrees of recursive sets
• The ^0_2 Turing degrees: automorphisms and definability
• scientific article; zbMATH DE number 66485

Cites work

• A Rigid Cone in the Truth-Table Degrees with Jump
• Applications of Effective Probability Theory to Martin-Löf Randomness
• Automata Studies. (AM-34)
• Automorphisms in the PTIME-Turing degrees of recursive sets
• Automorphisms of the truth-table degrees are fixed on a cone
• Conditional measures and conditional expectation; Rohlin's disintegration theorem
• Constructive Analogues of the Group of Permutations of the Natural Numbers
• Defining totality in the enumeration degrees
• Degrees of Unsolvability. (AM-55)
• Fixed points of jump preserving automorphisms of degrees
• scientific article; zbMATH DE number 5504384 (Why is no real title available?)
• scientific article; zbMATH DE number 3977006 (Why is no real title available?)
• scientific article; zbMATH DE number 3532932 (Why is no real title available?)
• scientific article; zbMATH DE number 3532933 (Why is no real title available?)
• scientific article; zbMATH DE number 3280855 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Layerwise computability and image randomness
• Permutations of the integers induce only the trivial automorphism of the Turing degrees
• Reducibility orderings: Theories, definability and automorphisms
• Rigidity and biinterpretability in the hyperdegrees
• Strong reductions in effective randomness
• The existence of measures of a given cocycle, I: atomless, ergodic σ-finite measures
• The probability distribution as a computational resource for randomness testing

Cited in

(2)

• Permutations of the integers induce only the trivial automorphism of the Turing degrees
• Permutations and Presentations

This page was built for publication: Permutations of the integers induce only the trivial automorphism of the Turing degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580034)