The following pages link to Jumps of Orderings (Q3484823):
Displayed 14 items.
- Computability on linear orderings enriched with predicates (Q431704) (← links)
- Measuring complexities of classes of structures (Q499081) (← links)
- Degrees of orderings not isomorphic to recursive linear orderings (Q810503) (← links)
- The jump operation for structure degrees (Q818923) (← links)
- Pairs of recursive structures (Q923075) (← links)
- Labelling systems and r.e. structures (Q923076) (← links)
- Constructions by transfinitely many workers (Q923078) (← links)
- Computable shuffle sums of ordinals (Q938232) (← links)
- Recursive and r.e. quotient Boolean algebras (Q1325051) (← links)
- Prime models of theories of computable linear orderings (Q2723507) (← links)
- Every Low Boolean Algebra is Isomorphic to a Recursive One (Q4318310) (← links)
- (Q4993800) (← links)
- Turing degrees of nonabelian groups (Q5295123) (← links)
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS (Q5738187) (← links)