Recursively enumerable sets of positive integers and their decision problems
Publication:5845382
DOI10.1090/S0002-9904-1944-08111-1zbMath0063.06328OpenAlexW2045033949WikidataQ55881466 ScholiaQ55881466MaRDI QIDQ5845382
Publication date: 1944
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9904-1944-08111-1
recursively enumerable setsmany-one reducibilityGödel's theoremcreative setssimhyper-simple setscomplete set \(K\)counter-example for unbounded truth-tablesnon-reducibility of creative sets to hyper-simple sets by truth-tables unrestrictednon-reducibility of creative sets to simple sets by bounded truth-tablesone-one reducibility to \(K\)Recursive sets
Recursively (computably) enumerable sets and degrees (03D25) Recursive equivalence types of sets and structures, isols (03D50)
Related Items (only showing first 100 items - show all)
This page was built for publication: Recursively enumerable sets of positive integers and their decision problems