Thomas Powell

ORCID

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 23

Top Venues

Queen Mary University of London, UK (PHD)

Education History

Queen Mary University of London, UK

PHD

Publications

Thomas Powell
A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory. Ann. Pure Appl. Log. 174 (4) (2023)
Thomas Powell, Peter Schuster, Franziskus Wiesnet
A universal algorithm for Krull's theorem. Inf. Comput. 287 (2022)
Thomas Powell
Dependent choice as a termination principle. Arch. Math. Log. 59 (3-4) (2020)
Thomas Powell
A note on the finitization of Abelian and Tauberian theorems. Math. Log. Q. 66 (3) (2020)
Thomas Powell
A unifying framework for continuity and complexity in higher types. Log. Methods Comput. Sci. 16 (3) (2020)
Ulrich Kohlenbach, Thomas Powell
Rates of convergence for iterative solutions of equations involving set-valued accretive operators. Comput. Math. Appl. 80 (3) (2020)
Thomas Powell
On the computational content of Zorn's lemma. LICS (2020)
Thomas Powell
A computational interpretation of Zorn's lemma. CoRR (2020)
Thomas Powell
Dependent choice as a termination principle. CoRR (2019)
Thomas Powell
A unifying framework for continuity and complexity in higher types. CoRR (2019)
Thomas Powell, Peter M. Schuster, Franziskus Wiesnet
An algorithmic approach to the existence of ideal objects in commutative algebra. CoRR (2019)
Thomas Powell, Peter Schuster, Franziskus Wiesnet
An Algorithmic Approach to the Existence of Ideal Objects in Commutative Algebra. WoLLIC (2019)
Thomas Powell
A proof-theoretic study of abstract termination principles. J. Log. Comput. 29 (8) (2019)
Thomas Powell
Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice. J. Log. Comput. 29 (4) (2019)
Thomas Powell
A functional interpretation with state. LICS (2018)
Thomas Powell
Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs. CoRR (2018)
Thomas Powell
Sequential algorithms and the computational content of classical proofs. CoRR (2018)
Thomas Powell
A proof theoretic study of abstract termination principles. CoRR (2017)
Thomas Powell
Well quasi-orders and the functional interpretation. CoRR (2017)
Paulo Oliva, Thomas Powell
Bar recursion over finite partial functions. Ann. Pure Appl. Log. 168 (5) (2017)
Thomas Powell
Gödel's functional interpretation and the concept of learning. LICS (2016)
Paulo Oliva, Thomas Powell
A constructive interpretation of Ramsey's theorem via the product of selection functions. Math. Struct. Comput. Sci. 25 (8) (2015)
Georg Moser, Thomas Powell
On the Computational Content of Termination Proofs. CiE (2015)
Thomas Powell
The equivalence of bar recursion and open recursion. Ann. Pure Appl. Log. 165 (11) (2014)
Paulo Oliva, Thomas Powell
Bar recursion over finite partial functions. CoRR (2014)
Thomas Powell
Parametrised bar recursion: A unifying framework for realizability interpretations of classical dependent choice. CoRR (2014)
Paulo Oliva, Thomas Powell
A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis CoRR (2012)
Paulo Oliva, Thomas Powell
On Spector's bar recursion. Math. Log. Q. 58 (4-5) (2012)
Paulo Oliva, Thomas Powell
A Constructive Interpretation of Ramsey's Theorem via the Product of Selection Functions CoRR (2012)
Thomas Powell
Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma CL&C (2012)
Martín Hötzel Escardó, Paulo Oliva, Thomas Powell
System T and the Product of Selection Functions. CSL (2011)

Thomas Powell.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Powell