37 found
Order:
  1.  1
    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.
    Direct download  
     
    Export citation  
     
    My bibliography   48 citations  
  2. Yiannis N. Moschovakis (1981). Descriptive Set Theory. Journal of Symbolic Logic 46 (4):874-876.
    Direct download  
     
    Export citation  
     
    My bibliography   42 citations  
  3.  42
    Yiannis N. Moschovakis (2006). A Logical Calculus of Meaning and Synonymy. Linguistics and Philosophy 29 (1):27 - 89.
  4. 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)  
     
    Export citation  
     
    My bibliography  
  5.  12
    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.
    The Suslin–Kleene Theorem is obtained as a corollary of a standard proof of the classical Suslin Theorem, by noticing that it is mostly constructive and applying to it a naive realizability interpretation.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  6.  6
    Yiannis N. Moschovakis (2010). Kleene's Amazing Second Recursion Theorem. Bulletin of Symbolic Logic 16 (2):189 - 239.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  7.  9
    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)  
     
    Export citation  
     
    My bibliography   2 citations  
  8. Yiannis N. Moschovakis (1966). Notation Systems and Recursive Ordered Fields. Journal of Symbolic Logic 31 (4):650-651.
    Direct download  
     
    Export citation  
     
    My bibliography   5 citations  
  9.  8
    Yiannis N. Moschovakis (1989). The Formal Language of Recursion. Journal of Symbolic Logic 54 (4):1216-1252.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  10. Yiannis N. Moschovakis & Thomas J. Grilliot (1971). Hyperanalytic Predicates. Journal of Symbolic Logic 36 (1):147-148.
    Direct download  
     
    Export citation  
     
    My bibliography   4 citations  
  11.  4
    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  
     
    Export citation  
     
    My bibliography  
  12.  16
    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.
  13.  6
    Yiannis N. Moschovakis (1969). Meeting of the Association for Symbolic Logic. Journal of Symbolic Logic 34 (1):152-160.
  14.  13
    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)  
     
    Export citation  
     
    My bibliography  
  15.  15
    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)  
     
    Export citation  
     
    My bibliography  
  16.  8
    Yiannis N. Moschovakis (1969). Abstract Computability and Invariant Definability. Journal of Symbolic Logic 34 (4):605-633.
  17.  1
    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  
     
    Export citation  
     
    My bibliography  
  18. 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.
     
    Export citation  
     
    My bibliography  
  19.  10
    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)  
     
    Export citation  
     
    My bibliography  
  20.  3
    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)  
     
    Export citation  
     
    My bibliography  
  21. Yiannis N. Moschovakis (1966). Review: Daniel Lacombe, Quelques Procedes de Definition en Topologie Recursive. [REVIEW] Journal of Symbolic Logic 31 (1):133-134.
    Translate
     
     
    Export citation  
     
    My bibliography  
  22.  1
    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)  
     
    Export citation  
     
    My bibliography  
  23. Alexander S. Kechris, Yiannis N. Moschovakis, A. S. Kechris & Y. N. Moschovakis (1985). Cobol Seminar. Journal of Symbolic Logic 50 (3):849-851.
    Direct download  
     
    Export citation  
     
    My bibliography  
  24. A. S. Kechris & Yiannis N. Moschovakis (1978). Cabal Seminar 76-77 Proceedings, Caltech-Ucla Logic Seminar, 1976-77.
     
    Export citation  
     
    My bibliography  
  25. A. S. Kechris, D. A. Martin & Yiannis N. Moschovakis (1981). Cabal Seminar 77-79 Proceedings, Caltech-Ucla Logic Seminar 1977-79.
     
    Export citation  
     
    My bibliography  
  26. Yiannis N. Moschovakis (1972). Abstract First Order Computability. Journal of Symbolic Logic 37 (4):758-758.
    Direct download  
     
    Export citation  
     
    My bibliography  
  27. 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
     
    Export citation  
     
    My bibliography  
  28. Yiannis N. Moschovakis & Mathematical Sciences Research Institute (1992). Logic From Computer Science Proceedings of a Workshop Held November 13-17, 1989.
     
    Export citation  
     
    My bibliography  
  29. Yiannis N. Moschovakis (1967). Many-One Degrees of the Predicates H A. Journal of Symbolic Logic 32 (4):529-530.
    Direct download  
     
    Export citation  
     
    My bibliography  
  30. Yiannis N. Moschovakis (1968). [Omnibus Review]. Journal of Symbolic Logic 33 (3):471-472.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  31. 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.
     
    Export citation  
     
    My bibliography  
  32. 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)  
     
    Export citation  
     
    My bibliography  
  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
     
     
    Export citation  
     
    My bibliography  
  34. Yiannis N. Moschovakis (1972). Review: Joseph Harrison, Recursive Pseudo-Well-Orderings. [REVIEW] Journal of Symbolic Logic 37 (1):197-198.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  35. Yiannis N. Moschovakis (1975). Review: Richard Mansfield, Perfect Subsets of Definable Sets of Real Numbers. [REVIEW] Journal of Symbolic Logic 40 (3):462-462.
  36. 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.
  37. John R. Steel, A. S. Kechris, D. A. Martin, Y. N. Moschovakis, Yiannis N. Moschovakis & Donald A. Martin (1992). Scales on Σ 1 1 Sets. Journal of Symbolic Logic 57 (1):261-262.
    Direct download  
     
    Export citation  
     
    My bibliography