The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Guido Gherardi" ( http://dblp.L3S.de/Authors/Guido_Gherardi )

  Author page on DBLP  Author page in RDF  Community of Guido Gherardi in ASPL-2

Publication years (Num. hits)
2006-2012 (13)
Publication types (Num. hits)
article(7) inproceedings(6)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 2 keywords

Results
Found 13 publication records. Showing 13 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Vasco Brattka, Guido Gherardi, Alberto Marcone The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vasco Brattka, Guido Gherardi Weihrauch degrees, omniscience principles and weak computability. Search on Bibsonomy J. Symb. Log. The full citation details ... 2011 DBLP  BibTeX  RDF
1Vasco Brattka, Guido Gherardi Effective choice and boundedness principles in computable analysis. Search on Bibsonomy Bulletin of Symbolic Logic The full citation details ... 2011 DBLP  BibTeX  RDF
1Vasco Brattka, Guido Gherardi, Alberto Marcone The Bolzano-Weierstrass Theorem is the Jump of Weak König's Lemma Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Vasco Brattka, Guido Gherardi Borel Complexity of Topological Operations on Computable Metric Spaces. Search on Bibsonomy J. Log. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Vasco Brattka, Guido Gherardi A method to evaluate the computational complexity of the theorems from functional analysis. Search on Bibsonomy ICTCS The full citation details ... 2009 DBLP  BibTeX  RDF
1Vasco Brattka, Guido Gherardi Weihrauch Degrees, Omniscience Principles and Weak Computability. Search on Bibsonomy CCA The full citation details ... 2009 DBLP  BibTeX  RDF
1Vasco Brattka, Guido Gherardi Effective Choice and Boundedness Principles in Computable Analysis. Search on Bibsonomy CCA The full citation details ... 2009 DBLP  BibTeX  RDF
1Guido Gherardi, Alberto Marcone How Incomputable is the Separable Hahn-Banach Theorem? Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Vasco Brattka, Guido Gherardi Borel Complexity of Topological Operations on Computable Metric Spaces. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF effective descriptive set theory, Borel measurability, hyperspace topologies, Computable analysis
1Guido Gherardi Internal Computability. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Nonstandard Analysis, Type-2 Theory of Effectivity, Theory of Representations, Computable Analysis, Constructive Mathematics
1Guido Gherardi Effective Borel degrees of some topological functions. Search on Bibsonomy Math. Log. Q. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Guido Gherardi An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Borel Measurability, Urysohn Lemma, Urysohn-Tietze Lemma, Computable Analysis
Displaying result #1 - #13 of 13 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.