Recursively enumerable sets of positive integers and their decision problems (Q5845382): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55881466, #quickstatements; #temporary_batch_1705753332619 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 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.1090/s0002-9904-1944-08111-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045033949 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:58, 30 July 2024
scientific article; zbMATH DE number 3106575
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursively enumerable sets of positive integers and their decision problems |
scientific article; zbMATH DE number 3106575 |
Statements
Recursively enumerable sets of positive integers and their decision problems (English)
0 references
1944
0 references
Recursive sets
0 references
recursively enumerable sets
0 references
Gödel's theorem
0 references
complete set \(K\)
0 references
creative sets
0 references
one-one reducibility to \(K\)
0 references
many-one reducibility
0 references
sim
0 references
non-reducibility of creative sets to simple sets by bounded truth-tables
0 references
counter-example for unbounded truth-tables
0 references
hyper-simple sets
0 references
non-reducibility of creative sets to hyper-simple sets by truth-tables unrestricted
0 references
