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

From MaRDI portal
Revision as of 09:54, 10 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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