Degrees of categoricity and treeable degrees

DOI10.1142/S0219061324500028MaRDI QIDQ6649852FDOQ6649852

Dino Rossegger, Barbara Csima

Publication date: 6 December 2024

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

zbMATH Keywords

isomorphismsTuring degreescomputable structure theorydegrees of categoricity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Problem of the number of non-self-equivalent constructivizations
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of categoricity of computable structures
• Degrees that are not degrees of categoricity
• Effective procedures in field theory
• A Property of Arithmetic Sets
• Classical recursion theory. Vol. II
• Degrees that Are Low for Isomorphism
• Countable retracing functions and \(\Pi_2^0\) predicates
• DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION
• Degrees of categoricity above limit ordinals
• Finite computable dimension and degrees of categoricity
• Strength and Weakness in Computable Structure Theory
• Degrees of categoricity of rigid structures
• Strong degrees of categoricity and weak density
• Coding in the automorphism group of a computably categorical structure
• Every Δ20 degree is a strong degree of categoricity

This page was built for publication: Degrees of categoricity and treeable degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649852)