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:

    “Why did you give no hint that night
    That quickly after the morrow’s dawn,
    And calmly, as if indifferent quite,
    You would close your term here, up and be gone”
    —Thomas Hardy (1840–1928)