The following pages link to Computer Science Logic (Q5311249):
Displaying 10 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- Natural termination (Q673622) (← links)
- An effective proof of the well-foundedness of the multiset path ordering (Q857884) (← links)
- Total termination of term rewriting is undecidable (Q1911402) (← links)
- Some general results about proof normalization (Q1931341) (← links)
- (Q3343462) (← links)
- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (Q3522031) (← links)
- Termination of theorem proving by reuse (Q4647503) (← links)
- (Q4704206) (← links)
- A local termination property for term rewriting systems (Q5055724) (← links)