The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (Q4813796)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2091190
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8416216969490051
0 references
0.8416213393211365
0 references
0.828777551651001
0 references
0.8151198625564575
0 references
