33 found
Sort by:
Disambiguations:
Yiannis N. Moschovakis [27]Yiannis Moschovakis [6]
  1. Yiannis N. Moschovakis, Document Preparation for Asl Publications.
    of L ATEX2 and essentially1 all commands of the AMS-L ATEX documentclass amsart are recognized by the documentclass asl, and so manuscripts prepared for those versions of TEX can be processed by the ASL Typesetting Office practically as-they-are.2 This brief guide is aimed at those authors who are reasonably..
    No categories
     
    My bibliography  
     
    Export citation  
  2. Joan Bagaria, Yiannis Moschovakis, Margarita Otero & Ivan Soskov (2011). Preface. Annals of Pure and Applied Logic 162 (7):489.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Yiannis N. Moschovakis (2010). Classical Descriptive Set Theory as a Refinement of Effective Descriptive Set Theory. Annals of Pure and Applied Logic 162 (3):243-255.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  4. Yiannis N. Moschovakis (2010). Kleene's Amazing Second Recursion Theorem. Bulletin of Symbolic Logic 16 (2):189 - 239.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. Yiannis Moschovakis, Richmond H. Thomason, Steffen Lempp, Steve Awodey, Jean-Pierre Marquis & William Tait (2007). The Palmer House Hilton Hotel, Chicago, Illinois April 19–21, 2007. Bulletin of Symbolic Logic 13 (4).
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. Yiannis N. Moschovakis (2006). A Logical Calculus of Meaning and Synonymy. Linguistics and Philosophy 29 (1):27 - 89.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  7. Lou van den Dries & Yiannis N. Moschovakis (2004). Is the Euclidean Algorithm Optimal Among Its Peers? Bulletin of Symbolic Logic 10 (3):390 - 418.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  8. Louden Dries & Yiannis N. Moschovakis (2004). Is the Euclidean Algorithm Optimal Among its Peers? Bulletin of Symbolic Logic 10 (3):390 - 418.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  9. Lou van den Dries & Yiannis N. Moschovakis (2004). Is the Euclidean Algorithm Optimal Among its Peers? Bulletin of Symbolic Logic 10 (3):390-418.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  10. Lou van den Dries & Yiannis N. Moschovakis (2004). The Euclidean Algorithm on the Natural Numbers Æ= 0, 1,... Can Be Specified Succinctly by the Recursive Program. Bulletin of Symbolic Logic 10 (3).
    Direct download  
     
    My bibliography  
     
    Export citation  
  11. Yiannis Moschovakis (2001). Mathematics Unlimited --- 2001 and Beyond.
    No categories
     
    My bibliography  
     
    Export citation  
  12. Yiannis Moschovakis (2001). What is an Algorithm? In Mathematics Unlimited --- 2001 and beyond.
     
    My bibliography  
     
    Export citation  
  13. A. J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence S. Moss & Glen T. Whitney (1998). The Logic of Recursive Equations. Journal of Symbolic Logic 63 (2):451-478.
    We study logical systems for reasoning about equations involving recursive definitions. In particular, we are interested in "propositional" fragments of the functional language of recursion FLR [18, 17], i.e., without the value passing or abstraction allowed in FLR. The "pure," propositional fragment FLR 0 turns out to coincide with the iteration theories of [1]. Our main focus here concerns the sharp contrast between the simple class of valid identities and the very complex consequence relation over several natural classes of models.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  14. Yiannis N. Moschovakis (1998). On Founding the Theory of Algorithms. In H. G. Dales & Gianluigi Oliveri (eds.), Truth in Mathematics. Oxford University Press, Usa. 71--104.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  15. Yiannis Moschovakis & Mike Yates (1996). In Memoriam: Robin Oliver Gandy, 1919-1995. Bulletin of Symbolic Logic 2 (3):367-370.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  16. Yiannis N. Moschovakis (1989). The Formal Language of Recursion. Journal of Symbolic Logic 54 (4):1216-1252.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  17. Jon Barwise, Robert Vaught & Yiannis Moschovakis (1983). Meeting of the Association for Symbolic Logic: San Francisco, 1981. Journal of Symbolic Logic 48 (2):505-513.
  18. John Addison, Jon Barwise, H. Jerome Keisler, Kenneth Kunen & Yiannis N. Moschovakis (1979). The Kleene Symposium and the Summer Meeting of the Association for Symbolic Logic. Journal of Symbolic Logic 44 (3):469-480.
  19. Jon Barwise & Yiannis N. Moschovakis (1978). Global Inductive Definability. Journal of Symbolic Logic 43 (3):521-534.
    We show that several theorems on ordinal bounds in different parts of logic are simple consequences of a basic result in the theory of global inductive definitions.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  20. Yiannis N. Moschovakis (1975). Review: Richard Mansfield, Perfect Subsets of Definable Sets of Real Numbers. [REVIEW] Journal of Symbolic Logic 40 (3):462-462.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  21. Yiannis N. Moschovakis (1975). Review: Yoemon Sampei, A Proof of Mansfield's Theorem by Forcing Method. [REVIEW] Journal of Symbolic Logic 40 (3):462-462.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  22. Yiannis N. Moschovakis (1974/2008). Elementary Induction on Abstract Structures. Dover Publications.
    Hailed by the Bulletin of the American Mathematical Society as "easy to use and a pleasure to read," this research monograph is recommended for students and professionals interested in model theory and definability theory. The sole prerequisite is a familiarity with the basics of logic, model theory, and set theory. 1974 edition.
     
    My bibliography  
     
    Export citation  
  23. Yiannis N. Moschovakis (1972). Review: Joseph Harrison, Recursive Pseudo-Well-Orderings. [REVIEW] Journal of Symbolic Logic 37 (1):197-198.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. Yiannis N. Moschovakis (1972). Review: Peter G. Hinman, Hierarchies of Effective Descriptive Set Theory. [REVIEW] Journal of Symbolic Logic 37 (4):758-759.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  25. Yiannis N. Moschovakis (1970). Review: G. Kreisel, Analysis of Cantor-Bendixson Theorem by Means of the Analytic Hierarchy. [REVIEW] Journal of Symbolic Logic 35 (2):334-334.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. Yiannis N. Moschovakis (1970). Review: G. Kreisel, The Axiom of Choice and the Class of Hyperarithmetic Functions. [REVIEW] Journal of Symbolic Logic 35 (2):333-334.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  27. Yiannis N. Moschovakis (1969). Abstract Computability and Invariant Definability. Journal of Symbolic Logic 34 (4):605-633.
  28. Yiannis N. Moschovakis (1969). Meeting of the Association for Symbolic Logic. Journal of Symbolic Logic 34 (1):152-160.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  29. Yiannis N. Moschovakis (1968). [Omnibus Review]. Journal of Symbolic Logic 33 (3):471-472.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  30. Yiannis N. Moschovakis (1967). Review: Gustav Hensel, Hilary Putnam, On the Notational Independence of Various Hierarchies of Degrees of Unsolvability. [REVIEW] Journal of Symbolic Logic 32 (1):124-125.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  31. Yiannis N. Moschovakis (1966). Review: Daniel Lacombe, Quelques Procedes de Definition en Topologie Recursive. [REVIEW] Journal of Symbolic Logic 31 (1):133-134.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  32. Yiannis N. Moschovakis (1966). Review: G. Kriesel, D. Lacombe, J. Shoenfield, Effective Operations and Partial Recursive Functionals; G. Kreisel, D. Lacombe, J. R. Shoenfield, Partial Recursive Functionals and Effective Operations. [REVIEW] Journal of Symbolic Logic 31 (2):261-262.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  33. Yiannis N. Moschovakis (1966). Review: Georg Kreisel, Daniel Lacombe, Ensembles Recursivement Mesurable et Ensembles Recursivement Ouverts ou Fermes. [REVIEW] Journal of Symbolic Logic 31 (1):133-133.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation