A syntactical proof of the Marriage Lemma. (Q1853584): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q125020752, #quickstatements; #temporary_batch_1710982311091
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4399249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuations and Dedekind's Prague theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Marriage Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical Completeness Theorems in Logic and Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Problem of Simplifying Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the Transfinite Case of Hall's Theorem on Representatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079581 / rank
 
Normal rank

Latest revision as of 10:28, 5 June 2024

scientific article
Language Label Description Also known as
English
A syntactical proof of the Marriage Lemma.
scientific article

    Statements

    A syntactical proof of the Marriage Lemma. (English)
    0 references
    0 references
    21 January 2003
    0 references
    marriage lemma
    0 references
    hyperresolution
    0 references
    resolution
    0 references
    complexity of proofs
    0 references
    pigeonhole principle
    0 references

    Identifiers