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:

    “Orlando. Who stays it still withal?
    Rosalind. With lawyers in the vacation; for they sleep
    between term and term, and then they perceive not how Time
    moves.”
    —William Shakespeare (1564–1616)