Hypersimplicity and semicomputability in the weak truth table degrees (Q2576639): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The approximation structure of a computably approximable real / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation representations for \(\Delta_2\) reals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation representations for reals and their wtt‐degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semirecursive Sets and Positive Reducibility / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classical recursion theory. Vol. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3819052 / rank | |||
Normal rank |
Latest revision as of 14:11, 11 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hypersimplicity and semicomputability in the weak truth table degrees |
scientific article |
Statements
Hypersimplicity and semicomputability in the weak truth table degrees (English)
0 references
14 December 2005
0 references
hypersimple sets
0 references
hypersimple degrees
0 references
computable orderings
0 references
weak truth table degree
0 references