Yiannis N. Moschovakis

27 papers A* 3B 3C 1Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2016 — ch.
Hyperarithmetical Sets.
Martin Davis on Computability, Computational Logic, and Mathematical Foundations
Yiannis N. Moschovakis
2011 J jnl
Preface.
Ann. Pure Appl. Log.
Joan Bagaria, Yiannis N. Moschovakis, Margarita Otero, Ivan N. Soskov
2010 J jnl
Classical descriptive set theory as a refinement of effective descriptive set theory.
Ann. Pure Appl. Log.
Yiannis N. Moschovakis
2010 J jnl
Kleene's amazing Second Recursion Theorem.
Bull. Symb. Log.
Yiannis N. Moschovakis
2009 J jnl
Arithmetic complexity.
ACM Trans. Comput. Log.
Lou van den Dries, Yiannis N. Moschovakis
2009 B conf
Kleene's Amazing Second Recursion Theorem.
CSL
Yiannis N. Moschovakis
2008 — book
Elementary induction on abstract structures.
Yiannis N. Moschovakis
2008 A* conf
The Axiomatic Derivation of Absolute Lower Bounds.
LICS
Yiannis N. Moschovakis
2006 — book
Notes on set theory, Second Edition.
Yiannis N. Moschovakis
2005 C conf
Recursion and Complexity.
CiE
Yiannis N. Moschovakis
2004 J jnl
Is the Euclidean algorithm optimal among its peers?
Bull. Symb. Log.
Lou van den Dries, Yiannis N. Moschovakis
2003 J jnl
On primitive recursive algorithms and the greatest common divisor function.
Theor. Comput. Sci.
Yiannis N. Moschovakis
1998 J jnl
The Logic of Recursive Equations.
J. Symb. Log.
Antonius J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence S. Moss, Glen T. Whitney
1997 B conf
A Game-Theoretic, Concurrent and Fair Model of the Typed Lambda-calculus, with Full Recursion.
CSL
Yiannis N. Moschovakis
1995 J jnl
Computable Concurrent Processes.
Theor. Comput. Sci.
Yiannis N. Moschovakis
1994 B conf
Powerdomains, Powerstructures and Fairness.
CSL
Yiannis N. Moschovakis, Glen T. Whitney
1991 J jnl
A Model of Concurrency with Fair Merge and Full Recursion
Inf. Comput.
Yiannis N. Moschovakis
1990 A* conf
Computable processes.
POPL
Yiannis N. Moschovakis
1989 A* conf
A Game-Theoretic Modeling of Concurrency
LICS
Yiannis N. Moschovakis
1989 — conf
A Mathematical Modeling of Pure, Recursive Algorithms.
Logic at Botik
Yiannis N. Moschovakis
1989 J jnl
The Formal Language of Recursion.
J. Symb. Log.
Yiannis N. Moschovakis
1983 J jnl
Meeting of the Association for Symbolic Logic: San Francisco, 1981.
J. Symb. Log.
Jon Barwise, Robert L. Vaught, Yiannis N. Moschovakis
1979 J jnl
The Kleene Symposium and the Summer Meeting of the Association for Symbolic Logic.
J. Symb. Log.
John Addison, Jon Barwise, H. Jerome Keisler, Kenneth Kunen, Yiannis N. Moschovakis
1978 J jnl
Global Inductive Definability.
J. Symb. Log.
Jon Barwise, Yiannis N. Moschovakis
1971 J jnl
The Next Admissible Set.
J. Symb. Log.
K. Jon Barwise, Robin O. Gandy, Yiannis N. Moschovakis
1969 J jnl
Abstract Computability and Invariant Definability.
J. Symb. Log.
Yiannis N. Moschovakis
1969 J jnl
Meeting of the Association for Symbolic Logic.
J. Symb. Log.
Yiannis N. Moschovakis