The complexity of the falsifiability problem for pure implicational formulas (Q5900975)

From MaRDI portal
scientific article; zbMATH DE number 5722999
Language Label Description Also known as
English
The complexity of the falsifiability problem for pure implicational formulas
scientific article; zbMATH DE number 5722999

    Statements

    The complexity of the falsifiability problem for pure implicational formulas (English)
    0 references
    0 references
    17 June 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    subject classification algorithms
    0 references
    data structures
    0 references
    logic in computer science
    0 references
    0 references