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:

    “It’s given new meaning to me of the scientific term black hole.”
    —Don Logan, U.S. businessman, president and chief executive of Time Inc. His response when asked how much his company had spent in the last year to develop Pathfinder, Time Inc.’S site on the World Wide Web. Quoted in New York Times, p. D7 (November 13, 1995)