A realizability interpretation for classical analysis. - Henry Towsner (Arch. Math. Log., 2004)

Epsilon substitution for transfinite induction. - Henry Towsner (Arch. Math. Log., 2005)

Ordinal analysis by transformations. - Henry Towsner (Ann. Pure Appl. Log., 2009)

Functional interpretation and inductive definitions. - Jeremy Avigad; Henry Towsner (J. Symb. Log., 2009)

A combinatorial proof of the Dense Hindman's Theorem. - Henry Towsner (Discret. Math., 2011)

Hindman's theorem: an ultrafilter argument in second order arithmetic. - Henry Towsner (J. Symb. Log., 2011)

A correspondence principle for the Gowers norms. - Henry Towsner (J. Log. Anal., 2012)

A Simple Proof and Some Difficult Examples for Hindman's Theorem. - Henry Towsner (Notre Dame J. Formal Log., 2012)

Separating Principles below Ramsey's Theorem for Pairs. - Manuel Lerman; Reed Solomon; Henry Towsner (J. Math. Log., 2013)

Partial impredicativity in reverse mathematics. - Henry Towsner (J. Symb. Log., 2013)

Antonio Montalbán, Indecomposable linear orderings and hyperarithmetic analysis. Journal of Mathematical Logic, vol.6 (2006), no. 1, pp. 89-120. - Itay Neeman, The strength of Jullien's indecomposability theorem. Journal of Mathematical Logic, vol. 8 (2008), no. 1, pp. 93-119. - Itay Neeman, Necessary use ofinduction in a reversal. Journal of Symbolic Logic, vol. 76 (2011), no. 2, pp. 561-574. - Henry Towsner (Bull. Symb. Log., 2014)

Ultrafilters in reverse mathematics. - Henry Towsner (J. Math. Log., 2014)

Infinitary Methods in Finite Model Theory. - Steven Lindell; Henry Towsner; Scott Weinstein (Logic Without Borders, 2015)

Dividing and weak quasi-dimensions in arbitrary theories. - Isaac Goldbring; Henry Towsner (Arch. Math. Log., 2015)

On maximum conservative extensions. - Henry Towsner (Comput., 2015)

Reinhard Kahle and Michael Rathjen, editors, Gentzen's Centenary: The Quest for Consistency, Springer, 2015. - Henry Towsner (Bull. Symb. Log., 2016)

Separating principles below WKL0. - Stephen Flood; Henry Towsner (Math. Log. Q., 2016)

Computable Ramsey's theorem for pairs needs infinitely many Π20 sets. - Gregory Igusa; Henry Towsner (Arch. Math. Log., 2017)

σ-algebras for quasirandom hypergraphs. - Henry Towsner (Random Struct. Algorithms, 2017)

Relative exchangeability with equivalence relations. - Harry Crane; Henry Towsner (Arch. Math. Log., 2018)

Epsilon substitution for ID1 via cut-elimination. - Henry Towsner (Arch. Math. Log., 2018)

Relatively exchangeable Structures. - Harry Crane; Henry Towsner (J. Symb. Log., 2018)

Hypergraph regularity and higher arity VC-dimension. - Artem Chernikov; Henry Towsner (CoRR, 2020)

Constructing sequences one step at a time. - Henry Towsner (J. Math. Log., 2020)

Borel combinatorics fail in HYP. - Henry Towsner; Rose Weisshaar; Linda Westrick (J. Math. Log., 2023)

Perfect stable regularity lemma and slice-wise stable hypergraphs. - Artem Chernikov; Henry Towsner (CoRR, 2024)

What do ultraproducts remember about the original structures? - Henry Towsner (J. Log. Comput., 2024)

Proofs that Modify Proofs, 1/2. - Henry Towsner (CoRR, 2025)