The Δ-lemma is a combinatorial set-theoretic tool used in proofs to impose an upper bound on the size of a collection of pairwise incompatible elements in a forcing poset. It may for example be used as one of the ingredients in a proof showing that it is consistent with ZFC that the continuum hypothesis does not hold.

PropertyValue
dbpprop:abstract
  • The Δ-lemma is a combinatorial set-theoretic tool used in proofs to impose an upper bound on the size of a collection of pairwise incompatible elements in a forcing poset. It may for example be used as one of the ingredients in a proof showing that it is consistent with ZFC that the continuum hypothesis does not hold.
  • A véges és végtelen Δ-rendszer lemma fontos szerepet játszik a kombinatorikában illetve a kombinatorikus halmazelméletben.
dbpprop:hasPhotoCollection
rdf:type
rdfs:comment
  • The Δ-lemma is a combinatorial set-theoretic tool used in proofs to impose an upper bound on the size of a collection of pairwise incompatible elements in a forcing poset. It may for example be used as one of the ingredients in a proof showing that it is consistent with ZFC that the continuum hypothesis does not hold.
  • A véges és végtelen Δ-rendszer lemma fontos szerepet játszik a kombinatorikában illetve a kombinatorikus halmazelméletben.
rdfs:label
  • Delta lemma
  • Delta-rendszer lemma
owl:sameAs
skos:subject
foaf:page
is dbpprop:redirect of
is owl:sameAs of