Metarecursively enumerable sets and admissible ordinals (Q5528641): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Theorem on Hypersimple Sets / 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: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5631101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metarecursive sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3232283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post's Problem, Admissible Ordinals, and Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure-Theoretic Uniformity in Recursion Theory and Set Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees less than 0' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive well-orderings / rank
 
Normal rank

Latest revision as of 21:20, 11 June 2024

scientific article; zbMATH DE number 3241272
Language Label Description Also known as
English
Metarecursively enumerable sets and admissible ordinals
scientific article; zbMATH DE number 3241272

    Statements

    Identifiers