Every incomplete computably enumerable truth-table degree is branching (Q5931217)
From MaRDI portal
scientific article; zbMATH DE number 1590719
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every incomplete computably enumerable truth-table degree is branching |
scientific article; zbMATH DE number 1590719 |
Statements
Every incomplete computably enumerable truth-table degree is branching (English)
0 references
21 March 2002
0 references
We call a degree branching if it is the meet of two degrees strictly above it. In this paper it is proved that every tt-incomplete computably enumerable truth-table degree is branching.
0 references
branching degree
0 references
computably enumerable truth-table degree
0 references