**Yiannis N. Moschovakis. Some lectures. **

Three lectures in Fortaleza, September 24 - 28, 2018

Recursive algorithms from specified primitives

Some foundational questions (and some answers) about algorithms

A survey of the origins and development of Descriptive Set Theory

Intrinsic Complexity
Panhellenic Logic Symposium (PLS11), Delphi, July 12 - 16, 2017

Intuitionism and effective descriptive set theory,
*L. E. J. Brouwer, fifty years later, 9 December 2016*, lecture based on
joint work with Joan R. Moschovakis.

Intrinsic complexities, at the Logic Seminar of the Institute
of Mathematics in Prague, February 8, 2016.

This is an updated
and completed version of the lecture on this topic given on
March 30, 2013 in Bristol, below.

Tutorial in *Effective descriptive set theory* in
Winter School 2016, Hehnice, Czech Republic, January 30 -
February 6, 2016, Lecture 1,
Lecture 2,
Lecture 3.

**Correction of typo in slide 19 of Lecture 1**.

Two of the Lindström Lectures, Gothenburg, 23 and 24 October, 2014.
The other two were given by Joan Rand Moschovakis.

Frege's sense and denotation as algorithm and value
and A theory of logical form, meaning and synonymy

Το πρόβλημα της αντικειμενικής αλήθειας στη θεωρία συνόλων
ΜΙΘΕ monthly seminar, 14 October, 2014

The Normed Induction Theorem
Given at the Soskov meeting in Gjuletchica, 20 September, 2014,
and at a meeting in honor of Costas Dimitracopoulos in Athens, 3 October, 2014

What is an algorithm?
A two-hour tutorial given at the *Proof, Truth, Computation*
summer school in Chiemsee, July 21 - 25, 2014.

The logical form and meaning of attitudinal sentences
SoCal PhilMath + PhilLogic + FoM workshop at UC Irvine,
February 22, 2014.

Effective descriptive set theory
Mostowski 100 meeting, Warsaw,
October 13, 2013.

Intrinsic complexity in arithmetic and algebra
Workshop #2 on the limits and scope of mathematical knowledge,
Bristol University, March 30, 2013.

(This replaces several earlier lectures on this topic posted here,
some of which contained one "result" which is now again open.)

The Church-Turing Thesis and relative recursion The Heyting lecture,
given in Amsterdam, September 7, 2012.

On defining "algorithm" - why and how?
The slides from my lecture on the panel discussion on
"What is an algorithm", at the CLMPS meeting in Nancy, France,
July 20, 2011

A logic of meaning and synonymy
The slides from a short course given with Fritz Hamm in ESSLLI,
Copenhagen, August 9 - 13, 2010

Ο Ευκλείδειος αλγόριθμος και μερικοί συγγενείς του
Talk in the Patras Estia Epistimon, July 5, 2010, in Greek.

The axiomatic derivation of absolute lower bounds,
Lecture in Iowa State University (to the Mathematics
and Computer Science Departments), April 15, 2010.
(A revised and improved version of the 2009 LICS lecture below.)

Kleene's amazing second recursion theorem,
CSL 2009, Coimbra, September 11, 2009.

English as a programming language?,
ESSLLI 2009, Evening lecture, July 23, 2009.

The
axiomatic derivation of absolute lower bounds,
LICS, Carnegie Mellon, 27 June, 2008. (A revised and improved version of the third Tarski
lecture below).

Solving
equations in algebra and in arithmetic
Talk to students at the Carnegie Mellon Summer School, 26 June, 2008.
(A revised version of 7 below, in English)

Εξισώσεις
στην άλγεβρα και στην αριθμητική. Talk to
students, Department of Mathematics, University of Thessaloniki, May
26, 2008 (in Greek). (Η σελίδα 9 δίνει τη σωστή
απάντηση σε μια ερώτηση που δεν απάντησα σωστά στη διάλεξη).

Ανεπίλυτα
και δυσεπίλυτα μαθηματικά προβλήματα: λογική, πληροφορική και
mastercard

Herakleion, Crete, May 20, 2008 (in
Greek)

Αξιωματικές
αποδείξεις καθολικών κάτω φραγμάτων. Department of
Mathematics, University of Crete, May 20, 2008 (in Greek).

The Tarski Lectures, March 3 - 7, 2008.

Lecture 1. Algorithms and implementations

Lecture 2. English as a programming language>

Lecture 3. The axiomatic derivation of absolute lower bounds>

Deduction
and semantics workshop, Stuttgart, 10 October 2007