Degrees of categoricity of trees and the isomorphism problem

DOI10.1002/malq.201700049OpenAlexW2980681923MaRDI QIDQ5108865

Mohammad Assem Mahmoud

Publication date: 6 May 2020

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201700049

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Cites Work

• Unnamed Item
• Degrees that are not degrees of categoricity
• The isomorphism problem for classes of computable fields
• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
• Computable structures and the hyperarithmetical hierarchy
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of categoricity vs. strong degrees of categoricity
• Degrees of categoricity for superatomic Boolean algebras
• Degrees of categoricity of computable structures
• Turing Computability
• Computable categoricity of trees of finite height
• d-computable categoricity for algebraic fields
• DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS
• Categoricity spectra for rigid structures

This page was built for publication: Degrees of categoricity of trees and the isomorphism problem