Pages that link to "Item:Q4369898"
From MaRDI portal
The following pages link to Termination for direct sums of left-linear complete term rewriting systems (Q4369898):
Displayed 27 items.
- Lazy productivity via termination (Q549188) (← links)
- 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)
- Termination is not modular for confluent variable-preserving term rewriting systems (Q674186) (← links)
- Modular term rewriting systems and the termination (Q910207) (← links)
- Algebraic specification of concurrent systems (Q914405) (← links)
- A domain model characterising strong normalisation (Q958484) (← links)
- Bubbles in modularity (Q1127335) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← 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)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Modular proofs for completeness of hierarchical term rewriting systems (Q1350349) (← links)
- Interaction nets and term-rewriting systems (Q1389438) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Modular termination of prefix-constrained term rewrite systems (Q2059889) (← links)
- TERMINATION OF ABSTRACT REDUCTION SYSTEMS (Q3620615) (← links)
- The theory of vaccines (Q4571995) (← links)
- THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS (Q4786249) (← links)
- Modularity of completeness revisited (Q5055813) (← links)
- FDT is undecidable for finitely presented monoids with solvable word problems (Q5055951) (← links)
- (Q5094148) (← links)
- How to normalize the Jay (Q5940936) (← links)