Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Larson, Jean A.
1973.
A short proof of a partition theorem for the ordinal ωω.
Annals of Mathematical Logic,
Vol. 6,
Issue. 2,
p.
129.
1977.
Combinatorial Set Theory.
Vol. 91,
Issue. ,
p.
196.
Nosal, Eva
1979.
Partition relations for denumerable ordinals.
Journal of Combinatorial Theory, Series B,
Vol. 27,
Issue. 2,
p.
190.
1982.
Linear Orderings.
Vol. 98,
Issue. ,
p.
205.
1982.
Linear Orderings.
Vol. 98,
Issue. ,
p.
456.
Larson, Jean A.
1993.
Finite and Infinite Combinatorics in Sets and Logic.
p.
207.
Erdős, Paul
Hajnal, A.
and
Larson, Jean A.
1993.
Finite and Infinite Combinatorics in Sets and Logic.
p.
97.
Larson, Jean A.
2000.
An ordinal partition avoiding pentagrams.
Journal of Symbolic Logic,
Vol. 65,
Issue. 3,
p.
969.
Hajnal, András
and
Larson, Jean A.
2010.
Handbook of Set Theory.
p.
129.
Larson, Jean A.
2012.
Sets and Extensions in the Twentieth Century.
Vol. 6,
Issue. ,
p.
145.
Hajnal, András
2013.
The Mathematics of Paul Erdős II.
p.
379.
Lücke, Philipp
Schlicht, Philipp
and
Weinert, Thilo
2017.
Choiceless Ramsey Theory of Linear Orders.
Order,
Vol. 34,
Issue. 3,
p.
369.
LAMBIE-HANSON, Chris
and
WEINERT, Thilo
2019.
Partitioning subsets of generalised scattered orders.
Journal of the Mathematical Society of Japan,
Vol. 71,
Issue. 1,
Klausner, L D
and
Weinert, T
2020.
THE POLARISED PARTITION RELATION FOR ORDER TYPES.
The Quarterly Journal of Mathematics,
Vol. 71,
Issue. 3,
p.
823.
Džamonja, Mirna
Koutsoukou-Argyraki, Angeliki
and
Paulson, Lawrence C.
2022.
Formalizing Ordinal Partition Relations Using Isabelle/HOL.
Experimental Mathematics,
Vol. 31,
Issue. 2,
p.
383.
Paulson, Lawrence C.
2023.
Intelligent Computer Mathematics.
Vol. 14101,
Issue. ,
p.
3.
Paulson, Lawrence C.
2024.
A formalised theorem in the partition calculus.
Annals of Pure and Applied Logic,
Vol. 175,
Issue. 1,
p.
103246.