Thomas Powell

Learn More
Diagnosis of the type of glomerular disease that causes the nephrotic syndrome is necessary for appropriate treatment and typically requires a renal biopsy. The goal of this study was to identify candidate protein biomarkers to diagnose glomerular diseases. Proteomic methods and informatic analysis were used to identify patterns of urine proteins that are(More)
We show that the finite product of selection functions (for all finite types) is primitive recursively equivalent to Gödel’s higher-type recursor (for all finite types). The correspondence is shown to hold for similar restricted fragments of both systems: The recursor for type level n+1 is primitive recursively equivalent to the finite product of selection(More)
We use Gödel's Dialectica interpretation to analyse Nash-Williams' elegant but non-constructive 'minimal bad sequence' proof of Higman's Lemma. The result is a concise constructive proof of the lemma (for arbitrary decidable well-quasi-orders) in which Nash-Williams' combinatorial idea is clearly present, along with an explicit program for finding an(More)
Acute kidney injury (AKI) is a process that can lead to renal failure. No biological markers are available for predicting the cause or prognosis of AKI. Tests that can predict which patients will need renal replacement therapy (RRT) are needed. In this chapter, we review the recent literature for proteomic analysis in AKI and identify new candidate markers(More)
Acute kidney injury (AKI) is an important cause of death among hospitalized patients. The 2 most common causes of AKI are acute tubular necrosis (ATN) and prerenal azotemia (PRA). Appropriate diagnosis of the disease is important but often difficult. We analyzed urine proteins by 2-dimensional gel electrophoresis from 38 patients with AKI. Patients were(More)
We show that Spector’s “restricted” form of bar recursion is sufficient (over system T ) to define Spector’s search functional. This new result is then used to show that Spector’s restricted form of bar recursion is in fact as general as the supposedly more general form of bar recursion. Given that these two forms of bar recursion correspond to the(More)
It is shown in [5, 7] that a functional interpretation of proofs in mathematical analysis can be given by the product of selection functions, a mode of recursion that has an intuitive reading in terms of the computation of optimal strategies in sequential games. We argue that this result has genuine practical value by interpreting some well-known theorems(More)
We use Gödel’s dialectica interpretation to produce a computational version of the well known proof of Ramsey’s theorem by Erdős and Rado. Our proof makes use of the product of selection functions, which forms an intuitive alternative to Spector’s bar recursion when interpreting proofs in analysis. This case study is another instance of the application of(More)