Pages that link to "Item:Q593789"
From MaRDI portal
The following pages link to Orderings for term-rewriting systems (Q593789):
Displayed 50 items.
- The order types of termination orderings on monadic terms, strings and multisets (Q4358058) (← links)
- Finite complete rewriting systems for groups (Q4384697) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- <i>CLP(H):</i>Constraint logic programming for hedges (Q4593022) (← links)
- AC-KBO revisited (Q4593023) (← links)
- R n - and G n -logics (Q4645806) (← links)
- Theorem proving with group presentations: Examples and questions (Q4647534) (← links)
- Transforming termination by self-labelling (Q4647535) (← links)
- Algebra and automated deduction (Q4647540) (← links)
- Walther recursion (Q4647554) (← links)
- (Q4683860) (← links)
- Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01). (Q4916226) (← links)
- Gap Embedding for Well-Quasi-Orderings (Q4924530) (← links)
- Transforming SAT into Termination of Rewriting (Q4982632) (← links)
- From Kruskal’s theorem to Friedman’s gap condition (Q4988429) (← links)
- (Q5009706) (← links)
- (Q5014441) (← links)
- (Q5015375) (← links)
- (Q5018513) (← links)
- Trees, ordinals and termination (Q5044740) (← links)
- Proof normalization for resolution and paramodulation (Q5055708) (← links)
- An overview of LP, the Larch Prover (Q5055717) (← links)
- A local termination property for term rewriting systems (Q5055724) (← links)
- Embedding with patterns and associated recursive path ordering (Q5055733) (← links)
- Rewriting techniques for program synthesis (Q5055734) (← links)
- Extensions and comparison of simplification orderings (Q5055737) (← links)
- Incremental termination proofs and the length of derivations (Q5055748) (← links)
- Time bounded rewrite systems and termination proofs by generalized embedding (Q5055749) (← links)
- On fairness of completion-based theorem proving strategies (Q5055773) (← links)
- Topics in termination (Q5055795) (← links)
- Linear interpretations by counting patterns (Q5055811) (← links)
- A termination ordering for higher order rewrite systems (Q5055816) (← links)
- A complete characterization of termination of 0p 1q→1r 0s (Q5055817) (← links)
- Generating polynomial orderings for termination proofs (Q5055845) (← links)
- Termination of constructor systems (Q5055852) (← links)
- A recursive path ordering for higher-order terms in η-long β-normal form (Q5055855) (← links)
- Dummy elimination: Making termination easier (Q5055895) (← links)
- E-Unification based on Generalized Embedding (Q5084482) (← links)
- Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered (Q5090949) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q5096206) (← links)
- Combinable Extensions of Abelian Groups (Q5191096) (← links)
- Simple termination revisited (Q5210790) (← links)
- Termination orderings for rippling (Q5210791) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Proving Termination with (Boolean) Satisfaction (Q5504589) (← links)
- Termination Tools in Ordered Completion (Q5747788) (← links)
- Combinations of simplifying conditional term rewriting systems (Q5881179) (← links)
- Sufficient conditions for modular termination of conditional term rewriting systems (Q5881180) (← links)
- Termination of combined (rewrite and λ-calculus) systems (Q5881181) (← links)
- Implementing contextual rewriting (Q5881200) (← links)