The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (Q4813796): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1090/s0002-9947-03-03406-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1956375874 / rank | |||
Normal rank | |||
Latest revision as of 10:47, 30 July 2024
scientific article; zbMATH DE number 2091190
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The ∀∃-theory of ℛ(≤,∨,∧) is undecidable |
scientific article; zbMATH DE number 2091190 |
Statements
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (English)
0 references
13 August 2004
0 references
recursively enumerable degree
0 references
computably enumerable degree
0 references
decidability
0 references
undecidability
0 references
Turing reducibility
0 references
0 references
0 references
0 references
