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:

    “There are other letters for the child to learn than those which Cadmus invented. The Spaniards have a good term to express this wild and dusky knolwedge, Grammatica parda, tawny grammar, a kind of mother-wit derived from that same leopard to which I have referred.”
    —Henry David Thoreau (1817–1862)