Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication (Q3260571): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2964290 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2127316662 / rank | |||
Normal rank | |||
Revision as of 01:05, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication |
scientific article |
Statements
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication (English)
0 references
1959
0 references
foundations of mathematics, philosophy, logic
0 references
