Degrees of denumerability reducibilities
type: Item
instance of: scholarly article
title: Degrees of denumerability reducibilities
zbMATH Open document ID: 0633.03041
DOI: 10.1007/BF01978882
author: S. D. Zakharov
published in: Algebra and Logic
publication date: 1986-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/187342
review text: Let \(Th(L_ r)\) be the elementary theory for the upper semilattice \(L_ r\). It is proved that \(Th(L_{pc})\neq Th(L_ c)\) and \(Th(L_{pc})\neq Th(L_ p)\). Examples of s- and pc-degrees which have only one m-degree are given.
Mathematics Subject Classification ID: 03D30
zbMATH DE Number: 4029540
zbMATH Keywords: reducibilities
zbMATH Keywords: s-degrees
zbMATH Keywords: elementary theory
zbMATH Keywords: upper semilattice
zbMATH Keywords: pc- degrees
MaRDI profile type: Publication
cites work: Semilattices of disjunctive and linear degrees
cites work: Nilpotency of ideals in (-1,1) rings with minimum condition
cites work: Partial degrees and the density problem
cites work: Semirecursive Sets and Positive Reducibility
cites work: A survey of partial degrees
OpenAlex ID: W2061406598
description: scientific article; zbMATH DE number 4029540