default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYiannis N. Moschovakis
Person information
- affiliation: University of California, Los Angeles, CA, USA
- affiliation: University of Athens, Panepistimioupolis, Athens, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[p1]Yiannis N. Moschovakis:
Hyperarithmetical Sets. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 107-149- 2011
- [j16]Joan Bagaria
, Yiannis N. Moschovakis, Margarita Otero, Ivan N. Soskov:
Preface. Ann. Pure Appl. Log. 162(7): 489 (2011) - 2010
- [j15]Yiannis N. Moschovakis:
Classical descriptive set theory as a refinement of effective descriptive set theory. Ann. Pure Appl. Log. 162(3): 243-255 (2010) - [j14]Yiannis N. Moschovakis:
Kleene's amazing Second Recursion Theorem. Bull. Symb. Log. 16(2): 189-239 (2010)
2000 – 2009
- 2009
- [j13]Lou van den Dries, Yiannis N. Moschovakis:
Arithmetic complexity. ACM Trans. Comput. Log. 10(1): 2:1-2:49 (2009) - [c8]Yiannis N. Moschovakis:
Kleene's Amazing Second Recursion Theorem. CSL 2009: 24-39 - 2008
- [b2]Yiannis N. Moschovakis:
Elementary induction on abstract structures. Dover Publications 2008, ISBN 978-0-486-46678-1, pp. I-X, 1-218 - [c7]Yiannis N. Moschovakis:
The Axiomatic Derivation of Absolute Lower Bounds. LICS 2008: 405 - 2006
- [b1]Yiannis N. Moschovakis:
Notes on set theory, Second Edition. Undergraduate texts in mathematics, Springer 2006, ISBN 978-0-387-28723-2, pp. I-XII, 1-276 - 2005
- [c6]Yiannis N. Moschovakis:
Recursion and Complexity. CiE 2005: 350-357 - 2004
- [j12]Lou van den Dries, Yiannis N. Moschovakis:
Is the Euclidean algorithm optimal among its peers? Bull. Symb. Log. 10(3): 390-418 (2004) - 2003
- [j11]Yiannis N. Moschovakis:
On primitive recursive algorithms and the greatest common divisor function. Theor. Comput. Sci. 301(1-3): 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]Yiannis N. Moschovakis:
Computable processes. POPL 1990: 72-80
1980 – 1989
- 1989
- [j7]Yiannis N. Moschovakis:
The Formal Language of Recursion. J. Symb. Log. 54(4): 1216-1252 (1989) - [c2]Yiannis N. Moschovakis:
A Mathematical Modeling of Pure, Recursive Algorithms. Logic at Botik 1989: 208-229 - [c1]Yiannis N. Moschovakis:
A Game-Theoretic Modeling of Concurrency. LICS 1989: 154-163 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
