Yiannis N. Moschovakis

Affiliations:
  • University of California, Los Angeles, CA, USA
  • University of Athens, Panepistimioupolis, Athens, Greece


According to our database1, Yiannis N. Moschovakis authored at least 26 papers between 1969 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Hyperarithmetical Sets.
Proceedings of the Martin Davis on Computability, 2016

2011
Preface.
Ann. Pure Appl. Log., 2011

2010
Kleene's amazing Second Recursion Theorem.
Bull. Symb. Log., 2010

Classical descriptive set theory as a refinement of effective descriptive set theory.
Ann. Pure Appl. Log., 2010

2009
Arithmetic complexity.
ACM Trans. Comput. Log., 2009

2008
The Axiomatic Derivation of Absolute Lower Bounds.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Elementary induction on abstract structures.
Dover Publications, ISBN: 978-0-486-46678-1, 2008

2006
Notes on set theory, Second Edition.
Undergraduate texts in mathematics, Springer, ISBN: 978-0-387-28723-2, 2006

2005
Recursion and Complexity.
Proceedings of the New Computational Paradigms, 2005

2004
Is the Euclidean algorithm optimal among its peers?
Bull. Symb. Log., 2004

2003
On primitive recursive algorithms and the greatest common divisor function.
Theor. Comput. Sci., 2003

1998
The Logic of Recursive Equations.
J. Symb. Log., 1998

1997
A Game-Theoretic, Concurrent and Fair Model of the Typed Lambda-calculus, with Full Recursion.
Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1995
Computable Concurrent Processes.
Theor. Comput. Sci., 1995

1994
Powerdomains, Powerstructures and Fairness.
Proceedings of the Computer Science Logic, 8th International Workshop, 1994

1991
A Model of Concurrency with Fair Merge and Full Recursion
Inf. Comput., July, 1991

1990
Computable processes.
Proceedings of the Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990

1989
The Formal Language of Recursion.
J. Symb. Log., 1989

A Game-Theoretic Modeling of Concurrency
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

A Mathematical Modeling of Pure, Recursive Algorithms.
Proceedings of the Logic at Botik '89, 1989

1983
Meeting of the Association for Symbolic Logic: San Francisco, 1981.
J. Symb. Log., 1983

1979
The Kleene Symposium and the Summer Meeting of the Association for Symbolic Logic.
J. Symb. Log., 1979

1978
Global Inductive Definability.
J. Symb. Log., 1978

1971
The Next Admissible Set.
J. Symb. Log., 1971

1969
Abstract Computability and Invariant Definability.
J. Symb. Log., 1969

Meeting of the Association for Symbolic Logic.
J. Symb. Log., 1969


  Loading...