Binary resolution over Boolean lattices (Q853473): Difference between revisions

The author presents a binary resolution system over complete Boolean lattices with the condition that their supremum operators are infinitely distributive over the infimum ones. He utilizes inference techniques developed in classical two-valued logic for many-valued ones. He considers many-valued logics \({\mathbf L}\) whose truth values form a Boolean algebra. He avoids any limitation to the finite case where the set of truth values or a given set of clauses are finite. The refutational soundness and completeness of binary \({\mathbf L}\)-resolution is proved.