The following pages link to Notes on the Jump of a Structure (Q3576069):
Displaying 21 items.
- Cuts of linear orders (Q651418) (← links)
- On a computable presentation of low linear orderings (Q669557) (← links)
- Jump inversions of algebraic structures and the \({\Sigma}\)-definability (Q1620784) (← links)
- Computable linear orders and the Ershov hierarchy (Q1746441) (← links)
- Coding and definability in computable structures (Q1782235) (← links)
- Computable presentability of countable linear orders (Q2036473) (← links)
- Computable linear orders and the ershov hierarchy (Q2112325) (← links)
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders (Q2172889) (← links)
- Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey (Q2970964) (← links)
- Enumeration Reducibility and Computable Structure Theory (Q2970965) (← links)
- Boolean algebra approximations (Q3190798) (← links)
- Degree Spectra of Relations on a Cone (Q4645836) (← links)
- (Q4993818) (← links)
- Jump inversions of algebraic structures and Σ‐definability (Q5108844) (← links)
- CODING IN GRAPHS AND LINEAR ORDERINGS (Q5148104) (← links)
- On Processes and Structures (Q5326386) (← links)
- COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY (Q5738191) (← links)
- Punctual 1-linear orders (Q6059288) (← links)
- EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER (Q6095975) (← links)
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES (Q6123581) (← links)
- Families of permutations and ideals of Turing degrees (Q6148009) (← links)