The complexity of the falsifiability problem for pure implicational formulas (Q5917958): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5783647 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:12, 29 May 2024

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

    Statements

    The complexity of the falsifiability problem for pure implicational formulas (English)
    0 references
    0 references
    17 January 2000
    0 references
    falsifiability
    0 references

    Identifiers