Measuring complexities of classes of structures

DOI10.1016/J.APAL.2015.08.001zbMath1432.03077OpenAlexW1883221139MaRDI QIDQ499081

Barbara F. Csima, Carolyn Knoll

Publication date: 29 September 2015

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2015.08.001

zbMATH Keywords

linear orderingsback-and-forth relationcomputable structure theoryjump degreeTuring ordinal

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)

Related Items (1)

The property “arithmetic-is-recursive” on a cone

Cites Work

• Unnamed Item
• Unnamed Item
• Pairs of recursive structures
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Coding and definability in computable structures
• Counting the back-and-forth types
• Jumps of Orderings
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Degrees coded in jumps of orderings
• Transfinite extensions of Friedberg's completeness criterion
• Boolean algebras, Stone spaces, and the iterated Turing jump
• Degrees of Structures
• Turing degrees of isomorphism types of algebraic objects
• Arithmetical Reducibilities I

This page was built for publication: Measuring complexities of classes of structures