Foto del docente

Guido Gherardi

Associate Professor

Department of Philosophy and Communication Studies

Academic discipline: M-FIL/02 Logic and Philosophy of Science

Publications

vai alle Pubblicazioni

Publications prior to 2004

G. Gherardi: An analysis of the lemmas of Urysohn and Urysohn-Tietze according to effective Borel measurability. In: A. Beckmann, U. Berger, B. Lowe, J. V. Tucker (Eds.) Logical Approaches to Computational Barriers. Lecture Notes in Computer Science. 3988: 199-208. Springer-Verlag. 2006.

 

G. Gherardi: Effective Borel degrees of some topological functions. Mathematical Logic Quarterly. 52(6):625-642. 2006.

 

G. Gherardi: Some results in computable analysis and effective Borel measurability. PhD Thesis. 2006.

 

G.  Gherardi: Internal computability. In: S. B. Cooper, B. Loewe, A. Sorbi (Eds.) Computation and Logic in the Real World. Lecture Notes in Computer Science. 4497: 348-357. Springer-Verlag. 2007.

 

V. Brattka, G. Gherardi: Borel complexity of topological operations on computable metric spaces. In: S. B. Cooper, B. Loewe, A. Sorbi (Eds.) Computation and Logic in the Real World. Lecture Notes in Computer Science. 4497: 83-97. Springer-Verlag. 2007.

 

G. Gherardi: Computability and incomputability of differential  equations. In: R. Lupacchini, G. Corsi (Eds.) Deduction, Computation, Experiment: 223-242. Springer-Verlag. 2008.


G. Gherardi: Paradigmi di computazione per i numeri reali. La Matematica nella Società e nella Cultura.Rivista dell'Unione Matematica Italiana. 1: 525-554. 2008.

 

G. Gherardi, A. Marcone: How incomputable is the separable Hahn-Banach Theorem? Electronic Notes in Theoretical Computer Science 221: 85-102. 2008

 

V. Brattka, G. Gherardi: Borel complexity of topological operations on computable metric spaces. Journal of Logic and Computation. 19(1):45-76. 2009. 

 

G. Gherardi, A. Marcone: How incomputable is the separable Hahn-Banach theorem? Notre Dame Journal of Formal Logic  50(4): 393-425. 2009

 

V. Brattka, G. Gherardi: Effective choice and boundedness principles in computable analysis. The Bulletin of Symbolic Logic 17(1): 73-117. 2011

 

V. Brattka, G. Gherardi: Weihrauch degrees, omniscience principles and weak computability. The Journal of Symbolic Logic 76(1): 143-176. 2011

 

G. Gherardi: Alan Turing and the foundations of computable analysis. The Bulletin of Symbolic Logic 17(3): 394-430. 2011

 

G. Gherardi: La matematica della mente: il pensiero come calcolo in Hobbes e Boole. Discipline Filosofiche XXI 1: 153-177. 2011

 

G. Gherardi: Teoremi dell'analisi e gradi di incomputabilità. In E. Ballo, C. Cellucci (Eds.) “La ricerca logica in Italia. Studi in onore di Corrado Mangione”. Cisalpino editore. 357-378. 2011

 

V. Brattka, G. Gherardi, A. Marcone: The Bolzano-Weierstrass Theorem is the jump of Weak König’s Lemma. Annals of Pure and Applied Logic 163(6): 623-655. 2012

 

V. Brattka, G. Gherardi, R. Hölzl: Las Vegas computability and algorithmic randomness. In: E. W. Mayr, N. Ollinger (Eds.) “32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)”, Leibniz International Proceedings in Informatics (LIPIcs) n.30. Schloss Dagstuhl-Leibniz Zentrum für Informatik. Dagstuhl Publishing. 130-142. 2015

 

V. Brattka, G. Gherardi, R. Hölzl: Probabilistic computability and choice. Information and Computation 242: 249-286. 2015