Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Duffus, D.
Pouzet, M.
and
Rival, I.
1981.
Complete ordered sets with no infinite antichains.
Discrete Mathematics,
Vol. 35,
Issue. 1-3,
p.
39.
1982.
Linear Orderings.
Vol. 98,
Issue. ,
p.
174.
Shelah, Saharon
1982.
Better quasi-orders for uncountable cardinals.
Israel Journal of Mathematics,
Vol. 42,
Issue. 3,
p.
177.
Ehrenfeucht, A.
Haussler, D.
and
Rozenberg, G.
1983.
On regularity of context-free languages.
Theoretical Computer Science,
Vol. 27,
Issue. 3,
p.
311.
Simpson, Stephen G.
1985.
Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume.
Archiv für Mathematische Logik und Grundlagenforschung,
Vol. 25,
Issue. 1,
p.
45.
Simpson, Stephen G.
1985.
Harvey Friedman's Research on the Foundations of Mathematics.
Vol. 117,
Issue. ,
p.
87.
Milner, E. C.
1985.
Graphs and Order.
p.
487.
1986.
Theory of Relations.
Vol. 118,
Issue. ,
p.
373.
Kozen, Dexter
1988.
A finite model theorem for the propositional ?-calculus.
Studia Logica,
Vol. 47,
Issue. 3,
p.
233.
Klazar, Martin
2000.
Counting Pattern-free Set Partitions I: A Generalization of Stirling Numbers of the Second Kind.
European Journal of Combinatorics,
Vol. 21,
Issue. 3,
p.
367.
Forster, Thomas
2003.
Better-quasi-orderings and coinduction.
Theoretical Computer Science,
Vol. 309,
Issue. 1-3,
p.
111.
Klazar, Martin
2004.
On the least exponential growth admitting uncountably many closed permutation classes.
Theoretical Computer Science,
Vol. 321,
Issue. 2-3,
p.
271.
Abdulla, Parosh Aziz
Atto, Muhsin
Cederberg, Jonathan
and
Ji, Ran
2009.
Automated Technology for Verification and Analysis.
Vol. 5799,
Issue. ,
p.
197.
Schröder, Lutz
and
Venema, Yde
2010.
CONCUR 2010 - Concurrency Theory.
Vol. 6269,
Issue. ,
p.
524.
Cherlin, Gregory
2011.
Forbidden substructures and combinatorial dichotomies: WQO and universality.
Discrete Mathematics,
Vol. 311,
Issue. 15,
p.
1543.
Larson, Jean A.
2012.
Sets and Extensions in the Twentieth Century.
Vol. 6,
Issue. ,
p.
145.
Aichinger, Erhard
and
Mudrinski, Nebojša
2013.
Sequences of Commutator Operations.
Order,
Vol. 30,
Issue. 3,
p.
859.
Kanamori, Akihiro
2016.
Laver and set theory.
Archive for Mathematical Logic,
Vol. 55,
Issue. 1-2,
p.
133.
Carlson, Timothy
2016.
Generalizing Kruskal’s theorem to pairs of cohabitating trees.
Archive for Mathematical Logic,
Vol. 55,
Issue. 1-2,
p.
37.
2016.
Combinatorics of Permutations.
p.
253.