Permitting, forcing, and copying of a given recursive relation

DOI10.1016/S0168-0072(96)00011-5zbMATH Open0883.03029OpenAlexW2043188238MaRDI QIDQ1365246FDOQ1365246

Peter A. Cholak, C. J. Ash, J. F. Knight

Publication date: 14 October 1997

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(96)00011-5

zbMATH Keywords

forcingrecursive structureErshov's hierarchypermitting

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?)
• Title not available (Why is that?)
• Pairs of recursive structures
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• Some effects of Ash-Nerode and other decidability conditions on degree spectra
• Uncountable degree spectra

Cited In (9)

• Degree spectra of relations on computable structures in the presence of Δ₂⁰isomorphisms
• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
• Computable isomorphisms, degree spectra of relations, and Scott families
• Turing degrees of certain isomorphic images of computable relations
• Possible degrees in recursive copies. II
• Degree Spectra of Relations on Computable Structures
• Degree spectra of intrinsically c. e. relations
• Degree spectra of relations on structures of finite computable dimension
• Π₁⁰ classes and strong degree spectra of relations

This page was built for publication: Permitting, forcing, and copying of a given recursive relation

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