Pages that link to "Item:Q1392274"
From MaRDI portal
The following pages link to The first-order theory of lexicographic path orderings is undecidable (Q1392274):
Displaying 7 items.
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- How to win a game with features (Q1271569) (← links)
- The computability path ordering (Q3196359) (← links)
- Theories of orders on the set of words (Q3374756) (← links)
- (Q4683860) (← links)
- Problems in rewriting III (Q5055847) (← links)
- Can One Escape Red Chains? (Q5145324) (← links)