Termination of rewrite systems by elementary interpretations
From MaRDI portal
Publication:1805401
DOI10.1007/BF01214624zbMath0817.68095MaRDI QIDQ1805401
Publication date: 11 May 1995
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Related Items
More problems in rewriting, Mechanically proving termination using polynomial interpretations, Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations, Automatic Proofs of Termination With Elementary Interpretations
Uses Software
Cites Work