Pages that link to "Item:Q1209623"

The following pages link to A new method for undecidability proofs of first order theories (Q1209623):

Displaying 8 items.

• Combination techniques and decision problems for disunification (Q673624) (← links)
• Anti-patterns for rule-based languages (Q968527) (← links)
• The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
• The first-order theory of lexicographic path orderings is undecidable (Q1392274) (← links)
• The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable. (Q1400708) (← links)
• \(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation (Q1893143) (← links)
• Theories of orders on the set of words (Q3374756) (← links)
• Solving simplification ordering constraints (Q5096318) (← links)