Metarecursively enumerable sets and their metadegrees (Q5614653): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.2307/2270325 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092093189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems on the degrees of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metarecursively enumerable sets and admissible ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximal set which is not complete / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:56, 12 June 2024

scientific article; zbMATH DE number 3337661
Language Label Description Also known as
English
Metarecursively enumerable sets and their metadegrees
scientific article; zbMATH DE number 3337661

    Statements

    Identifiers