Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Yiannis N. Moschovakis
2010 – today
- 2011
[j16]Joan Bagaria, Yiannis N. Moschovakis, Margarita Otero, Ivan N. Soskov: Preface. Ann. Pure Appl. Logic 162(7): 489 (2011)- 2010
- [j15]Yiannis N. Moschovakis: Classical descriptive set theory as a refinement of effective descriptive set theory. Ann. Pure Appl. Logic 162(3): 243-255 (2010)
- [j14]Yiannis N. Moschovakis: Kleene's amazing Second Recursion Theorem. Bulletin of Symbolic Logic 16(2): 189-239 (2010)
2000 – 2009
- 2009
- [j13]Lou van den Dries, Yiannis N. Moschovakis: Arithmetic complexity. ACM Trans. Comput. Log. 10(1) (2009)
- [c8]
- 2008
- [b1]Yiannis N. Moschovakis: Elementary induction on abstract structures. Dover Publications 2008, ISBN 978-0-486-46678-1, pp. I-X, 1-218
- [c7]
- 2005
- [c6]
- 2004
- [j12]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
- [j11]Yiannis N. Moschovakis: On primitive recursive algorithms and the greatest common divisor function. Theor. Comput. Sci. 1-3(301): 1-30 (2003)
1990 – 1999
- 1998
- [j10]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
- [c5]Yiannis N. Moschovakis: A Game-Theoretic, Concurrent and Fair Model of the Typed Lambda-calculus, with Full Recursion. CSL 1997: 341-359
- 1995
- [j9]Yiannis N. Moschovakis: Computable Concurrent Processes. Theor. Comput. Sci. 139(1&2): 243-273 (1995)
- 1994
- [c4]Yiannis N. Moschovakis, Glen T. Whitney: Powerdomains, Powerstructures and Fairness. CSL 1994: 382-396
- 1991
- [j8]Yiannis N. Moschovakis: A Model of Concurrency with Fair Merge and Full Recursion. Inf. Comput. 93(1): 114-171 (1991)
- 1990
- [c3]
1980 – 1989
- 1989
- [j7]
- [c2]Yiannis N. Moschovakis: A Mathematical Modeling of Pure, Recursive Algorithms. Logic at Botik 1989: 208-229
- [c1]
- 1983
- [j6]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)
1970 – 1979
- 1979
- [j5]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
- [j4]Jon Barwise, Yiannis N. Moschovakis: Global Inductive Definability. J. Symb. Log. 43(3): 521-534 (1978)
- 1971
- [j3]K. Jon Barwise, Robin O. Gandy, Yiannis N. Moschovakis: The Next Admissible Set. J. Symb. Log. 36(1): 108-120 (1971)
1960 – 1969
- 1969
- [j2]Yiannis N. Moschovakis: Meeting of the Association for Symbolic Logic. J. Symb. Log. 34(1): 152-160 (1969)
- [j1]Yiannis N. Moschovakis: Abstract Computability and Invariant Definability. J. Symb. Log. 34(4): 605-633 (1969)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:44 CET by the dblp team