The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (Q4813796)

From MaRDI portal
Revision as of 01:20, 8 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    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

    Identifiers