Jumps of Orderings

DOI10.2307/2001255zbMath0705.03022OpenAlexW4253745744MaRDI QIDQ3484823

C. J. Ash, Carl G. jun. Jockusch, Julia F. Knight

Publication date: 1990

Full work available at URL: https://doi.org/10.2307/2001255

zbMATH Keywords

Turing degreelinear orderingrecursive ordinaljumps of degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items (14)

The jump operation for structure degrees ⋮ Turing degrees of nonabelian groups ⋮ Unnamed Item ⋮ Computability on linear orderings enriched with predicates ⋮ Pairs of recursive structures ⋮ Labelling systems and r.e. structures ⋮ Constructions by transfinitely many workers ⋮ Prime models of theories of computable linear orderings ⋮ Computable shuffle sums of ordinals ⋮ Measuring complexities of classes of structures ⋮ TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS ⋮ Every Low Boolean Algebra is Isomorphic to a Recursive One ⋮ Degrees of orderings not isomorphic to recursive linear orderings ⋮ Recursive and r.e. quotient Boolean algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Degrees of orderings not isomorphic to recursive linear orderings
• Pairs of recursive structures
• Generic copies of countable structures
• A metatheorem for constructions by finitely many workers
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Degrees coded in jumps of orderings
• Transfinite extensions of Friedberg's completeness criterion
• Degrees of Structures

This page was built for publication: Jumps of Orderings