Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Schwichtenberg, Helmut
1998.
Finite notations for infinite terms.
Annals of Pure and Applied Logic,
Vol. 94,
Issue. 1-3,
p.
201.
Weiermann, Andreas
2005.
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results.
Annals of Pure and Applied Logic,
Vol. 136,
Issue. 1-2,
p.
189.
Wilken, Gunnar
and
Weiermann, Andreas
2009.
Typed Lambda Calculi and Applications.
Vol. 5608,
Issue. ,
p.
386.
Wilken, Gunnar
and
Weiermann, Andreas
2012.
Derivation Lengths Classification of G\"odel's T Extending Howard's Assignment.
Logical Methods in Computer Science,
Vol. Volume 8, Issue 1,
Issue. ,
Weiermann, Andreas
2017.
Logic Colloquium '99.
p.
182.
BLANQUI, FRÉDÉRIC
2018.
Size-based termination of higher-order rewriting.
Journal of Functional Programming,
Vol. 28,
Issue. ,
Powell, Thomas
2019.
A proof-theoretic study of abstract termination principles.
Journal of Logic and Computation,
Vol. 29,
Issue. 8,
p.
1345.
Stirton, William R
2022.
Combinatory logic with polymorphic types.
Archive for Mathematical Logic,
Vol. 61,
Issue. 3-4,
p.
317.