Pages that link to "Item:Q4020283"

The following pages link to THE WORD PROBLEM OF ACD-GROUND THEORIES IS UNDECIDABLE (Q4020283):

Displaying 2 items.

• On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus (Q896922) (← links)
• A rewriting approach to satisfiability procedures. (Q1401930) (← links)