Permitting, forcing, and copying of a given recursive relation
type: Item
instance of: scholarly article
title: Permitting, forcing, and copying of a given recursive relation
zbMATH Open document ID: 0883.03029
DOI: 10.1016/S0168-0072(96)00011-5
author: C. J. Ash
author: Peter A. Cholak
author: J. F. Knight
published in: Annals of Pure and Applied Logic
publication date: 1997-10-14T00:00:00Z
review text: Let \(\mathcal A\) be a recursive structure for a language \(L\) and \(R\) be a relation on \(\mathcal A\). The authors give conditions under which this relation can be made \(\alpha\)-r.e. in Ershov's hierarchy of \(\Delta^0_2\)-sets in an appropriate recursive copy of \(\mathcal A\).
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 03C57
zbMATH DE Number: 1054202
zbMATH Keywords: recursive structure
zbMATH Keywords: Ershov's hierarchy
zbMATH Keywords: forcing
zbMATH Keywords: permitting
reviewed by: Andrei S. Morozov
MaRDI profile type: Publication
cites work: Pairs of recursive structures
cites work: Q3919698
cites work: Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
cites work: Some effects of Ash-Nerode and other decidability conditions on degree spectra
cites work: Uncountable degree spectra
cites work: Q5573961
full work available at URL: s0168-0072(96)00011-5
OpenAlex ID: W2043188238
description: scientific article; zbMATH DE number 1054202