scientific article
From MaRDI portal
Publication:3698310
zbMath0577.68054MaRDI QIDQ3698310
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
completion algorithmcompleteness propertyproof by inductionnon-equational theoriesuniversally quantified formulas
Related Items
Simplifying conditional term rewriting systems: Unification, termination and confluence ⋮ History and basic features of the critical-pair/completion procedure ⋮ The equational theory of parameterized specifications ⋮ Theorem-proving with resolution and superposition ⋮ Automatic proofs by induction in theories without constructors
