Turing degrees of hypersimple relations on computable structures

DOI10.1016/S0168-0072(02)00113-6zbMath1031.03063OpenAlexW1997511412MaRDI QIDQ1399102

Valentina S. Harizanov

Publication date: 30 July 2003

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

Full work available at URL: https://doi.org/10.1016/s0168-0072(02)00113-6

zbMATH Keywords

computable structureTuring degreehypersimple relation

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Recursive properties of relations on models
• Some effects of Ash-Nerode and other decidability conditions on degree spectra
• Quasi-simple relations in copies of a given recursive structure
• Simple and immune relations on countable structures
• Recursive isomorphism types of recursive Boolean algebras
• Recursively enumerable vector spaces
• Semirecursive Sets and Positive Reducibility
• A Theorem on Hypersimple Sets
• Recursively enumerable sets of positive integers and their decision problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item