Intrinsically \(\Sigma ^ 0_{\alpha}\) relations (Q1106203): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Leon Harkleroad / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Leon Harkleroad / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0168-0072(88)90014-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087519684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of recursive structures in arithmetical degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank

Latest revision as of 17:14, 18 June 2024

scientific article
Language Label Description Also known as
English
Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
scientific article

    Statements

    Intrinsically \(\Sigma ^ 0_{\alpha}\) relations (English)
    0 references
    0 references
    1988
    0 references
    A relation R on a recursive structure \({\mathfrak A}\) is called intrinsically \(\Sigma^ 0_{\alpha}\) if under every Gödel numbering of \({\mathfrak A}\) as a recursive structure, R is represented by a \(\Sigma^ 0_{\alpha}\) set. Ash and Nerode had found, under certain side conditions, a syntactic characterization of the intrinsically \(\Sigma^ 0_ 1\) relations on a structure. The present paper generalizes that result to an arbitrary constructive ordinal \(\alpha\). Several examples, many of them related to recursive orderings, are presented.
    0 references
    recursive structure
    0 references
    recursive orderings
    0 references

    Identifiers