Pages that link to "Item:Q1139374"
From MaRDI portal
The following pages link to A note on simplification orderings (Q1139374):
Displayed 24 items.
- Orderings for term-rewriting systems (Q593789) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Algebra of communicating processes with abstraction (Q1067408) (← links)
- Termination orderings for associative-commutative rewriting systems (Q1072371) (← links)
- Termination of rewriting (Q1098624) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
- An analysis of loop checking mechanisms for logic programs (Q1177923) (← links)
- Well rewrite orderings and well quasi-orderings (Q1209622) (← links)
- Explicit substitution. On the edge of strong normalization (Q1274458) (← links)
- Generating polynomial orderings (Q1318775) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Generalized sufficient conditions for modular termination of rewriting (Q1328180) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- An improved general path order (Q1925013) (← links)
- Some general results about proof normalization (Q1931341) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- (Q3667939) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Monotonicity Criteria for Polynomial Interpretations over the Naturals (Q5747787) (← links)