Complete Recursively Enumerable Sets (Q5536627): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: Completeness, the Recursion Theorem, and Effectively Simple Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Creative sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Effectively Simple Sets / rank | |||
Normal rank | |||
Latest revision as of 21:43, 11 June 2024
scientific article; zbMATH DE number 3249773
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complete Recursively Enumerable Sets |
scientific article; zbMATH DE number 3249773 |
Statements
1968
0 references
mathematical logic
0 references
Complete Recursively Enumerable Sets (English)
0 references
0 references
