Intrinsically \(\Sigma ^ 0_{\alpha}\) relations

DOI10.1016/0168-0072(88)90014-0zbMath0651.03034OpenAlexW2087519684MaRDI QIDQ1106203

S. H. Smith

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0168-0072(88)90014-0

zbMATH Keywords

recursive structurerecursive orderings

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (21)

Degree spectra of relations on structures of finite computable dimension ⋮ Inseparability in recursive copies ⋮ Intrinsically recursively enumerable subalgebras of a recursive Boolean algebra ⋮ Ramified systems ⋮ Back and forth relations for reduced abelian \(p\)-groups ⋮ Π₁¹ relations and paths through ⋮ Permitting, forcing, and copying of a given recursive relation ⋮ Possible degrees in recursive copies. II ⋮ Generic copies of countable structures ⋮ Mixed systems ⋮ Labelling systems and r.e. structures ⋮ Uncountable degree spectra ⋮ Degree Spectra of Relations on a Cone ⋮ Degree spectra of intrinsically c.e. relations ⋮ Π₁⁰ classes and strong degree spectra of relations ⋮ Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees ⋮ Categoricity in hyperarithmetical degrees ⋮ Turing degrees of certain isomorphic images of computable relations ⋮ Coding a family of sets ⋮ Enumerations in computable structure theory ⋮ Degree Spectra of Relations on Computable Structures

Cites Work

• Stability of recursive structures in arithmetical degrees
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Unnamed Item
• Unnamed Item

This page was built for publication: Intrinsically \(\Sigma ^ 0_{\alpha}\) relations