STRUCTURAL HIGHNESS NOTIONS

DOI10.1017/jsl.2022.35arXiv2109.07619OpenAlexW3199451800MaRDI QIDQ6140191

Wesley Calvert, Dan Turetsky, Johanna N. Y. Franklin

Publication date: 22 December 2023

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.07619

zbMATH Keywords

degree high for isomorphismdegree high for isomorphism for Harrison ordersdegree high for pathsdegree highness for descending sequencesHarrison orderjump complete degreeScott complete degree

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable structures and the hyperarithmetical hierarchy
• Recursion theory. Computational aspects of definability
• Notions of weak genericity
• A degree-theoretic definition of the ramified analytical hierarchy
• Recursiveness in Π 1 1 Paths Through | mathscrO
• Lowness for isomorphism and degrees of genericity
• Lowness for isomorphism, countable ideals, and computable traceability
• Degrees of and lowness for isometric isomorphism
• Degrees that Are Low for Isomorphism
• Relativizations of randomness and genericity notions
• Taking the path computably traveled
• Higher Recursion Theory
• Π₁¹ relations and paths through
• Isomorphism relations on computable structures
• Computable trees of Scott rank ω₁^CK, and computable approximation
• The Friedberg-Muchnik Theorem Re-Examined

This page was built for publication: STRUCTURAL HIGHNESS NOTIONS