Thomas Powell
Orcid: 0000-0002-2541-4678Affiliations:
- University of Bath, Bath, Somerset, UK
- TU Darmstadt, Germany (former)
- University of Innsbruck, Austria (former)
- Queen Mary University of London, UK (former)
According to our database1,
Thomas Powell
authored at least 26 papers
between 2011 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory.
Ann. Pure Appl. Log., April, 2023
2022
2020
Log. Methods Comput. Sci., 2020
Rates of convergence for iterative solutions of equations involving set-valued accretive operators.
Comput. Math. Appl., 2020
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020
2019
Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice.
J. Log. Comput., 2019
Proceedings of the Logic, Language, Information, and Computation, 2019
2018
Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs.
CoRR, 2018
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018
2017
2016
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016
2015
A constructive interpretation of Ramsey's theorem via the product of selection functions.
Math. Struct. Comput. Sci., 2015
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015
2014
Parametrised bar recursion: A unifying framework for realizability interpretations of classical dependent choice.
CoRR, 2014
2013
2012
Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma
Proceedings of the Proceedings Fourth Workshop on Classical Logic and Computation, 2012
CoRR, 2012
2011
Proceedings of the Computer Science Logic, 2011