Completeness of resolution revisited (Q914411): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5726943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The axiom of choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem-Proving for Computers: Some Results on Resolution and Renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3864488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Theorem Proving With Renamable and Semantic Resolution / rank
 
Normal rank

Latest revision as of 15:46, 20 June 2024

scientific article
Language Label Description Also known as
English
Completeness of resolution revisited
scientific article

    Statements

    Completeness of resolution revisited (English)
    0 references
    0 references
    1990
    0 references
    transfinite induction
    0 references
    Zermelo's well ordering theorem
    0 references
    completeness
    0 references
    resolution
    0 references
    Zorn's lemma
    0 references

    Identifiers