 | 2009 |
|---|
| 21 |       | Yiannis N. Moschovakis:
Kleene's Amazing Second Recursion Theorem.
CSL 2009: 24-39 |
| 20 | | Lou van den Dries,
Yiannis N. Moschovakis:
Arithmetic complexity.
ACM Trans. Comput. Log. 10(1): (2009) |
| 2008 |
|---|
| 19 | | Yiannis N. Moschovakis:
The Axiomatic Derivation of Absolute Lower Bounds.
LICS 2008: 405 |
| 2005 |
|---|
| 18 | | Yiannis N. Moschovakis:
Recursion and Complexity.
CiE 2005: 350-357 |
| 2004 |
|---|
| 17 | | Lou van den Dries,
Yiannis N. Moschovakis:
Is the Euclidean algorithm optimal among its peers?
Bulletin of Symbolic Logic 10(3): 390-418 (2004) |
| 2003 |
|---|
| 16 | | Yiannis N. Moschovakis:
On primitive recursive algorithms and the greatest common divisor function.
Theor. Comput. Sci. 1-3(301): 1-30 (2003) |
| 1998 |
|---|
| 15 |  | Antonius J. C. Hurkens,
Monica McArthur,
Yiannis N. Moschovakis,
Lawrence S. Moss,
Glen T. Whitney:
The Logic of Recursive Equations.
J. Symb. Log. 63(2): 451-478 (1998) |
| 1997 |
|---|
| 14 | | Yiannis N. Moschovakis:
A Game-Theoretic, Concurrent and Fair Model of the Typed Lambda-calculus, with Full Recursion.
CSL 1997: 341-359 |
| 1995 |
|---|
| 13 | | Yiannis N. Moschovakis:
Computable Concurrent Processes.
Theor. Comput. Sci. 139(1&2): 243-273 (1995) |
| 1994 |
|---|
| 12 | | Yiannis N. Moschovakis,
Glen T. Whitney:
Powerdomains, Powerstructures and Fairness.
CSL 1994: 382-396 |
| 1991 |
|---|
| 11 | | Yiannis N. Moschovakis:
A Model of Concurrency with Fair Merge and Full Recursion
Inf. Comput. 93(1): 114-171 (1991) |
| 1990 |
|---|
| 10 | | Yiannis N. Moschovakis:
Computable processes.
POPL 1990: 72-80 |
| 1989 |
|---|
| 9 | | Yiannis N. Moschovakis:
A Game-Theoretic Modeling of Concurrency
LICS 1989: 154-163 |
| 8 | | Yiannis N. Moschovakis:
A Mathematical Modeling of Pure, Recursive Algorithms.
Logic at Botik 1989: 208-229 |
| 7 | | Yiannis N. Moschovakis:
The Formal Language of Recursion.
J. Symb. Log. 54(4): 1216-1252 (1989) |
| 1983 |
|---|
| 6 | | Jon Barwise,
Robert L. Vaught,
Yiannis N. Moschovakis:
Meeting of the Association for Symbolic Logic: San Francisco, 1981.
J. Symb. Log. 48(2): 505-513 (1983) |
| 1979 |
|---|
| 5 | | John Addison,
Jon Barwise,
H. Jerome Keisler,
Kenneth Kunen,
Yiannis N. Moschovakis:
The Kleene Symposium and the Summer Meeting of the Association for Symbolic Logic.
J. Symb. Log. 44(3): 469-480 (1979) |
| 1978 |
|---|
| 4 | | Jon Barwise,
Yiannis N. Moschovakis:
Global Inductive Definability.
J. Symb. Log. 43(3): 521-534 (1978) |
| 1971 |
|---|
| 3 | | K. Jon Barwise,
Robin O. Gandy,
Yiannis N. Moschovakis:
The Next Admissible Set.
J. Symb. Log. 36(1): 108-120 (1971) |
| 1969 |
|---|
| 2 | | Yiannis N. Moschovakis:
Meeting of the Association for Symbolic Logic.
J. Symb. Log. 34(1): 152-160 (1969) |
| 1 | | Yiannis N. Moschovakis:
Abstract Computability and Invariant Definability.
J. Symb. Log. 34(4): 605-633 (1969) |
