Degrees of denumerability reducibilities (Q1095898): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061406598 / rank | |||
Normal rank | |||
Latest revision as of 12:05, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degrees of denumerability reducibilities |
scientific article |
Statements
Degrees of denumerability reducibilities (English)
0 references
1986
0 references
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.
0 references
reducibilities
0 references
s-degrees
0 references
elementary theory
0 references
upper semilattice
0 references
pc- degrees
0 references
