Pages that link to "Item:Q593789"
From MaRDI portal
The following pages link to Orderings for term-rewriting systems (Q593789):
Displayed 45 items.
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Generalized sufficient conditions for modular termination of rewriting (Q1328180) (← links)
- Automated deduction with associative-commutative operators (Q1340508) (← links)
- Weights for total division orderings on strings (Q1346630) (← links)
- Abstract data type systems (Q1391729) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- A fully syntactic AC-RPO. (Q1400715) (← links)
- A characterisation of multiply recursive functions with Higman's lemma. (Q1400716) (← links)
- Analysing the implicit complexity of programs. (Q1401939) (← links)
- Superposition with completely built-in abelian groups (Q1432887) (← links)
- Correspondences between classical, intuitionistic and uniform provability (Q1575924) (← links)
- Invariants, patterns and weights for ordering terms (Q1581131) (← links)
- Richer types for \(Z\) (Q1816920) (← links)
- Proof of termination of the rewriting system SUBSET on CCL (Q1822494) (← links)
- Induction = I-axiomatization + first-order consistency. (Q1854350) (← links)
- Pattern matching as cut elimination (Q1882898) (← links)
- Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
- A calculus for and termination of rippling (Q1915137) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- An improved general path order (Q1925013) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Regaining cut admissibility in deduction modulo using abstract completion (Q2266989) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Abstract canonical presentations (Q2500482) (← links)
- Normal forms for binary relations (Q2503327) (← links)
- The undecidability of iterated modal relativization (Q2574887) (← links)
- AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS (Q3021959) (← links)
- (Q3327710) (← links)
- Theories of orders on the set of words (Q3374756) (← links)
- Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities (Q3522029) (← links)
- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (Q3522031) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- 10th Asian Logic Conference (Q3633210) (← links)
- Upper Bounds on Stream I/O Using Semantic Interpretations (Q3644754) (← links)
- (Q3667939) (← links)
- (Q3700828) (← links)
- Logic and functional programming by retractions : operational semantics (Q3817575) (← links)
- The order types of termination orderings on monadic terms, strings and multisets (Q4358058) (← links)
- Finite complete rewriting systems for groups (Q4384697) (← links)
- Combinable Extensions of Abelian Groups (Q5191096) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Proving Termination with (Boolean) Satisfaction (Q5504589) (← links)
- A general framework to build contextual cover set induction provers (Q5950934) (← links)
- Two applications of analytic functors (Q5958294) (← links)
- On the longest perpetual reductions in orthogonal expression reduction systems (Q5958775) (← links)