On the public citation graph

On the origins of D�nes K�nig's infinity lemma

https://doi.org/10.1007/bf00376449
0 signed · 34 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4613-9478-5openalex-snapshot
Zermelo’s Axiom of Choice
inferredcites →https://doi.org/10.1007/978-1-4684-8971-2_2openalex-snapshot
Theory of Finite and Infinite Graphs
inferredcites →https://doi.org/10.1007/978-3-663-10149-9_6openalex-snapshot
Gesammelte Abhandlungen
inferredcites →https://doi.org/10.1007/bf01206601openalex-snapshot
Über mehrdeutige Abbildungen von Mengen
inferredcites →https://doi.org/10.1007/bf01444205openalex-snapshot
Beitr�ge zur Begr�ndung der transfiniten Mengenlehre
inferredcites →https://doi.org/10.1007/bf01456961openalex-snapshot
Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre
inferredcites →https://doi.org/10.1007/bf01457734openalex-snapshot
Untersuchungen aus der Mengenlehre
inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
inferredcites →https://doi.org/10.1007/bf02124929openalex-snapshot
Beiträge zur Begründung der transfiniten Mengenlehre
inferredcites →https://doi.org/10.1007/bf02392606openalex-snapshot
Die Theorie der regulären graphs
inferredcites →https://doi.org/10.1007/bf03018199openalex-snapshot
Zur theorie der mächtigkeiten
inferredcites →https://doi.org/10.1016/0024-3795(78)90082-4openalex-snapshot
The life and scientific work of Dénes König (1884–1944)
inferredcites →https://doi.org/10.1093/oso/9780198505242.001.0001openalex-snapshot
Elements of Intuitionism
inferredcites →https://doi.org/10.1111/j.1468-0149.1978.tb00089.xopenalex-snapshot
ELEMENTS OF INTUITIONISM
inferredcites →https://doi.org/10.14463/gbv:1010162810openalex-snapshot
Neue Grundlagen der Logik, Arithmetik und Mengenlehre
inferredcites →https://doi.org/10.1515/9783112359648openalex-snapshot
Neue Grundlagen der Logik, Arithmetik und Mengenlehre
inferredcites →https://doi.org/10.2307/2011434openalex-snapshot
Les Mathematiques et la Logique.
inferredcites →https://doi.org/10.2307/2369235openalex-snapshot
On the Geographical Problem of the Four Colours
inferredcites →https://doi.org/10.2307/3615432openalex-snapshot
Graphs and determinants
inferredcites →https://doi.org/10.4064/fm-3-1-1-6openalex-snapshot
Sur l'égalité 2m = 2n pour les nombres cardinaux
inferredcites →https://doi.org/10.4064/fm-8-1-114-134openalex-snapshot
Sur les correspondances multivoques des ensembles

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-0348-0224-6_21openalex-snapshot
J. Kőnig’s Strings Gestalt
inferred← citeshttps://doi.org/10.1007/978-3-0348-0224-6_22openalex-snapshot
From Kings to Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-89722-6_2openalex-snapshot
Secure Information Release in Timed Automata
inferred← citeshttps://doi.org/10.1007/978-94-017-2796-9_7openalex-snapshot
Did Brouwer’s Intuitionistic Analysis Satisfy Its Own Epistemological Standards?
inferred← citeshttps://doi.org/10.1007/s00153-019-00663-0openalex-snapshot
The strong tree property and the failure of SCH
inferred← citeshttps://doi.org/10.1016/b978-0-444-51621-3.50003-7openalex-snapshot
Infinite Combinatorics
inferred← citeshttps://doi.org/10.1016/j.jpaa.2017.07.009openalex-snapshot
Homogeneous nilradicals over semigroup graded rings
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114595openalex-snapshot
Deciding atomicity of subword-closed languages
inferred← citeshttps://doi.org/10.1017/s1755020316000411openalex-snapshot
THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
inferred← citeshttps://doi.org/10.1080/01445340.2015.1065460openalex-snapshot
König's Infinity Lemma and Beth's Tree Theorem
inferred← citeshttps://doi.org/10.1080/17498430.2018.1504458openalex-snapshot
Game, set, and graph
inferred← citeshttps://doi.org/10.4204/eptcs.297.14openalex-snapshot
How to Agree without Understanding Each Other: Public Announcement Logic with Boolean Definitions
inferred← citeshttps://doi.org/10.70675/dd76d6cfzb477z4046z99bez9903671ddc1eopenalex-snapshot
Algorithmique et complexité des systèmes à compteurs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.