Defining totality in the enumeration degrees
From MaRDI portal
Recommendations
Cites work
- A criterion for completeness of degrees of unsolvability
- A jump inversion theorem for the enumeration jump
- A Note on ω-Jump Inversion of Degree Spectra of Structures
- Arithmetical Reducibilities I
- Array nonrecursiveness and relative recursive enumerability
- Cupping and definability in the local structure of the enumeration degrees
- Definability in the Turing degrees
- DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
- Definability via Kalimullin pairs in the structure of the enumeration degrees
- Degrees of Structures
- Degrees of unsolvability of continuous functions
- Domination, forcing, array nonrecursiveness and relative recursive enumerability
- Every Set has a Least Jump Enumeration
- scientific article; zbMATH DE number 3704806 (Why is no real title available?)
- scientific article; zbMATH DE number 46852 (Why is no real title available?)
- scientific article; zbMATH DE number 3503199 (Why is no real title available?)
- scientific article; zbMATH DE number 2039009 (Why is no real title available?)
- scientific article; zbMATH DE number 3264932 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 2237373 (Why is no real title available?)
- Jumps of quasi-minimal enumeration degrees
- Low level nondefinability results: domination and recursive enumeration
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Reducibility and Completeness for Sets of Integers
- Semirecursive Sets and Positive Reducibility
- The automorphism group of the enumeration degrees
- The jump operator on the \(\omega \)-enumeration degrees
Cited in
(21)- Computability theory. Abstracts from the workshop held January 7--13, 2018
- The theory of ceers computes true arithmetic
- The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees
- Characterizing the continuous degrees
- There exists a maximal 3-c.e. enumeration degree
- A note on initial segments of the enumeration degrees
- Enumeration reducibility and computable structure theory
- Complete enumeration: a search for wholeness
- scientific article; zbMATH DE number 1085970 (Why is no real title available?)
- Permutations of the integers induce only the trivial automorphism of the Turing degrees
- scientific article; zbMATH DE number 1421080 (Why is no real title available?)
- On cototality and the skip operator in the enumeration degrees
- A structural dichotomy in the enumeration degrees
- The enumeration degrees: local and global structural interactions
- On Kalimullin pairs
- Logical Approaches to Computational Barriers
- Theory and Applications of Models of Computation
- The relationship between local and global structure in the enumeration degrees
- PA RELATIVE TO AN ENUMERATION ORACLE
- THE TURING DEGREES AND KEISLER’S ORDER
- The singleton degrees of the \({\Sigma}_2^0\) sets are not dense
This page was built for publication: Defining totality in the enumeration degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741445)