Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Nash-Williams, C. St J. A.
1964.
On well-quasi-ordering lower sets of finite trees.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 60,
Issue. 3,
p.
369.
Nash-Williams, C. St. J. A.
1965.
On well-quasi-ordering infinite trees.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 61,
Issue. 3,
p.
697.
Nash-Williams, C. St. J. A.
1968.
On better-quasi-ordering transfinite sequences.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 64,
Issue. 2,
p.
273.
Laver, Richard
1976.
Well-quasi-orderings and sets of finite sequences.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 79,
Issue. 1,
p.
1.
Dershowitz, Nachum
1979.
Orderings for term-rewriting systems.
p.
123.
Dershowitz, Nachum
1979.
A note on simplification orderings.
Information Processing Letters,
Vol. 9,
Issue. 5,
p.
212.
Lerman, Manuel
and
Schmerl, James H.
1979.
Theories with recursive models.
Journal of Symbolic Logic,
Vol. 44,
Issue. 1,
p.
59.
Huet, Gérard
and
Oppen, Derek C.
1980.
Formal Language Theory.
p.
349.
Richter, Linda Jean
1981.
Degrees of Structures.
Journal of Symbolic Logic,
Vol. 46,
Issue. 4,
p.
723.
1982.
Linear Orderings.
Vol. 98,
Issue. ,
p.
174.
Lescanne, Pierre
1982.
Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems.
RAIRO. Informatique théorique,
Vol. 16,
Issue. 4,
p.
331.
Smoryński, C.
1982.
The varieties of arboreal experience.
The Mathematical Intelligencer,
Vol. 4,
Issue. 4,
p.
182.
Dershowitz, Nachum
1982.
Orderings for term-rewriting systems.
Theoretical Computer Science,
Vol. 17,
Issue. 3,
p.
279.
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.
Seymour, P.D.
and
Robertson, Neil
1984.
Orders: Description and Roles - In Set Theory, Lattices, Ordered Groups, Topology, Theory of Models and Relations, Combinatorics, Effectiveness, Social Sciences, Proceedings of the Conference on Ordered Sets and their Application Château dc la Tourcttc; Ordres: Description et Rôles - En Théorie des Treillis, des Groupes Ordonnés; en Topologie, Théorie des Modèles et des Relations, Cornbinatoire, Effectivité, Sciences Sociales, Actes de la Conférence sur ies Ensembles Ordonnés et leur Applications Château de la Tourette.
Vol. 99,
Issue. ,
p.
343.
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.
Nerode, Anil
and
Harrington, Leo A.
1985.
Harvey Friedman's Research on the Foundations of Mathematics.
Vol. 117,
Issue. ,
p.
1.
Milner, E. C.
1985.
Graphs and Order.
p.
487.
Buchberger, Bruno
1985.
Rewriting Techniques and Applications.
Vol. 202,
Issue. ,
p.
1.