Guido Gherardi

29 papers A 1C 6Journal 19Unranked 3
YearRankTypeTitle / Venue / Authors
2024 J jnl
Proof Systems for Super- Strict Implication.
Stud Logica
Guido Gherardi, Eugenio Orlandelli, Eric Raidl
2022 — conf
Non-Normal Super-Strict Implications.
NCL
Guido Gherardi, Eugenio Orlandelli
2021 J jnl
Completion of choice.
Ann. Pure Appl. Log.
Vasco Brattka, Guido Gherardi
2020 J jnl
Interpolation in Extensions of First-Order Logic.
Stud Logica
Guido Gherardi, Paolo Maffezioli, Eugenio Orlandelli
2020 J jnl
Weihrauch Goes Brouwerian.
J. Symb. Log.
Vasco Brattka, Guido Gherardi
2019 J jnl
Completion of Choice.
CoRR
Vasco Brattka, Guido Gherardi
2019 J jnl
Projection operators in the Weihrauch lattice.
Comput.
Guido Gherardi, Alberto Marcone, Arno Pauly
2018 J jnl
Weihrauch goes Brouwerian.
CoRR
Vasco Brattka, Guido Gherardi
2017 J jnl
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.
Vasco Brattka, Andrea Cettolo, Guido Gherardi, Alberto Marcone, Matthias Schröder
2017 — conf
The Vitali Covering Theorem in the Weihrauch Lattice.
Computability and Complexity
Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly
2017 J jnl
Weihrauch Complexity in Computable Analysis.
CoRR
Vasco Brattka, Guido Gherardi, Arno Pauly
2016 J jnl
The Vitali Covering Theorem in the Weihrauch Lattice.
CoRR
Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly
2015 A conf
Las Vegas Computability and Algorithmic Randomness.
STACS
Vasco Brattka, Guido Gherardi, Rupert Hölzl
2015 J jnl
Probabilistic computability and choice.
Inf. Comput.
Vasco Brattka, Guido Gherardi, Rupert Hölzl
2013 J jnl
Probabilistic Computability and Choice.
CoRR
Vasco Brattka, Rupert Hölzl, Guido Gherardi
2012 J jnl
The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma.
Ann. Pure Appl. Log.
Vasco Brattka, Guido Gherardi, Alberto Marcone
2011 J jnl
Alan Turing and the foundations of computable analysis.
Bull. Symb. Log.
Guido Gherardi
2011 J jnl
Effective choice and boundedness principles in computable analysis.
Bull. Symb. Log.
Vasco Brattka, Guido Gherardi
2011 J jnl
The Bolzano-Weierstrass Theorem is the Jump of Weak König's Lemma
CoRR
Vasco Brattka, Guido Gherardi, Alberto Marcone
2011 J jnl
Weihrauch degrees, omniscience principles and weak computability.
J. Symb. Log.
Vasco Brattka, Guido Gherardi
2009 — conf
A method to evaluate the computational complexity of the theorems from functional analysis.
ICTCS
Vasco Brattka, Guido Gherardi
2009 J jnl
Borel Complexity of Topological Operations on Computable Metric Spaces.
J. Log. Comput.
Vasco Brattka, Guido Gherardi
2009 C conf
Effective Choice and Boundedness Principles in Computable Analysis.
CCA
Vasco Brattka, Guido Gherardi
2009 C conf
Weihrauch Degrees, Omniscience Principles and Weak Computability.
CCA
Vasco Brattka, Guido Gherardi
2008 C conf
How Incomputable is the Separable Hahn-Banach Theorem?
CCA
Guido Gherardi, Alberto Marcone
2007 C conf
Borel Complexity of Topological Operations on Computable Metric Spaces.
CiE
Vasco Brattka, Guido Gherardi
2007 C conf
Internal Computability.
CiE
Guido Gherardi
2006 C conf
An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability.
CiE
Guido Gherardi
2006 J jnl
Effective Borel degrees of some topological functions.
Math. Log. Q.
Guido Gherardi