Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication (Q3260571): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q29392709 / rank | |||
Normal rank | |||
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/2964290 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2127316662 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:53, 11 June 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