The following pages link to (Q3204048):
Displaying 23 items.
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems (Q671506) (← links)
- Modular termination of \(r\)-consistent and left-linear term rewriting systems (Q672714) (← links)
- Modularity in noncopying term rewriting (Q673186) (← links)
- Modular term rewriting systems and the termination (Q910207) (← links)
- Bubbles in modularity (Q1127335) (← links)
- Modularity of simple termination of term rewriting systems with shared constructors (Q1199539) (← links)
- Decidability of reachability for disjoint union of term rewriting systems (Q1325846) (← links)
- Generalized sufficient conditions for modular termination of rewriting (Q1328180) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Modular proofs for completeness of hierarchical term rewriting systems (Q1350349) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- Modular termination of prefix-constrained term rewrite systems (Q2059889) (← links)
- Termination criteria for DPO transformations with injective matches (Q2867892) (← links)
- The theory of vaccines (Q4571995) (← links)
- Extension orderings (Q4645205) (← links)
- Transforming termination by self-labelling (Q4647535) (← links)
- Termination for the direct sum of left-linear term rewriting systems (Q5055740) (← links)
- Completeness of combinations of constructor systems (Q5055759) (← links)
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems (Q5096744) (← links)
- Completeness of combinations of conditional constructor systems (Q5881177) (← links)
- Sufficient conditions for modular termination of conditional term rewriting systems (Q5881180) (← links)
- Confluence of the disjoint union of conditional term rewriting systems (Q5881285) (← links)
- Implementing term rewriting by graph reduction: Termination of combined systems (Q5881286) (← links)
