Hyperarithmetical Index Sets in Recursion Theory (Q3797173): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Hyperarithmetical Index Sets in Recursion Theory
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2000684 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4244460811 / rank
 
Normal rank
Property / title
 
Hyperarithmetical Index Sets in Recursion Theory (English)
Property / title: Hyperarithmetical Index Sets in Recursion Theory (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lattice of Recursively Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank

Latest revision as of 18:26, 18 June 2024

scientific article
Language Label Description Also known as
English
Hyperarithmetical Index Sets in Recursion Theory
scientific article

    Statements

    0 references
    0 references
    1987
    0 references
    0 references
    hyperhypersimple sets
    0 references
    index sets
    0 references
    hyperarithmetical hierarchy
    0 references
    quasimaximal sets
    0 references
    coinfinite r.e. sets
    0 references
    0 references
    Hyperarithmetical Index Sets in Recursion Theory (English)
    0 references