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:

    “In eloquence, the great triumphs of the art are when the orator is lifted above himself; when consciously he makes himself the mere tongue of the occasion and the hour, and says what cannot but be said. Hence the term abandonment, to describe the self-surrender of the orator.”
    —Ralph Waldo Emerson (1803–1882)