Pages that link to "Item:Q3691653"
From MaRDI portal
The following pages link to Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers (Q3691653):
Displaying 46 items.
- Strong jump-traceability. II: \(K\)-triviality (Q375805) (← links)
- 2-minimality, jump classes and a note on natural definability (Q386644) (← links)
- Embedding and coding below a 1-generic degree (Q558421) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- Lowness for genericity (Q818521) (← links)
- Members of countable \(\Pi ^ 0_ 1\) classes (Q1084100) (← links)
- A non-inversion theorem for the jump operator (Q1111549) (← links)
- Ershov hierarchy and the T-jump (Q1120565) (← links)
- The \(n\)-rea enumeration degrees are dense (Q1204114) (← links)
- Jumps of certain classes of \(\Delta_ 2^ 0\)-sets (Q1308616) (← links)
- Splitting theorems in recursion theory (Q1314544) (← links)
- Iterated relative recursive enumerability (Q1344547) (← links)
- Turing degrees in refinements of the arithmetical hierarchy (Q1757652) (← links)
- Isolation in the CEA hierarchy (Q1766924) (← links)
- Initial segments of the degrees of size \(\aleph _ 1\) (Q1820153) (← links)
- Interpolating \(d\)-r.e. and REA degrees between r.e. degrees (Q1919759) (← links)
- Simple structures with complex symmetry (Q1957352) (← links)
- Turing computability: structural theory (Q2036465) (← links)
- Precomplete numberings (Q2036469) (← links)
- Turing reducibility in the fine hierarchy (Q2187259) (← links)
- \textit{CEA} operators and the ershov hierarchy (Q2234455) (← links)
- Nullifying randomness and genericity using symmetric difference (Q2358626) (← links)
- Elementary theories and structural properties of d-c.e. and n-c.e. degrees (Q2361673) (← links)
- Bounded low and high sets (Q2402957) (← links)
- A bounded jump for the bounded Turing degrees (Q2452680) (← links)
- Completing pseudojump operators (Q2570139) (← links)
- A splitting theorem for $n-REA$ degrees (Q2750871) (← links)
- Measure-theoretic applications of higher Demuth’s Theorem (Q2821688) (← links)
- Low Level Nondelegability Results: Domination and Recursive Enumeration (Q2869914) (← links)
- THE n-r.e. DEGREES: UNDECIDABILITY AND Σ<sub>1</sub> SUBSTRUCTURES (Q2909622) (← links)
- Degree Structures: Local and Global Investigations (Q3412461) (← links)
- The jump is definable in the structure of the degrees of unsolvability (Q3491536) (← links)
- Reals <i>n</i>-generic relative to some perfect tree (Q3503745) (← links)
- DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP (Q3521600) (← links)
- On the problem of the critical bound (Q4272259) (← links)
- Working below a high recursively enumerable degree (Q4276023) (← links)
- Boolean algebras, Stone spaces, and the iterated Turing jump (Q4323032) (← links)
- STRONG JUMP-TRACEABILITY (Q4580033) (← links)
- Decomposing Borel functions using the Shore–Slaman join theorem (Q4983474) (← links)
- Extending properly n - REA sets1 (Q5061390) (← links)
- HTP-COMPLETE RINGS OF RATIONAL NUMBERS (Q5070470) (← links)
- A fixed point for the jump operator on structures (Q5300071) (← links)
- Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond (Q5421031) (← links)
- Continuous randomness via transformations of 2-random sequences (Q6040663) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)
- Degrees of selector functions and relative computable categoricity (Q6634996) (← links)
