On the union of well-founded relations

DOI10.1093/jigpal/6.2.195zbMath0892.68050OpenAlexW2017234404MaRDI QIDQ4383698

Henk Doornbos, Burghard von Karger

Publication date: 2 April 1998

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7e1dcf412c92e12c42f986eb89c0e42527f89ef2

zbMATH Keywords

program terminationwell-founded relationsregular algebra

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (8)

Finding small counterexamples for abstract rewriting properties ⋮ Jumping and escaping: modular termination and the abstract path ordering ⋮ An insertion operator preserving infinite reduction sequences ⋮ Modal Tools for Separation and Refinement ⋮ Remarks on Isomorphisms of Simple Inductive Types ⋮ TERMINATION OF ABSTRACT REDUCTION SYSTEMS ⋮ On the Relation between Sized-Types Based Termination and Semantic Labelling ⋮ Abstract abstract reduction

This page was built for publication: On the union of well-founded relations