Relations between table-type degrees
type: Item
instance of: scholarly article
title: Relations between table-type degrees
zbMATH Open document ID: 0534.03020
DOI: 10.1007/BF01979647
published in: Algebra and Logic
publication date: 1983-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/187205
review text: If r is a reducibility, let \(Th(L_ r)\) be the elementary theory of the upper semilattice of the recursively enumerable r-degrees \(L_ r\). It is proved that \((i)\quad Th(L_{tt})\neq Th(L_ p); (ii)\quad Th(L_ l)\neq Th(L_ r)\) for \(r\in \{btt,tt,p,d\}\). An example of a non-recursive btt- degree which contains only one m-degree is also constructed.
Mathematics Subject Classification ID: 03D30
zbMATH DE Number: 3847374
zbMATH Keywords: table-type reducibilities
zbMATH Keywords: r-degrees
author: A. N. Degtev
MaRDI profile type: Publication
cites work: Q3884099
cites work: Hypersimple sets with retraceable complements
cites work: Q3968919
cites work: Relationships Between Reducibilities
OpenAlex ID: W2073082088
Recommended article: Relations between reducibilities of table type
Recommended article: Degree Spectra of Equivalence Relations
Recommended article: Tabular degrees in \(\alpha\)-recursion theory
Recommended article: Q4387383
Recommended article: Degrees of relations on ordinals
Recommended article: Relations on generalized degree sequences
Recommended article: On the structures inside truth-table degrees
Recommended article: Q4891408
Recommended article: Q4530468
Recommended article: Q3322162
description: scientific article; zbMATH DE number 3847374