Results for 'Y. Moschovakis'

991 found
Order:
  1. The 1996-97 ASL Winter Meeting will be held in conjunction with the Annual Meeting of the American Mathematical Society during January 8-11, 1997, in San Diego, California. The 1996-97 ASL Annual Meeting will be held March 22-25, 1997, at the Massachusetts Institute of Technology in Cambridge, Massachusetts. Chair of the local organizing com-mittee is Sy Friedman. [REVIEW]A. Louveau, Y. Moschovakis, L. Pacholski, H. Schwichtenberg, T. Slaman, J. Truss, H. D. Macpherson, A. Slomson & S. Wainer - 1996 - Bulletin of Symbolic Logic 2:121.
  2.  39
    The next admissible set.K. J. Barwise, R. O. Gandy & Y. N. Moschovakis - 1971 - Journal of Symbolic Logic 36 (1):108-120.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  3.  20
    Some Results in the Wadge Hierarchy of Borel Sets.A. Louveau, A. S. Kechris, D. A. Martin, Y. N. Moschovakis & J. Saint Raymond - 1992 - Journal of Symbolic Logic 57 (1):264-266.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  16
    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.
  5.  8
    1997 European Summer Meeting of the Association for Symbolic Logic.M. Hyland Hodges, A. H. Lachlan, A. Louveau, Y. N. Moschovakis, L. Pacholski, A. B. Slomson, J. K. Truss & S. S. Wainer - 1998 - Bulletin of Symbolic Logic 4 (1):55-117.
  6.  24
    The Largest Countable this, that, and the other.Donald A. Martin, A. S. Kechris, D. A. Martin, Y. N. Moschovakis & Alexander S. Kechris - 1992 - Journal of Symbolic Logic 57 (1):262-264.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  22
    A. S. Troelstra. Principles of intuitionism. Lectures presented at the summer conference on intuitionism and proof theory at SUNY at Buffalo, N. Y. Lecture notes in mathematics, no. 95. Springer-Verlag, Berlin, Heidelberg, and New York, 1969, 111 pp. [REVIEW]Joan Rand Moschovakis - 1975 - Journal of Symbolic Logic 40 (3):447-448.
  8.  26
    Y. N. Moschovakis. Recursive metric spaces. Fundamenta mathematicae, vol. 55 , pp. 215–238.B. H. Mayoh - 1966 - Journal of Symbolic Logic 31 (4):651-652.
  9.  17
    Review: Y. N. Moschovakis, Recursive Metric Spaces. [REVIEW]B. H. Mayoh - 1966 - Journal of Symbolic Logic 31 (4):651-652.
  10.  10
    Review: Y. N. Moschovakis, Logic from computer science, Proceedings of a workshop held November 13-17 1989; , Logics for Negation as Failure. [REVIEW]Helmut Schwichtenberg - 1995 - Journal of Symbolic Logic 60 (3):1021-1022.
  11.  16
    Handbook of mathematical logic, edited by Barwise Jon with the cooperation of Keisler H. J., Kunen K., Moschovakis Y. N., and Troelstra A. S., Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 , xi + 1165 pp. [REVIEW]Akihiro Kanamori - 1984 - Journal of Symbolic Logic 49 (3):971-975.
  12.  21
    Review: Jon Barwise, H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra, Handbook of Mathematical Logic; J. R. Shoenfield, B.1. Axioms of Set Theory. [REVIEW]Akihiro Kanamori - 1984 - Journal of Symbolic Logic 49 (3):971-975.
  13.  17
    Logic from computer science, Proceedings of a workshop held November 13–17, 1989, edited by Y. N. Moschovakis, Mathematical Sciences Research Institute publications, vol. 21, Springer-Verlag, New York etc. 1992, xi + 608 pp. [REVIEW]Helmut Schwichtenberg - 1995 - Journal of Symbolic Logic 60 (3):1021-1022.
  14.  21
    Handbook of mathematical logic, edited by Barwise Jon with the cooperation of Keisler H. J., Kunen K., Moschovakis Y. N., and Troelstra A. S., Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 , xi + 1165 pp. [REVIEW]Daniel Lascar - 1984 - Journal of Symbolic Logic 49 (3):968-971.
  15.  28
    Review: Jon Barwise, H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra, Handbook of Mathematical Logic. [REVIEW]Daniel Lascar - 1984 - Journal of Symbolic Logic 49 (3):968-971.
  16.  42
    A. Louveau. Some results in the Wadge hierarchy of Borel sets. Cabal seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, edited by A. S. Kechris, D. A. Martin, and Y. N. Moschovakis, Lecture notes in mathematics, vol. 1019, Springer-Verlag, Berlin etc. 1983, pp. 28–55. - A. Louveau and J. Saint Raymond. Borel classes and closed games: Wadge-type and Hurewicz-type results. Transactions of the American Mathematical Society, vol. 304 , pp. 431–467. - Alain Louveau and Jean Saint Raymond. The strength of Borel Wadge determinacy. Cabal seminar 81–85, Proceedings, Caltech-UCLA Logic Seminar 1981–85, edited by A. S. Kechris, D. A. Martin, and J. R. Steel, Lecture notes in mathematics, vol. 1333, Springer-Verlag, Berlin etc. 1988, pp. 1–30. [REVIEW]Robert S. Lubarsky - 1992 - Journal of Symbolic Logic 57 (1):264-266.
  17.  15
    Alexander S. Kechris and Yiannis N. Moschovakis. Notes on the theory of scales. Cabal seminar 76–77, Proceedings, Caltech-UCLA Logic Seminar 1976–77, edited by A. S. Kechris and Y. N. Moschovakis, Lecture notes in mathematics, vol. 689, Springer-Verlag, Berlin, Heidelberg, and New York, 1978, pp. 1–53. [REVIEW]T. Jech - 1985 - Journal of Symbolic Logic 50 (3):849-851.
  18.  18
    John R. Steel. Scales on sets. Cabal seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, edited by A. S. Kechris, D. A. Martin, and Y. N. Moschovakis, Lecture notes in mathematics, vol. 1019, Springer-Verlag, Berlin etc. pp. 72–76. - Yiannis N. Moschovakis. Scales on coinductive sets. Cabal seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, edited by A. S. Kechris, D. A. Martin, and Y. N. Moschovakis, Lecture notes in mathematics, vol. 1019, Springer-Verlag, Berlin etc., pp. 77–85. - Donald A. Martin and John R. Steel. The extent of scales in L. Cabal seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, edited by A. S. Kechris, D. A. Martin, and Y. N. Moschovakis, Lecture notes in mathematics, vol. 1019, Springer-Verlag, Berlin etc., pp. 86–96. - John R. Steel. Scales in L. Cabal seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, edited by A. S. Kechris, D. A. Martin, and Y. N. Moschovakis, Lecture notes in mathematics, vol. 1019, Spring. [REVIEW]Thomas Jech - 1992 - Journal of Symbolic Logic 57 (1):261-262.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  19.  9
    Review: Alexander S. Kechris, Yiannis N. Moschovakis, A. S. Kechris, Y. N. Moschovakis, Cobol Seminar. [REVIEW]T. Jech - 1985 - Journal of Symbolic Logic 50 (3):849-851.
  20.  63
    Donald A. Martin. The largest countable this, that, and the other. Cabal seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, edited by A. S. Kechris, D. A. Martin, and Y. N. Moschovakis, Lecture notes in mathematics, vol. 1019, Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1983, pp. 97–106. - Alexander S. Kechris, Donald A. Martin, and Robert M. Solovay. Introduction to Q-theory. Cabal seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, edited by A. S. Kechris, D. A. Martin, and Y. N. Moschovakis, Lecture notes in mathematics, vol. 1019, Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1983, pp. 199–282. - Steve Jackson. AD and the projective ordinals. Cabal seminar 81–85, Proceedings, Caltech-UCLA Logic Seminar 1981–85, edited by A. S. Kechris, D. A. Martin, and J. R. Steel, Lecture notes in mathematics, vol. 1333, Springer-Verlag, Berlin, Heidelberg, New York, etc., 1988, pp. 117–220. [REVIEW]Sy D. Friedman - 1992 - Journal of Symbolic Logic 57 (1):262-264.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  21.  18
    Handbook of mathematical logic, edited by Barwise Jon with the cooperation of Keisler H. J., Kunen K., Moschovakis Y. N., and Troelstra A. S., Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 , xi + 1165 pp. [REVIEW]Sy D. Friedman - 1984 - Journal of Symbolic Logic 49 (3):975-980.
  22.  26
    Review: Donald A. Martin, A. S. Kechris, D. A. Martin, Y. N. Moschovakis, The Largest Countable this, that, and the other; Alexander S. Kechris, Donald A. Martin, Robert M. Solovay, Introduction to $Q$-Theory; Steve Jackson, A. S. Kechris, D. A. Martin, J. R. Steel, AD and the Projective Ordinals. [REVIEW]Sy D. Friedman - 1992 - Journal of Symbolic Logic 57 (1):262-264.
  23. Review: Jon Barwise, H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra, Handbook of Mathematical Logic. [REVIEW]Sy D. Friedman - 1984 - Journal of Symbolic Logic 49 (3):975-980.
  24.  44
    Handbook of mathematical logic, edited by Barwise Jon with the cooperation of Keisler H. J., Kunen K., Moschovakis Y. N., and Troelstra A. S., Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 , xi + 1165 pp.Smoryński C.. D.1. The incompleteness theorems. Pp. 821–865.Schwichtenberg Helmut. D.2. Proof theory: some applications of cut-elimination. Pp. 867–895.Statman Richard. D.3. Herbrand's theorem and Gentzen's notion of a direct proof. Pp. 897–912.Feferman Solomon. D.4. Theories of finite type related to mathematical practice. Pp. 913–971.Troelstra A. S.. D.5. Aspects of constructive mathematics. Pp. 973–1052.Fourman Michael P.. D.6. The logic of topoi. Pp. 1053–1090.Barendregt Henk P.. D.1. The type free lambda calculus. Pp. 1091–1132.Paris Jeff and Harrington Leo. D.8. A mathematical incompleteness in Peano arithmetic. Pp. 1133–1142. [REVIEW]W. A. Howard - 1984 - Journal of Symbolic Logic 49 (3):980-988.
  25. Review: Jon Barwise, H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra, Handbook of Mathematical Logic. [REVIEW]W. A. Howard - 1984 - Journal of Symbolic Logic 49 (3):980-988.
  26.  5
    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  
  27.  31
    The logic of brouwer and heyting.Joan Rand Moschovakis - 2009 - In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. pp. 77-125.
  28.  34
    Unavoidable sequences in constructive analysis.Joan Rand Moschovakis - 2010 - Mathematical Logic Quarterly 56 (2):205-215.
    Five recursively axiomatizable theories extending Kleene's intuitionistic theory FIM of numbers and numbertheoretic sequences are introduced and shown to be consistent, by a modified relative realizability interpretation which verifies that every sequence classically defined by a Π11 formula is unavoidable and that no sequence can fail to be classically Δ11. The analytical form of Markov's Principle fails under the interpretation. The notion of strongly inadmissible rule of inference is introduced, with examples.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29.  35
    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   81 citations  
  30.  10
    Hyperanalytic Predicates.Yiannis N. Moschovakis & Thomas J. Grilliot - 1971 - Journal of Symbolic Logic 36 (1):147-148.
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  31.  10
    Notation Systems and Recursive Ordered Fields.Yiannis N. Moschovakis - 1966 - Journal of Symbolic Logic 31 (4):650-651.
  32. 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  
  33.  19
    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  
  34.  14
    [Omnibus Review].Yiannis N. Moschovakis - 1968 - Journal of Symbolic Logic 33 (3):471-472.
  35. A logical calculus of meaning and synonymy.Yiannis Nicholas Moschovakis - 2006 - Linguistics and Philosophy 29:27-89.
  36.  9
    Abstract First Order Computability.Yiannis N. Moschovakis - 1972 - Journal of Symbolic Logic 37 (4):758-758.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  37.  19
    Many-one Degrees of the Predicates H a.Yiannis N. Moschovakis - 1967 - Journal of Symbolic Logic 32 (4):529-530.
  38.  8
    The Invalidity of Markoff's Schema.Joan Rand Moschovakis - 1974 - Journal of Symbolic Logic 39 (2):333-334.
    Direct download  
     
    Export citation  
     
    Bookmark  
  39.  15
    In memoriam: Anne sjerp Troelstra 1939–2019.Dick de Jongh & Joan Rand Moschovakis - 2020 - Bulletin of Symbolic Logic 26 (3-4):293-295.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  35
    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   12 citations  
  41.  44
    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.
  42.  78
    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  
  43.  38
    Can there be no nonrecursive functions?Joan Rand Moschovakis - 1971 - Journal of Symbolic Logic 36 (2):309-315.
  44.  11
    La idea de principio en Leibniz y la evolución de la teoría deductiva.José Ortega Y. Gasset - 2020 - Madrid: Fundación Ortega y Gasset-Gregorio Marañon. Edited by Javier Echeverría & José Ortega Y. Gasset.
  45.  29
    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  
  46.  15
    A classical view of the intuitionistic continuum.Joan Rand Moschovakis - 1996 - Annals of Pure and Applied Logic 81 (1-3):9-24.
  47.  47
    Classical and constructive hierarchies in extended intuitionistic analysis.Joan Rand Moschovakis - 2003 - Journal of Symbolic Logic 68 (3):1015-1043.
    This paper introduces an extension A of Kleene's axiomatization of Brouwer's intuitionistic analysis, in which the classical arithmetical and analytical hierarchies are faithfully represented as hierarchies of the domains of continuity. A domain of continuity is a relation R(α) on Baire space with the property that every constructive partial functional defined on {α : R(α)} is continuous there. The domains of continuity for A coincide with the stable relations (those equivalent in A to their double negations), while every relation R(α) (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  48.  47
    More about relatively lawless sequences.Joan Rand Moschovakis - 1994 - Journal of Symbolic Logic 59 (3):813-829.
    In the author's Relative lawlessness in intuitionistic analysis [this JOURNAL. vol. 52 (1987). pp. 68-88] and An intuitionistic theory of lawlike, choice and lawless sequences [Logic Colloquium '90. Springer-Verlag. Berlin. 1993. pp. 191-209] a notion of lawless ness relative to a countable information base was developed for classical and intuitionistic analysis. Here we simplify the predictability property characterizing relatively lawless sequences and derive it from the new axiom of closed data (classically equivalent to open data) together with a natural principle (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  49.  30
    Intuitionistic analysis at the end of time.Joan Rand Moschovakis - 2017 - Bulletin of Symbolic Logic 23 (3):279-295.
    Kripke recently suggested viewing the intuitionistic continuum as an expansion in time of a definite classical continuum. We prove the classical consistency of a three-sorted intuitionistic formal system IC, simultaneously extending Kleene’s intuitionistic analysis I and a negative copy C° of the classically correct part of I, with an “end of time” axiom ET asserting that no choice sequence can be guaranteed not to be pointwise equal to a definite sequence. “Not every sequence is pointwise equal to a definite sequence” (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  50.  14
    Preface.Joan Bagaria, Yiannis Moschovakis, Margarita Otero & Ivan Soskov - 2011 - Annals of Pure and Applied Logic 162 (7):489.
1 — 50 / 991