An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability. - Guido Gherardi (CiE, 2006)

Effective Borel degrees of some topological functions. - Guido Gherardi (Math. Log. Q., 2006)

Internal Computability. - Guido Gherardi (CiE, 2007)

How Incomputable is the Separable Hahn-Banach Theorem? - Guido Gherardi; Alberto Marcone (CCA, 2008)

A method to evaluate the computational complexity of the theorems from functional analysis. - Vasco Brattka; Guido Gherardi (ICTCS, 2009)

Borel Complexity of Topological Operations on Computable Metric Spaces. - Vasco Brattka; Guido Gherardi (J. Log. Comput., 2009)

Effective choice and boundedness principles in computable analysis. - Vasco Brattka; Guido Gherardi (Bull. Symb. Log., 2011)

Alan Turing and the foundations of computable analysis. - Guido Gherardi (Bull. Symb. Log., 2011)

Weihrauch degrees, omniscience principles and weak computability. - Vasco Brattka; Guido Gherardi (J. Symb. Log., 2011)

The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma. - Vasco Brattka; Guido Gherardi; Alberto Marcone (Ann. Pure Appl. Log., 2012)

Las Vegas Computability and Algorithmic Randomness. - Vasco Brattka; Guido Gherardi; Rupert Hölzl 001 (STACS, 2015)

Probabilistic computability and choice. - Vasco Brattka; Guido Gherardi; Rupert Hölzl 001 (Inf. Comput., 2015)

The Vitali Covering Theorem in the Weihrauch Lattice. - Vasco Brattka; Guido Gherardi; Rupert Hölzl 001; Arno Pauly (Computability and Complexity, 2017)

Addendum to: "The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma" [Ann. Pure Appl. Logic 163 (6) (2012) 623-655]. - Vasco Brattka; Andrea Cettolo; Guido Gherardi; Alberto Marcone; Matthias Schröder 001 (Ann. Pure Appl. Log., 2017)

Weihrauch Complexity in Computable Analysis. - Vasco Brattka; Guido Gherardi; Arno Pauly (CoRR, 2017)

Projection operators in the Weihrauch lattice. - Guido Gherardi; Alberto Marcone; Arno Pauly (Comput., 2019)

Weihrauch Goes Brouwerian. - Vasco Brattka; Guido Gherardi (J. Symb. Log., 2020)

Interpolation in Extensions of First-Order Logic. - Guido Gherardi; Paolo Maffezioli; Eugenio Orlandelli (Stud Logica, 2020)

Completion of choice. - Vasco Brattka; Guido Gherardi (Ann. Pure Appl. Log., 2021)

Non-Normal Super-Strict Implications. - Guido Gherardi; Eugenio Orlandelli (NCL, 2022)

Proof Systems for Super- Strict Implication. - Guido Gherardi; Eugenio Orlandelli; Eric Raidl (Stud Logica, 2024)