Permitting, forcing, and copying of a given recursive relation (Q1365246)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1054202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Permitting, forcing, and copying of a given recursive relation |
scientific article; zbMATH DE number 1054202 |
Statements
Permitting, forcing, and copying of a given recursive relation (English)
0 references
14 October 1997
0 references
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\).
0 references
recursive structure
0 references
Ershov's hierarchy
0 references
forcing
0 references
permitting
0 references
0.8243364095687866
0 references
0.7882949113845825
0 references
0.7806658744812012
0 references
