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:

    “Frankly, I do not like the idea of conversations to define the term “unconditional surrender.” ... The German people can have dinned into their ears what I said in my Christmas Eve speech—in effect, that we have no thought of destroying the German people and that we want them to live through the generations like other European peoples on condition, of course, that they get rid of their present philosophy of conquest.”
    —Franklin D. Roosevelt (1882–1945)