37 found
Order:
Disambiguations
Yiannis N. Moschovakis [42]Yiannis Nicholas Moschovakis [3]
  1.  29
    Elementary induction on abstract structures.Yiannis Nicholas Moschovakis - 1974 - Mineola, N.Y.: 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 (2 more)  
     
    Export citation  
     
    Bookmark   80 citations  
  2.  12
    [Omnibus Review].Yiannis N. Moschovakis - 1968 - Journal of Symbolic Logic 33 (3):471-472.
  3. A logical calculus of meaning and synonymy.Yiannis Nicholas Moschovakis - 2006 - Linguistics and Philosophy 29:27-89.
  4.  31
    Kleene's amazing second recursion theorem.Yiannis N. Moschovakis - 2010 - Bulletin of Symbolic Logic 16 (2):189 - 239.
    This little gem is stated unbilled and proved in the last two lines of §2 of the short note Kleene [1938]. In modern notation, with all the hypotheses stated explicitly and in a strong form, it reads as follows:Second Recursion Theorem. Fix a set V ⊆ ℕ, and suppose that for each natural number n ϵ ℕ = {0, 1, 2, …}, φn: ℕ1+n ⇀ V is a recursive partial function of arguments with values in V so that the standard (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  5.  41
    On founding the theory of algorithms.Yiannis N. Moschovakis - 1998 - In H. G. Dales & Gianluigi Oliveri (eds.), Truth in Mathematics. Oxford University Press, Usa. pp. 71--104.
  6.  69
    Global inductive definability.Jon Barwise & Yiannis N. Moschovakis - 1978 - 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 (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  7.  26
    The formal language of recursion.Yiannis N. Moschovakis - 1989 - Journal of Symbolic Logic 54 (4):1216-1252.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  8.  40
    Abstract computability and invariant definability.Yiannis N. Moschovakis - 1969 - Journal of Symbolic Logic 34 (4):605-633.
    By language we understand a lower predicate calculus with identity and (perhaps) relation and function symbols. It is convenient to allow for more than one sort of variable. Now each individual constant (if there are any) is of a specified sort, the formal expressions R(t1, … tn), f(t1,…, tn) are well formed only if the terms t1, …, tn are of specified sorts determined by the relation symbol R and the function symbol f, and the term f(t1, …, tn) (if (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9. Is the euclidean algorithm optimal among its Peers?Louden Dries & Yiannis N. Moschovakis - 2004 - Bulletin of Symbolic Logic 10 (3):390 - 418.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  53
    The Kleene symposium and the summer meeting of the Association for Symbolic Logic, Madison 1978.John Addison, Jon Barwise, H. Jerome Keisler, Kenneth Kunen & Yiannis N. Moschovakis - 1979 - Journal of Symbolic Logic 44 (3):469-480.
  11.  37
    The logic of recursive equations.A. J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence S. Moss & Glen T. Whitney - 1998 - 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 (7 more)  
     
    Export citation  
     
    Bookmark  
  12.  5
    Cabal Seminar 77-79: Proceedings, Caltech-UCLA Logic Seminar 1977-79.A. S. Kechris, Donald A. Martin & Yiannis N. Moschovakis - 1981 - Springer.
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  2
    Abstract recursion and intrinsic complexity.Yiannis N. Moschovakis - 2019 - New York, NY: Cambridge University Press.
    Presents a new framework for the complexity of algorithms, for all readers interested in the theory of computation.
    Direct download  
     
    Export citation  
     
    Bookmark  
  14.  44
    Classical descriptive set theory as a refinement of effective descriptive set theory.Yiannis N. Moschovakis - 2010 - 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 (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15. Document preparation for asl publications.Yiannis N. Moschovakis - unknown
    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  
     
    Bookmark  
  16.  33
    Meeting of the association for symbolic logic.Yiannis N. Moschovakis - 1969 - Journal of Symbolic Logic 34 (1):152-160.
  17.  13
    Scales on Σ 1 1 Sets.John R. Steel, A. S. Kechris, D. A. Martin, Y. N. Moschovakis, Yiannis N. Moschovakis & Donald A. Martin - 1992 - Journal of Symbolic Logic 57 (1):261-262.
  18.  14
    The Euclidean algorithm on the natural numbers Æ= 0, 1,... can be specified succinctly by the recursive program.Lou Van Den Dries & Yiannis N. Moschovakis - 2004 - Bulletin of Symbolic Logic 10 (3):390-418.
    The Euclidean algorithm on the natural numbers ℕ = {0,1,…} can be specified succinctly by the recursive programwhere rem is the remainder in the division of a by b, the unique natural number r such that for some natural number q,It is an algorithm from the remainder function rem, meaning that in computing its time complexity function cε, we assume that the values rem are provided on demand by some “oracle” in one “time unit”. It is easy to prove thatMuch (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  19.  5
    Cobol Seminar.Alexander S. Kechris, Yiannis N. Moschovakis, A. S. Kechris & Y. N. Moschovakis - 1985 - Journal of Symbolic Logic 50 (3):849-851.
    Direct download  
     
    Export citation  
     
    Bookmark  
  20.  7
    Review: Joseph Harrison, Recursive Pseudo-well-Orderings. [REVIEW]Yiannis N. Moschovakis - 1972 - Journal of Symbolic Logic 37 (1):197-198.
  21.  14
    Joseph Harrison. Recursive pseudo-well-orderings. Transactions of the American Mathematical Society, vol. 131 , pp. 526–543. [REVIEW]Yiannis N. Moschovakis - 1972 - Journal of Symbolic Logic 37 (1):197-198.
  22.  13
    Kreisel G.. Analysis of Cantor-Bendixson theorem by means of the analytic hierarchy. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 7 , pp. 621–626. [REVIEW]Yiannis N. Moschovakis - 1970 - Journal of Symbolic Logic 35 (2):334-334.
  23.  25
    Kreisel G., Lacombe D., and Shoenfield J.. Effective operations and partial recursive functionals. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 364–365.Kreisel G., Lacombe D., and Shoenfield J. R.. Partial recursive functionals and effective operations. Constructivity in mathematics, Proceedings of the colloquium held at Amsterdam, 1957, edited by Heyting A., Studies in logic and the foundations of mathematics, North Holland Publishing Company, Amsterdam 1959, pp. 290–297. [REVIEW]Yiannis N. Moschovakis - 1966 - Journal of Symbolic Logic 31 (2):261-262.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24.  14
    Kreisel G.. The axiom of choice and the class of hyperarithmetic functions. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 65 , pp. 307–319; also Indagationes mathematicae, vol. 24 , pp. 307–319. [REVIEW]Yiannis N. Moschovakis - 1970 - Journal of Symbolic Logic 35 (2):333-334.
  25.  16
    Peter G. Hinman. Hierarchies of effective descriptive set theory. Transactions of the American Mathematical Society, vol. 142 , pp. 111–140. [REVIEW]Yiannis N. Moschovakis - 1972 - Journal of Symbolic Logic 37 (4):758-759.
  26.  30
    Porte Jean. Quelques pseudo-paradoxes de la “calculabilité effective.” 2e Congrès Internationale de Cybernétique, Namur, 3–10 Septembre 1958, Actes, Association Internationale de Cybernétique, Namur 1960, pp. 332–334.Kalmár László. An argument against the plausibility of Church's thesis. Constructivity in mathematics, Proceedings of the colloquium held at Amsterdam, 1957, edited by Heyting A., Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1959, pp. 72–80.Peter Rózsa. Rekursivität und Konstruktivität. Constructivity in mathematics, Proceedings of the colloquium held at Amsterdam, 1957, edited by Heyting A., Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1959, pp. 226–233.Mendelson Elliott. On some recent criticism of Church's thesis. Notre Dame journal of formal logic, vol. 4 no. 3 , pp. 201–205. [REVIEW]Yiannis N. Moschovakis - 1968 - Journal of Symbolic Logic 33 (3):471-472.
  27. Review: Daniel Lacombe, Quelques Procedes de Definition en Topologie Recursive. [REVIEW]Yiannis N. Moschovakis - 1966 - Journal of Symbolic Logic 31 (1):133-134.
     
    Export citation  
     
    Bookmark  
  28. Review: Gustav Hensel, Hilary Putnam, On the Notational Independence of Various Hierarchies of Degrees of Unsolvability. [REVIEW]Yiannis N. Moschovakis - 1967 - Journal of Symbolic Logic 32 (1):124-125.
  29.  12
    Review: G. Kreisel, Analysis of Cantor-Bendixson Theorem by Means of the Analytic Hierarchy. [REVIEW]Yiannis N. Moschovakis - 1970 - Journal of Symbolic Logic 35 (2):334-334.
  30.  9
    Review: G. Kreisel, The Axiom of Choice and the Class of Hyperarithmetic Functions. [REVIEW]Yiannis N. Moschovakis - 1970 - Journal of Symbolic Logic 35 (2):333-334.
  31. 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]Yiannis N. Moschovakis - 1966 - Journal of Symbolic Logic 31 (2):261-262.
  32. Review: Georg Kreisel, Daniel Lacombe, Ensembles Recursivement Mesurable et Ensembles Recursivement Ouverts ou Fermes. [REVIEW]Yiannis N. Moschovakis - 1966 - Journal of Symbolic Logic 31 (1):133-133.
     
    Export citation  
     
    Bookmark  
  33.  16
    Richard Mansfield. Perfect subsets of definable sets of real numbers. Pacific journal of mathematics, vol. 35 , pp. 451–457. [REVIEW]Yiannis N. Moschovakis - 1975 - Journal of Symbolic Logic 40 (3):462.
  34.  16
    Review: Peter G. Hinman, Hierarchies of Effective Descriptive Set Theory. [REVIEW]Yiannis N. Moschovakis - 1972 - Journal of Symbolic Logic 37 (4):758-759.
  35.  10
    Review: Richard Mansfield, Perfect Subsets of Definable Sets of Real Numbers. [REVIEW]Yiannis N. Moschovakis - 1975 - Journal of Symbolic Logic 40 (3):462-462.
  36.  17
    Review: Yoemon Sampei, A Proof of Mansfield's Theorem by Forcing Method. [REVIEW]Yiannis N. Moschovakis - 1975 - Journal of Symbolic Logic 40 (3):462-462.
  37.  10
    Yoemon Sampei. A proof of Mansfield's theorem by forcing method. Commentarii mathematici Universitatis Sancti Pauli, vol. 17 no. 2 , pp. 99–103. [REVIEW]Yiannis N. Moschovakis - 1975 - Journal of Symbolic Logic 40 (3):462.