|
This article is cited in 1 scientific paper (total in 1 paper)
Truth tabular degrees of recursively enumerable sets
S. Kallibekov Institute of Mathematics, Siberian Branch, Academy of Sciences of the USSR
Abstract:
The upper semilattice of truth tabular degrees of recursively enumerable (r.e.) sets is studied. It is shown that there exists an infinite set of pairwise tabularly incomparable truth tabular degrees higher than any tabularly incomplete r.e. truth tabular degree. A similar assertion holds also for r.e. $m$-degrees. Hence follows that a complete truth tabular degree contains an infinite antichain of r.e. $m$-degrees.
Received: 25.06.1971
Citation:
S. Kallibekov, “Truth tabular degrees of recursively enumerable sets”, Mat. Zametki, 14:5 (1973), 697–702; Math. Notes, 14:5 (1973), 958–961
Linking options:
https://www.mathnet.ru/eng/mzm9954 https://www.mathnet.ru/eng/mzm/v14/i5/p697
|
Statistics & downloads: |
Abstract page: | 134 | Full-text PDF : | 60 | First page: | 1 |
|