Term Algebra - Decidability of Term Algebras

Decidability of Term Algebras

Term algebras can be shown decidable using quantifier elimination. The complexity of the decision problem is in NONELEMENTARY.

Read more about this topic:  Term Algebra

Famous quotes containing the word term:

    “Dead drunk
    is the term I think of,
    insensible,
    neither cool nor warm,
    without a head or a foot.
    To be drunk is to be intimate with a fool.”
    —Anne Sexton (1928–1974)