11th Panhellenic Logic Symposium

July 12-16, 2017
Delphi, Greece

Invited Talks

  • Zoé Chatzidakis, Ecole Normale Supérieure, Paris, France
  • Hannes Leitgeb, Ludwig-Maximilians-Universität München, Germany
  • Yiannis Moschovakis, University of California, Los Angeles, USA

    Intrinsic Complexity

  • Andrea Sorbi, Università di Siena, Italy

    Computability Relative to Imperfect Databases

  • Wolfgang Thomas, Rheinisch-Westfälische Technische Hochschule, Aachen, Germany

    Algorithmic Results on Infinite Games: From the Cantor Space to the Baire Space

  • Timothy Williamson, University of Oxford, UK


Special Session: Model Theory

Organized by:

Invited special session speakers:

Special Session: Computability Theory

Organized by:

Invited special session speakers:

  • Damir Dzhafarov, University of Connecticut, USA
  • Ekaterina Fokina, Vienna University of Technology, Austria
  • Andy Lewis-Pye, London School of Economics, UK
  • Joseph Miller, University of Wisconsin, Madison, USA

    Characterizing the Continuous Degrees

  • Antonio Montalban, University of California, Berkeley, USA

    Computability Theory on a Cone

  • Paul Shafer, University of Gent, Belgium

    The Reverse Mathematics of Caristi's Fixed Point Theorem