On -satisfiability and its -lock resolution in a finite lattice-valued propositional logic

DOI10.1093/jigpal/jzr007zbMath1257.03036OpenAlexW2166100649MaRDI QIDQ2905643

No author found.

Publication date: 28 August 2012

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/jzr007

zbMATH Keywords

lattice-valued logic\(\alpha \)-lock resolution method\(\alpha \)-resolution principle\(\alpha \)-satisfiabilityfinite lattice-valued propositional logic

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Mechanization of proofs and logical operations (03B35)

Related Items (4)

\( \alpha \)-paramodulation method for a lattice-valued logic \(L_nF(X)\) with equality ⋮ On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic ⋮ A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional logic ⋮ Comparisons Among α-Generalized Resolution Methods in $$\fancyscript{L}_{n \times 2}$$F(X)

This page was built for publication: On  -satisfiability and its  -lock resolution in a finite lattice-valued propositional logic