Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
GOH, JUN LE
PAULY, ARNO
and
VALENTI, MANLIO
2021.
FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS.
The Journal of Symbolic Logic,
Vol. 86,
Issue. 2,
p.
817.
D’AURIAC, PAUL-ELLIOT ANGLÈS
and
KIHARA, TAKAYUKI
2021.
A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES.
The Journal of Symbolic Logic,
Vol. 86,
Issue. 4,
p.
1452.
BeMent, Zach
Hirst, Jeffry
and
Wallace, Asuka
2021.
Reverse mathematics and Weihrauch analysis motivated by finite complexity theory.
Computability,
Vol. 10,
Issue. 4,
p.
343.
Flood, Stephen
Jura, Matthew
Levin, Oscar
and
Markkanen, Tyler
2022.
The computational strength of matchings in countable graphs.
Annals of Pure and Applied Logic,
Vol. 173,
Issue. 8,
p.
103133.