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:

    “We term sleep a death ... by which we may be literally said to die daily; in fine, so like death, I dare not trust it without my prayers.”
    —Thomas Browne (1605–1682)