Recursively enumerable sets of positive integers and their decision problems (Q5845382)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3106575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
