Jumps of Orderings
From MaRDI portal
Publication:3484823
DOI10.2307/2001255zbMATH Open0705.03022OpenAlexW4253745744MaRDI QIDQ3484823FDOQ3484823
Authors: C. J. Ash, Carl G. jun. Jockusch, J. F. Knight 
Publication date: 1990
Full work available at URL: https://doi.org/10.2307/2001255
Recommendations
- Tackling the jump number of interval orders
- Degrees coded in jumps of orderings
- On minimizing jumps for ordered sets
- On minimizing the jump number for interval orders
- The jump number of suborders of the power set order
- The arboreal jump number of an order
- Orderings with αth Jump Degree 0 (α)
- On the height and jump number of ordered sets
- A refined analysis on the jump number problem of interval orders
- scientific article; zbMATH DE number 1558370
Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Generic copies of countable structures
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Pairs of recursive structures
- Degrees coded in jumps of orderings
- Transfinite extensions of Friedberg's completeness criterion
- Degrees of Structures
- Degrees of orderings not isomorphic to recursive linear orderings
- A metatheorem for constructions by finitely many workers
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (16)
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Constructions by transfinitely many workers
- Labelling systems and r.e. structures
- Recursive and r.e. quotient Boolean algebras
- Prime models of theories of computable linear orderings
- Computability on linear orderings enriched with predicates
- Title not available (Why is that?)
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
- Degrees coded in jumps of orderings
- Pairs of recursive structures
- Degrees of orderings not isomorphic to recursive linear orderings
- Least enumerations of unary partial structures
- Turing degrees of nonabelian groups
- Measuring complexities of classes of structures
- The jump operation for structure degrees
- Computable shuffle sums of ordinals
This page was built for publication: Jumps of Orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484823)
