| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Joan Bagaria, Yiannis N. Moschovakis, Margarita Otero, Ivan N. Soskov |
Preface.  |
Ann. Pure Appl. Logic  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
Kleene's amazing Second Recursion Theorem. |
Bulletin of Symbolic Logic |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
Classical descriptive set theory as a refinement of effective descriptive set theory. |
Ann. Pure Appl. Logic |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lou van den Dries, Yiannis N. Moschovakis |
Arithmetic complexity. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Lower bounds for arithmetical problems, coprimeness, greatest common divisor, recursive programs |
| 1 | Yiannis N. Moschovakis |
Kleene's Amazing Second Recursion Theorem. |
CSL |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
Elementary induction on abstract structures. |
|
2008 |
RDF |
|
| 1 | Yiannis N. Moschovakis |
The Axiomatic Derivation of Absolute Lower Bounds. |
LICS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
Recursion and Complexity. |
CiE |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lou van den Dries, Yiannis N. Moschovakis |
Is the Euclidean algorithm optimal among its peers? |
Bulletin of Symbolic Logic |
2004 |
DBLP BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
On primitive recursive algorithms and the greatest common divisor function. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonius J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence S. Moss, Glen T. Whitney |
The Logic of Recursive Equations. |
J. Symb. Log. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
A Game-Theoretic, Concurrent and Fair Model of the Typed Lambda-calculus, with Full Recursion. |
CSL |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
Computable Concurrent Processes. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis, Glen T. Whitney |
Powerdomains, Powerstructures and Fairness. |
CSL |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
A Model of Concurrency with Fair Merge and Full Recursion |
Inf. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
Computable processes. |
POPL |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
The Formal Language of Recursion. |
J. Symb. Log. |
1989 |
DBLP BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
A Mathematical Modeling of Pure, Recursive Algorithms. |
Logic at Botik |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
A Game-Theoretic Modeling of Concurrency |
LICS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon Barwise, Robert L. Vaught, Yiannis N. Moschovakis |
Meeting of the Association for Symbolic Logic: San Francisco, 1981. |
J. Symb. Log. |
1983 |
DBLP BibTeX RDF |
|
| 1 | 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. |
1979 |
DBLP BibTeX RDF |
|
| 1 | Jon Barwise, Yiannis N. Moschovakis |
Global Inductive Definability. |
J. Symb. Log. |
1978 |
DBLP BibTeX RDF |
|
| 1 | K. Jon Barwise, Robin O. Gandy, Yiannis N. Moschovakis |
The Next Admissible Set. |
J. Symb. Log. |
1971 |
DBLP BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
Meeting of the Association for Symbolic Logic. |
J. Symb. Log. |
1969 |
DBLP BibTeX RDF |
|
| 1 | Yiannis N. Moschovakis |
Abstract Computability and Invariant Definability. |
J. Symb. Log. |
1969 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")