Satisfiability problems for propositional calculi (Q3864500): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Latest revision as of 03:24, 13 June 2024

scientific article
Language Label Description Also known as
English
Satisfiability problems for propositional calculi
scientific article

    Statements

    Satisfiability problems for propositional calculi (English)
    0 references
    0 references
    1979
    0 references
    Boolean connectives
    0 references
    satisfiability for formulas
    0 references
    NP-completeness
    0 references
    polynomial-time satisfiability problem
    0 references

    Identifiers