Complete axiomatizations of some quotient term algebras
Theoretical Computer Science
A decision procedure for term algebras with queues
ACM Transactions on Computational Logic (TOCL)
Monadic second-order logic on tree-like structures
Theoretical Computer Science
CASL: the common algebraic specification language
Theoretical Computer Science
A CLP View of Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
An Improved Lower Bound for the Elementary Theories of Trees
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Structural Subtyping of Non-Recursive Types is Decidable
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Automatic linear orders and trees
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Let ${\cal A}$ be a partial algebra on a finite signature. We say that ${\cal A}$ has decidable query evaluation problem if there exists an algorithm that given a first order formula $\phi(\bar{x})$ and a tuple $\bar{a}$ from the domain of ${\cal A}$ decides whether or not $\phi(\bar{a})$ holds in ${\cal A}$. Denote by $E({\cal A})$ the total algebra freely generated by ${\cal A}$. We prove that if ${\cal A}$ has a decidable query evaluation problem then so does $E({\cal A})$. In particular, the first order theory of $E({\cal A})$ is decidable. In addition, if ${\cal A}$ has elimination of quantifiers then so does $E({\cal A})$ extended by finitely many definable selector functions and tester predicates. Our proof is a refinement of the quantifier elimination procedure for free term algebras. As an application we show that any finitely presented term algebra has a decidable query evaluation problem. This extends the known result that the word problem for finitely presented term algebras is decidable.