Guido Gherardi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2024

Proof Systems for Super- Strict ImplicationGuido Gherardi, Eugenio Orlandelli, Eric Raidl. sLogica, 112(1):249-294, April 2024. [doi]

2021

Completion of choiceVasco Brattka, Guido Gherardi. APAL, 172(3):102914, 2021. [doi]

2020

Weihrauch Goes BrouwerianVasco Brattka, Guido Gherardi. JSYML, 85(4):1614-1653, 2020. [doi]

Interpolation in Extensions of First-Order LogicGuido Gherardi, Paolo Maffezioli, Eugenio Orlandelli. sLogica, 108(3):619-648, 2020. [doi]

2019

Projection operators in the Weihrauch latticeGuido Gherardi, Alberto Marcone, Arno Pauly. computability, 8(3-4):281-304, 2019. [doi]

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. APAL, 168(8):1605-1608, 2017. [doi]

The Vitali Covering Theorem in the Weihrauch LatticeVasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly. BIRTHDAY 2017: 188-200 [doi]

2015

Probabilistic computability and choiceVasco Brattka, Guido Gherardi, Rupert Hölzl. iandc, 242:249-286, 2015. [doi]

Las Vegas Computability and Algorithmic RandomnessVasco Brattka, Guido Gherardi, Rupert Hölzl. STACS 2015: 130-142 [doi]

2012

The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's LemmaVasco Brattka, Guido Gherardi, Alberto Marcone. APAL, 163(6):623-655, 2012. [doi]

2011

Effective choice and boundedness principles in computable analysisVasco Brattka, Guido Gherardi. bsl, 17(1):73-117, 2011. [doi]

Weihrauch degrees, omniscience principles and weak computabilityVasco Brattka, Guido Gherardi. JSYML, 76(1):143-176, 2011. [doi]

Alan Turing and the foundations of computable analysisGuido Gherardi. bsl, 17(3):394-430, 2011. [doi]

2009

Borel Complexity of Topological Operations on Computable Metric SpacesVasco Brattka, Guido Gherardi. logcom, 19(1):45-76, 2009. [doi]

Weihrauch Degrees, Omniscience Principles and Weak ComputabilityVasco Brattka, Guido Gherardi. cca 2009: [doi]

Effective Choice and Boundedness Principles in Computable AnalysisVasco Brattka, Guido Gherardi. cca 2009: [doi]

A method to evaluate the computational complexity of the theorems from functional analysisVasco Brattka, Guido Gherardi. ictcs 2009: 59-61

2008

How Incomputable is the Separable Hahn-Banach Theorem?Guido Gherardi, Alberto Marcone. ENTCS, 221:85-102, 2008. [doi]

2007

Borel Complexity of Topological Operations on Computable Metric SpacesVasco Brattka, Guido Gherardi. cie 2007: 83-97 [doi]

Internal ComputabilityGuido Gherardi. cie 2007: 348-357 [doi]

2006

Effective Borel degrees of some topological functionsGuido Gherardi. mlq, 52(6):625-642, 2006. [doi]

An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel MeasurabilityGuido Gherardi. cie 2006: 199-208 [doi]

Sign in or sign up to see more results.

runs on WebDSL