Boolean pairs formed by the \(\Delta_ n^ 0\)-sets (Q1368583): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The theory of the recursively enumerable weak truth-table degrees is undecidable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Coding in the partial order of enumerable sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Orbits of hyperhypersimple sets and the lattice of <i>Σ</i><sup>0</sup><sub>3</sub> sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040892 / rank | |||
Normal rank | |||
Revision as of 19:09, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Boolean pairs formed by the \(\Delta_ n^ 0\)-sets |
scientific article |
Statements
Boolean pairs formed by the \(\Delta_ n^ 0\)-sets (English)
0 references
29 September 1997
0 references
Boolean pairs
0 references
undecidable elementary theories
0 references
