George Tourlakis

University Professor

Research Interests
  • Logic (classical, calculational, modal);
  • Computability theory (computation with partial function oracles);
  • Complexity theory.
Bio

George received his Ph.D. in Computer Science from the University of Toronto in 1973. His dissertation was on Computational Topology. His current research interests are Logic, Computability and Complexity. He is the author of seven books, Computability (566p., Reston 1984), Introduction to Recursion Theory (140p., Crete University Press 1993), Mathematical Logic (340p., Cambridge University Press 2003), Set Theory (592p., Cambridge University Press 2003), Mathematical Logic (293p., John Wiley & Sons 2008), Mathematical Logic (theory and practise) (260p., Crete University Press 2011) and Theory of Computation (389p., John Wiley & Sons 2012). In his free time George listens to, or plays, Baroque music (violin), or participates in Committees. He was a Senate Representative on the York Board of Governors (1997-1999 and 2010-12), Chair of Senate (1996-1997), Chair of FPAS Council (2001-2002 and 2003-04) and Chair of Senate CCAS and ASCP Committees multiple times (most recently, 2012-2013).

Selected Publications
  • G. Tourlakis (2012) Theory of Computation, John Wiley & Sons, Inc.
  • G. Tourlakis (2011) Mathematical Logic (theory and practise), Crete University Press.
  • G. Tourlakis (2008) Mathematical Logic, John Wiley & Sons, Inc.
  • F. Gao and G. Tourlakis (2016) A short and readable proof of cut elimination for two 1st-order modal logics, to appear in Bulletin of the Section of Logic (BSL), March 2016, 17p.
  • Y. Schwartz and G. Tourlakis (2014) On the Proof-Theory of a First-Order Version of GL, Logic and Logical Philosophy (LLP), 2014, Vol. 23, No. 3, pp. 329-363.
  • Y. Schwartz and G. Tourlakis (2013) A Proof Theoretic Tool for First-Order Modal Logic, Bulletin of the Section of Logic (BSL), Vol. 42, No. 3-4, 2013, pp. 93-110.
  • Y. Schwartz and G. Tourlakis (2011) Pure iteration and substitution as the basis of computability, Bulletin of the Section of Logic (BSL), Vol. 10, No. 3/4, 2011, pp. 203–213.
  • Y. Schwartz and G. Tourlakis (2010) On the Proof-Theory of two Formalisations of Modal First-Order Logic, Studia Logica, Vol. 96, 2010, pp. 349–373.
  • G. Tourlakis (2009) A new foundation of a complete Boolean equational logic, Bulletin of the Section of Logic (BSL), Vol. 38, No. 1, 2009, pp. 1–16.
Staff Information
Stay in Touch