You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Cambridge » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Cambridge

Return to search Previous output Next output

Output 29 of 184 in the submission

Article title

Closed choice and a Uniform Low Basis Theorem

Type

D - Journal article

DOI

10.1016/j.apal.2011.12.020

Title of journal

Annals of Pure and Applied Logic

Article number

Volume number

163

Issue number

First page of article

986

ISSN of journal

0168-0072

Year of publication

2012

URL

Number of additional authors

Additional information

<11> The article developed the fundamental theory of closed choice operators in the Weihrauch lattice. By now, this has found applications both for classifying theorems by computational content in a metamathematical approach; as well as for proving computability of operations e.g. in computable measure theory via non-deterministic computability.

Interdisciplinary

Cross-referral requested

Research group

None

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract