PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES (Q4408481): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Coding in the partial order of enumerable sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The undecidability of the recursively enumerable degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0219061303000236 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067250586 / rank | |||
Normal rank | |||
Latest revision as of 10:35, 30 July 2024
scientific article; zbMATH DE number 1941344
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES |
scientific article; zbMATH DE number 1941344 |
Statements
PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES (English)
0 references
27 November 2003
0 references
recursively enumerable degrees
0 references
parameter definability
0 references
true arithmetic
0 references
ideals
0 references
