Discriminator varieties and symbolic computation

Authors:
Stanley Burris
Affiliations:
Dept. of Pure Mathematics, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Venue:
Journal of Symbolic Computation
Year:
1992

Citing 10
Cited 2

Refutational theorem proving using term-rewriting systems

Artificial Intelligence
Equational methods in first order predicate calculus

Journal of Symbolic Computation
Equational bases for if-then-else

SIAM Journal on Computing
Rewrite method for theorem proving in first order theory with equality

Journal of Symbolic Computation
Unification theory

Journal of Symbolic Computation
Unification in primal algebras, their powers and their varieties

Journal of the ACM (JACM)
Decidable discriminator varieties from unary varieties

Journal of Symbolic Logic
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Rewrite Methods for Clausal and Non-Clausal Theorem Proving

Proceedings of the 10th Colloquium on Automata, Languages and Programming
An Equational Logic Sampler

RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications

Reduction of Hilbert-type proof systems to the if-then-else equational logic

Journal of Applied Mathematics and Computing
Expansions of Semi-Heyting Algebras I: Discriminator Varieties

Studia Logica

Quantified Score

Hi-index	0.00

Visualization

Abstract

We look at two aspects of discriminator varieties which could be of considerable interest in symbolic computation:1.discriminator varieties are unitary (i.e., there is always a most general unifier of two unifiable terms), and 2.every mathematical problem can be routinely cast in the form^@?p"1 ~ q"1, ..., p"k ~ q"k implies the equation x ~ y. Item (l) offers possibilities for implementations in computational logic, and (2) shows that Birkhoff's five rules of inference for equational logic are all one needs to prove theorems in mathematics.