9 citations · 28 across the 16 of their papers we have counts for
19 papers
Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
Thomas Powell
We introduce an extension of first-order logic that comes equipped with additional predicates for reasoning about an abstract state. Sequents in the logic comprise a main formula t…
A computational study of a class of recursive inequalities
Morenikeji Neri, Thomas Powell
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and c…
Rates of convergence for asymptotically weakly contractive mappings in normed spaces
Thomas Powell, Franziskus Wiesnet
We study Krasnoselskii-Mann style iterative algorithms for approximating fixpoints of asymptotically weakly contractive mappings, with a focus on providing generalised convergence…
On the computational content of Zorn's lemma
Thomas Powell
We give a computational interpretation to an abstract instance of Zorn's lemma formulated as a wellfoundedness principle in the language of arithmetic in all finite types. This is…
A note on the finitization of Abelian and Tauberian theorems
Thomas Powell
We present finitary formulations of two well known results concerning infinite series, namely Abel's theorem, which establishes that if a series converges to some limit then its Ab…
Rates of convergence for iterative solutions of equations involving set-valued accretive operators
Ulrich Kohlenbach, Thomas Powell
This paper studies proofs of strong convergence of various iterative algorithms for computing the unique zeros of set-valued accretive operators that also satisfy some weak form of…