Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finitely branching trees
infinite trees |
| gptkbp:category |
gptkb:logic
|
| gptkbp:compatibleWith |
infinitely branching trees
|
| gptkbp:field |
gptkb:set_theory
combinatorics graph theory |
| gptkbp:firstPublished |
1927
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kőnig's lemma
|
| gptkbp:implies |
existence of infinite paths in certain graphs
|
| gptkbp:isWeakerThan |
gptkb:countable_axiom_of_choice
axiom of choice |
| gptkbp:namedAfter |
gptkb:Dénes_Kőnig
|
| gptkbp:relatedTo |
axiom of choice
infinite tree compactness theorem |
| gptkbp:sentence |
Every finitely branching infinite tree has an infinite path.
|
| gptkbp:usedIn |
gptkb:logic
model theory proof theory |
| gptkbp:bfsParent |
gptkb:Gyula_Kőnig
|
| gptkbp:bfsLayer |
6
|