Guido Gherardi

According to our database, Guido Gherardi authored at least 21 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Proof Systems for Super- Strict Implication.

Guido Gherardi, Eugenio Orlandelli, Eric Raidl

Stud Logica, April, 2024

2022

Non-Normal Super-Strict Implications.

Guido Gherardi, Eugenio Orlandelli

Proceedings of the 10th International Conference on Non-Classical Logics. Theory and Applications, 2022

2021

Completion of choice.

Vasco Brattka, Guido Gherardi

Ann. Pure Appl. Log., 2021

2020

Interpolation in Extensions of First-Order Logic.

Guido Gherardi, Paolo Maffezioli, Eugenio Orlandelli

Stud Logica, 2020

Weihrauch Goes Brouwerian.

Vasco Brattka, Guido Gherardi

J. Symb. Log., 2020

2019

Projection operators in the Weihrauch lattice.

Guido Gherardi, Alberto Marcone, Arno Pauly

Comput., 2019

2017

Weihrauch Complexity in Computable Analysis.

Vasco Brattka, Guido Gherardi, Arno Pauly

CoRR, 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

Ann. Pure Appl. Log., 2017

The Vitali Covering Theorem in the Weihrauch Lattice.

Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly

Proceedings of the Computability and Complexity, 2017

2015

Probabilistic computability and choice.

Vasco Brattka, Guido Gherardi, Rupert Hölzl

Inf. Comput., 2015

Las Vegas Computability and Algorithmic Randomness.

Vasco Brattka, Guido Gherardi, Rupert Hölzl

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2012

The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma.

Vasco Brattka, Guido Gherardi, Alberto Marcone

Ann. Pure Appl. Log., 2012

2011

Weihrauch degrees, omniscience principles and weak computability.

Vasco Brattka, Guido Gherardi

J. Symb. Log., 2011

Alan Turing and the foundations of computable analysis.

Guido Gherardi

Bull. Symb. Log., 2011

Effective choice and boundedness principles in computable analysis.

Vasco Brattka, Guido Gherardi

Bull. Symb. Log., 2011

2009

Borel Complexity of Topological Operations on Computable Metric Spaces.

Vasco Brattka, Guido Gherardi

J. Log. Comput., 2009

A method to evaluate the computational complexity of the theorems from functional analysis.

Vasco Brattka, Guido Gherardi

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008

How Incomputable is the Separable Hahn-Banach Theorem?

Guido Gherardi, Alberto Marcone

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007

Internal Computability.

Guido Gherardi

Proceedings of the Computation and Logic in the Real World, 2007

2006

Effective Borel degrees of some topological functions.

Guido Gherardi

Math. Log. Q., 2006

An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability.

Guido Gherardi

Proceedings of the Logical Approaches to Computational Barriers, 2006