Pages that link to "Item:Q1897558"

The following pages link to Resolution-based theorem proving for many-valued logics (Q1897558):

Displaying 7 items.

• Canonical signed calculi with multi-ary quantifiers (Q408550) (← links)
• Binary resolution over Boolean lattices (Q853473) (← links)
• Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
• The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
• On the refutational completeness of signed binary resolution and hyperresolution (Q1037933) (← links)
• A categorical critical-pair completion algorithm (Q1300576) (← links)
• Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers (Q1697332) (← links)