scientific article
From MaRDI portal
Publication:3956381
zbMath0493.68024MaRDI QIDQ3956381
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
On sufficient-completeness and related properties of term rewriting systems ⋮ Computing linearizations using test sets ⋮ On sufficient completeness of conditional specifications ⋮ Computing ground reducibility and inductively complete positions ⋮ Proofs in parameterized specifications ⋮ Sufficient-completeness, ground-reducibility and their complexity ⋮ Introduction to ``Milestones in interactive theorem proving ⋮ Well rewrite orderings and well quasi-orderings ⋮ Proving weak properties of rewriting ⋮ Reachability analysis over term rewriting systems ⋮ Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness ⋮ Automating inductionless induction using test sets
This page was built for publication:
