Henry Towsner

Orcid: 0000-0001-7993-5148

According to our database1, Henry Towsner authored at least 27 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
What do ultraproducts remember about the original structures?
J. Log. Comput., 2024

Perfect stable regularity lemma and slice-wise stable hypergraphs.
CoRR, 2024

2023
Borel combinatorics fail in HYP.
J. Math. Log., August, 2023

2020
Constructing sequences one step at a time.
J. Math. Log., 2020

Hypergraph regularity and higher arity VC-dimension.
CoRR, 2020

2018
Relatively exchangeable Structures.
J. Symb. Log., 2018

Epsilon substitution for ID<sub>1</sub> via cut-elimination.
Arch. Math. Log., 2018

Relative exchangeability with equivalence relations.
Arch. Math. Log., 2018

2017
<i>σ</i>-algebras for quasirandom hypergraphs.
Random Struct. Algorithms, 2017

Computable Ramsey's theorem for pairs needs infinitely many Π<sup>2</sup><sub>0</sub> sets.
Arch. Math. Log., 2017

2016
Separating principles below WKL0.
Math. Log. Q., 2016

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

2015
On maximum conservative extensions.
Comput., 2015

Dividing and weak quasi-dimensions in arbitrary theories.
Arch. Math. Log., 2015

Infinitary Methods in Finite Model Theory.
Proceedings of the Logic Without Borders, 2015

2014
Ultrafilters in reverse mathematics.
J. Math. Log., 2014

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.
Bull. Symb. Log., 2014

2013
Partial impredicativity in reverse mathematics.
J. Symb. Log., 2013

Separating Principles below Ramsey's Theorem for Pairs.
J. Math. Log., 2013

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

A correspondence principle for the Gowers norms.
J. Log. Anal., 2012

2011
Hindman's theorem: an ultrafilter argument in second order arithmetic.
J. Symb. Log., 2011

A combinatorial proof of the Dense Hindman's Theorem.
Discret. Math., 2011

2009
Functional interpretation and inductive definitions.
J. Symb. Log., 2009

Ordinal analysis by transformations.
Ann. Pure Appl. Log., 2009

2005
Epsilon substitution for transfinite induction.
Arch. Math. Log., 2005

2004
A realizability interpretation for classical analysis.
Arch. Math. Log., 2004


  Loading...