Guido Gherardi

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 14

Top Topics

Complexity Of Query Evaluation

Top Venues

Ann. Pure Appl. Log.

Publications

Guido Gherardi, Eugenio Orlandelli, Eric Raidl
Proof Systems for Super- Strict Implication. Stud Logica 112 (1-2) (2024)
Guido Gherardi, Eugenio Orlandelli
Non-Normal Super-Strict Implications. NCL (2022)
Vasco Brattka, Guido Gherardi
Completion of choice. Ann. Pure Appl. Log. 172 (3) (2021)
Guido Gherardi, Paolo Maffezioli, Eugenio Orlandelli
Interpolation in Extensions of First-Order Logic. Stud Logica 108 (3) (2020)
Vasco Brattka, Guido Gherardi
Weihrauch Goes Brouwerian. J. Symb. Log. 85 (4) (2020)
Vasco Brattka, Guido Gherardi
Completion of Choice. CoRR (2019)
Guido Gherardi, Alberto Marcone, Arno Pauly
Projection operators in the Weihrauch lattice. Comput. 8 (3-4) (2019)
Vasco Brattka, Guido Gherardi
Weihrauch goes Brouwerian. CoRR (2018)
Vasco Brattka, Guido Gherardi, Arno Pauly
Weihrauch Complexity in Computable Analysis. CoRR (2017)
Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly
The Vitali Covering Theorem in the Weihrauch Lattice. Computability and Complexity (2017)
Vasco Brattka, Andrea Cettolo, Guido Gherardi, Alberto Marcone, Matthias Schröder
Addendum to: "The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma" [Ann. Pure Appl. Logic 163 (6) (2012) 623-655]. Ann. Pure Appl. Log. 168 (8) (2017)
Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly
The Vitali Covering Theorem in the Weihrauch Lattice. CoRR (2016)
Vasco Brattka, Guido Gherardi, Rupert Hölzl
Las Vegas Computability and Algorithmic Randomness. STACS (2015)
Vasco Brattka, Guido Gherardi, Rupert Hölzl
Probabilistic computability and choice. Inf. Comput. 242 (2015)
Vasco Brattka, Rupert Hölzl, Guido Gherardi
Probabilistic Computability and Choice. CoRR (2013)
Vasco Brattka, Guido Gherardi, Alberto Marcone
The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma. Ann. Pure Appl. Log. 163 (6) (2012)
Vasco Brattka, Guido Gherardi
Weihrauch degrees, omniscience principles and weak computability. J. Symb. Log. 76 (1) (2011)
Guido Gherardi
Alan Turing and the foundations of computable analysis. Bull. Symb. Log. 17 (3) (2011)
Vasco Brattka, Guido Gherardi, Alberto Marcone
The Bolzano-Weierstrass Theorem is the Jump of Weak König's Lemma CoRR (2011)
Vasco Brattka, Guido Gherardi
Effective choice and boundedness principles in computable analysis. Bull. Symb. Log. 17 (1) (2011)
Vasco Brattka, Guido Gherardi
Effective Choice and Boundedness Principles in Computable Analysis. CCA (2009)
Vasco Brattka, Guido Gherardi
Weihrauch Degrees, Omniscience Principles and Weak Computability. CCA (2009)
Vasco Brattka, Guido Gherardi
A method to evaluate the computational complexity of the theorems from functional analysis. ICTCS (2009)
Vasco Brattka, Guido Gherardi
Borel Complexity of Topological Operations on Computable Metric Spaces. J. Log. Comput. 19 (1) (2009)
Guido Gherardi, Alberto Marcone
How Incomputable is the Separable Hahn-Banach Theorem? Electron. Notes Theor. Comput. Sci. 221 (2008)
Vasco Brattka, Guido Gherardi
Borel Complexity of Topological Operations on Computable Metric Spaces. CiE (2007)
Guido Gherardi
Internal Computability. CiE (2007)
Guido Gherardi
An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability. CiE (2006)
Guido Gherardi
Effective Borel degrees of some topological functions. Math. Log. Q. 52 (6) (2006)