default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Powell 0001
Person information
- affiliation: University of Bath, Bath, Somerset, UK
- affiliation (former): TU Darmstadt, Germany
- affiliation (former): University of Innsbruck, Austria
- affiliation (former): Queen Mary University of London, UK
Other persons with the same name
- Thomas Powell — disambiguation page
- Thomas Powell 0002 — Philadelphia, PA, USA
- Thomas Powell 0003 — University of Arkansas for Medical Sciences, Little Rock, AR, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Thomas Powell
:
Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language. Log. Methods Comput. Sci. 20(1) (2024)- 2023
- [j12]Thomas Powell:
A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory. Ann. Pure Appl. Log. 174(4): 103231 (2023) - 2022
- [j11]Thomas Powell, Peter Schuster, Franziskus Wiesnet:
A universal algorithm for Krull's theorem. Inf. Comput. 287: 104761 (2022) - 2020
- [j10]Thomas Powell:
Dependent choice as a termination principle. Arch. Math. Log. 59(3-4): 503-516 (2020) - [j9]Ulrich Kohlenbach, Thomas Powell:
Rates of convergence for iterative solutions of equations involving set-valued accretive operators. Comput. Math. Appl. 80(3): 490-503 (2020) - [j8]Thomas Powell:
A unifying framework for continuity and complexity in higher types. Log. Methods Comput. Sci. 16(3) (2020) - [j7]Thomas Powell:
A note on the finitization of Abelian and Tauberian theorems. Math. Log. Q. 66(3): 300-310 (2020) - [c7]Thomas Powell:
On the computational content of Zorn's lemma. LICS 2020: 768-781 - [i12]Thomas Powell:
A computational interpretation of Zorn's lemma. CoRR abs/2001.03540 (2020)
2010 – 2019
- 2019
- [j6]Thomas Powell:
Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice. J. Log. Comput. 29(4): 519-554 (2019) - [j5]Thomas Powell:
A proof-theoretic study of abstract termination principles. J. Log. Comput. 29(8): 1345-1366 (2019) - [c6]Thomas Powell, Peter Schuster, Franziskus Wiesnet:
An Algorithmic Approach to the Existence of Ideal Objects in Commutative Algebra. WoLLIC 2019: 533-549 - [i11]Thomas Powell:
Dependent choice as a termination principle. CoRR abs/1902.09539 (2019) - [i10]Thomas Powell, Peter M. Schuster, Franziskus Wiesnet:
An algorithmic approach to the existence of ideal objects in commutative algebra. CoRR abs/1903.03070 (2019) - [i9]Thomas Powell:
A unifying framework for continuity and complexity in higher types. CoRR abs/1906.10719 (2019) - 2018
- [c5]Thomas Powell:
A functional interpretation with state. LICS 2018: 839-848 - [i8]Thomas Powell:
Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs. CoRR abs/1812.05851 (2018) - [i7]Thomas Powell:
Sequential algorithms and the computational content of classical proofs. CoRR abs/1812.11003 (2018) - 2017
- [j4]Paulo Oliva, Thomas Powell:
Bar recursion over finite partial functions. Ann. Pure Appl. Log. 168(5): 887-921 (2017) - [i6]Thomas Powell:
Well quasi-orders and the functional interpretation. CoRR abs/1706.02881 (2017) - [i5]Thomas Powell:
A proof theoretic study of abstract termination principles. CoRR abs/1706.03577 (2017) - 2016
- [c4]Thomas Powell:
Gödel's functional interpretation and the concept of learning. LICS 2016: 136-145 - 2015
- [j3]Paulo Oliva, Thomas Powell:
A constructive interpretation of Ramsey's theorem via the product of selection functions. Math. Struct. Comput. Sci. 25(8): 1755-1778 (2015) - [c3]Georg Moser, Thomas Powell:
On the Computational Content of Termination Proofs. CiE 2015: 276-285 - 2014
- [j2]Thomas Powell:
The equivalence of bar recursion and open recursion. Ann. Pure Appl. Log. 165(11): 1727-1754 (2014) - [i4]Paulo Oliva, Thomas Powell:
Bar recursion over finite partial functions. CoRR abs/1410.6361 (2014) - [i3]Thomas Powell:
Parametrised bar recursion: A unifying framework for realizability interpretations of classical dependent choice. CoRR abs/1411.0457 (2014) - 2013
- [b1]Thomas Powell:
On bar recursive interpretations of analysis. Queen Mary University of London, UK, 2013 - 2012
- [j1]Paulo Oliva, Thomas Powell:
On Spector's bar recursion. Math. Log. Q. 58(4-5): 356-265 (2012) - [c2]Thomas Powell:
Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma. CL&C 2012: 49-62 - [i2]Paulo Oliva, Thomas Powell:
A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis. CoRR abs/1204.5244 (2012) - [i1]Paulo Oliva, Thomas Powell:
A Constructive Interpretation of Ramsey's Theorem via the Product of Selection Functions. CoRR abs/1204.5631 (2012) - 2011
- [c1]Martín Hötzel Escardó, Paulo Oliva, Thomas Powell:
System T and the Product of Selection Functions. CSL 2011: 233-247
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-14 19:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
