Computational complexity for bounded distributive lattices with negation (Q2032990)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computational complexity for bounded distributive lattices with negation
scientific article

    Statements

    Computational complexity for bounded distributive lattices with negation (English)
    0 references
    0 references
    0 references
    14 June 2021
    0 references
    universal theory
    0 references
    computational complexity
    0 references
    distributive lattice with negation
    0 references
    partial algebra
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references