MOSCHOVAKIS, YIANNIS N. / Mathematics / Researchers

International Center for Scientific Research

Researchers

Mathematics / MOSCHOVAKIS, YIANNIS N.

ynmmath.ucla.edu

Position

Professor at Department of Mathematics, University of California at Los Angeles, Los Angeles, USA
and Department of Mathematics, University of Athens, Athens, Greece.

Research interests

Moschovakis is a mathematical logician, and most of his research has been in recursion theory, descriptive set theory and the foundations of computer science.

Publications

Αλγοριθμική σημασιολογία: το νόημα ως προσδιορισμός αναφοράς (Algorithmic semantics: meaning as referential intension), with Eleni Kalyvianaki. In Greek.
To appar in a volume of articles which will be published by the Greek Mathematical Society. Posted on August 31, 2004.

Is the Euclidean algorithm optimal among its peers?, with Lou van den Dries, Postscript file, 28 pages. To appear in the Bulletin of Symbolic Logic.

A logical calculus of meaning and synonymy, a corrected and edited version of a set of notes for a course in NASSLLI '03. PDF file, 47 pages, posted July 3, 2003.

On primitive recursive algorithms and the greatest common divisor function , Theoretical Computer Science, v. 301 (2003), p. 1 -- 30. Postscript file, 24 pages,.

What is an algorithm? Postscript file, 19 pages, Mathematics unlimited -- 2001 and beyond, edited by B. Engquist and W. Schmid, Springer, 2001, pages 919-936.

Mathematical logic Postscript file, 26 pages, Encyclopedia of Physical Science and Engineering.

The logic of recursive equations, with A. J. Hurkens, Monica McArthur, Lawrence Moss and Glen Whitney. Postscript file, 28 pages. The Journal of Symbolic Logic, vol. 63 (1998), pages 451 - 478.

A game-theoretic, concurrent and fair model of the typed lambda-calculus, with full recursion, Postscript file, 19 pages. Published in Computer Science Logic, 11th Interenational Workshop, CSL '97, edited by Mogens Nielsen and Wolfgang Thomas, Lecture Notes in Computer Science #1414, Springer, 1998, pp. 341 - 359.

On founding the theory of algorithms, Postscript file, 32 pages. Published in Truth in mathematics, edited by H. G. Dales and G. Oliveri, Clarendon Press, Oxford 1998, pp. 71 - 104.

Συνέντευξη στο Quantum (Interview in the Greek edition of Quantum, published in the July-August issue of 1997). In Greek.

The logic of functional recursion, Postscript file, 29 pages. Published in Logic and scientific methods, M. L. Dalla Chiara et al, eds. Kluwer Academic Publishers, 1997, pages 179-207.

Computable concurrent processes, .dvi file, 31 pages. Published in Theoretical Computer Science, v. 139 (1995), pages 243--273.

Powerdomains, powerstructures and fairness, with Glen T. Whitney, .dvi file, 15 pages. Published in Computer Science Logic, L. Pacholski and J. Tiuryn, eds. Springer LNCS #933, 1995, pages 382-396.

Sense and denotation as algorithm and value, Postscript file, 39 pages. In PDF format. Published in Lecture Notes in Logic, #2 (1994), Springer J. Oikkonen and J. Vaananen, eds. pages 210-249.

A mathematical modeling of pure, recursive algorithms, .dvi file, 22 pages. Published in Logic at Botik '89, A. R. Meyer and M. A. Taitslin, eds. LNCS # 363 (1989).

Legal notice - Contact

Copyright © 2013 - www.cirs.info - All rights reserved