Yiannis N. Moschovakis | Academic Influence

Yiannis N. Moschovakis's AcademicInfluence.com Rankings

Yiannis N. Moschovakis

Philosophy

#2141

World Rank

#3720

Historical Rank

#799

USA Rank

Mathematical Logic

#13

World Rank

#24

Historical Rank

#7

USA Rank

Logic

#980

World Rank

#1584

Historical Rank

#329

USA Rank

philosophy Degrees

Yiannis N. Moschovakis

Mathematics

#2776

World Rank

#4213

Historical Rank

#1075

USA Rank

Set Theory

#20

World Rank

#28

Historical Rank

#10

USA Rank

mathematics Degrees

Download Badge

Philosophy
Mathematics

Yiannis N. Moschovakis's Degrees

PhD Mathematics University of California, Berkeley
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Yiannis N. Moschovakis Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Yiannis Nicholas Moschovakis is a set theorist, descriptive set theorist, and recursion theorist, at UCLA. His book Descriptive Set Theory is the primary reference for the subject. He is especially associated with the development of the effective, or lightface, version of descriptive set theory, and he is known for the Moschovakis coding lemma that is named after him.

(See a Problem?)

Yiannis N. Moschovakis's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Descriptive Set Theory (1980) (693)
Elementary induction on abstract structures (1974) (532)
Abstract first order computability. II (1969) (137)
Sense and denotation as algorithm and value (1993) (125)
Recursive metric spaces (1964) (117)
A Logical Calculus of Meaning and Synonymy (2006) (108)
Notes On Set Theory (1994) (95)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics) (1974) (94)
The next admissible set (1971) (83)
Some consequences of the axiom of definable determinateness. (1968) (78)
Uniformization in a playful universe (1971) (77)
The formal language of recursion (1989) (64)
Recursion in Higher Types (1977) (62)
Determinacy and Prewellorderings of the Continuum (1970) (61)
Cabal Seminar 79–81 (1983) (58)
Cabal Seminar 76–77 (1978) (57)
What Is an Algorithm (2001) (57)
Lecture Notes in Logic (1999) (56)
Kleene's Amazing Second Recursion Theorem (2009) (56)
Abstract recursion as a foundation for the theory of algorithms (1984) (54)
The axiom of determinacy, strong partition properties and nonsingular measures (1981) (47)
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 (1966) (44)
Global inductive definability (1978) (44)
Logic from Computer Science (1992) (44)
A* Algorithm (2008) (44)
Axioms for Computation Theories-First Draft (1971) (41)
The game quantifier (1972) (37)
Notation systems and recursive ordered fields (1966) (37)
Notes on the Theory of Scales (1978) (37)
The logic of recursive equations (1998) (34)
On nonmonotone inductive definability (1974) (33)
On founding the theory of algorithms (2011) (31)
Cabal Seminar 77 – 79 (1981) (28)
Abstract Computability and Invariant Definability (1970) (27)
Two theorems about projective sets (1972) (21)
On primitive recursive algorithms and the greatest common divisor function (2003) (21)
Structural Characterizations of Classes of Relations (1974) (21)
The Logic of Functional Recursion (1997) (19)
The Suslin-Kleene theorem for countable structures (1970) (19)
Elementary Algorithms and Their Implementations (2008) (18)
Classical descriptive set theory as a refinement of effective descriptive set theory (2010) (18)
A Mathematical Modeling of Pure, Recursive Algorithms (1989) (18)
Inductive scales on inductive sets (1978) (17)
Scales on coinductive sets (1983) (16)
On the Basic Notions in the Theory of Induction (1977) (16)
A game-theoretic modeling of concurrency (1989) (15)
Analytical Definability in a Playful Universe (1973) (15)
Review: Daniel Lacombe, Quelques Procedes de Definition en Topologie Recursive (1966) (15)
Arithmetic complexity (2019) (15)
Is the Euclidean Algorithm Optimal Among its Peers? (2004) (14)
The extent of definable scales (1982) (14)
A Model of Concurrency with Fair Merge and Full Recursion (1991) (14)
Ordinal games and playful models (1981) (13)
Abstract Recursion and Intrinsic Complexity (2018) (11)
Cabal Seminar 76-77 : proceedings, Caltech-UCLA logic seminar 1976-77 (1978) (9)
Notes on set theory, Second Edition (2006) (9)
Review: G. Kreisel, Analysis of Cantor-Bendixson Theorem by Means of the Analytic Hierarchy (1970) (8)
Powerdomains, Powerstructures and Fairness (1994) (7)
Games, Scales, and Suslin Cardinals: The Cabal Seminar, Volume I: The axiom of determinacy, strong partition properties, and nonsingular measures (2008) (6)
Measurable cardinals in playful models (1981) (6)
Cabal Seminar 79-81 : proceedings, Caltech-UCLA Logic Seminar 1979-81 (1983) (6)
Computable Concurrent Processes (1995) (6)
A Game-Theoretic, Concurrent and Fair Model of the Typed Lambda-calculus, with Full Recursion (1997) (6)
Recursion and Complexity (2005) (6)
A game-theoretic modelling of concurrency (1989) (5)
Computability Over the Continuum (1971) (5)
Many-one degrees of the predicates Ha (x) (1966) (5)
The Suslin-Kleene theorem for V κ with cofinality (κ) = ω (1970) (5)
Logic from computer science : proceedings of a workshop held November 13-17, 1989 (1992) (4)
Games, Scales, and Suslin Cardinals: The Cabal Seminar, Volume I: Inductive scales on inductive sets (2008) (4)
On the Grilliot-Harrington-MacQueen theorem (1981) (4)
Ordinal Definability and Recursion Theory: The Cabal Seminar, Volume III: Measurable cardinals in playful models (2016) (3)
Review: Gustav Hensel, Hilary Putnam, On the Notational Independence of Various Hierarchies of Degrees of Unsolvability (1967) (2)
Are Sets All There is (1994) (2)
Review: G. Kreisel, The Axiom of Choice and the Class of Hyperarithmetic Functions (1970) (2)
Kleene ’ s Amazing Second Recursion Theorem Extended Abstract ? (2009) (2)
Games, Scales, and Suslin Cardinals: The Cabal Seminar, Volume I: Notes on the theory of scales (2008) (2)
In Memoriam: Robin Oliver Gandy 1919–1995 (1996) (2)
Hyperarithmetical Sets (2016) (1)
The Axiomatic Derivation of Absolute Lower Bounds (2008) (1)
Intuitionism and effective descriptive set theory (2018) (1)
Computable process (1989) (1)
Lower bounds in arithmetic complexity via asymmetric embeddings (2008) (1)
1 On founding the theory of algorithms (2011) (1)
New Methods and Results in Descriptive Set Theory (1975) (1)
Cabal Seminar 77-79 Proceedings, Caltech-Ucla Logic Seminar 1977-79 (1981) (1)
The strong Spector-Gandy Theorem for the higher analytical pointclasses (2022) (1)
Review: Joseph Harrison, Recursive Pseudo-well-Orderings (1972) (1)
Harrison Joseph. Recursive pseudo-well-orderings. Transactions of the American Mathematical Society, vol. 131 (1968), pp. 526–543. (1972) (1)
Elementary recursive algorithms (2021) (0)
Basic notions of the effective theory (2009) (0)
Hinman Peter G.. Hierarchies of effective descriptive set theory. Transactions of the American Mathematical Society, vol. 142 (1969), pp. 111–140. (1972) (0)
Formal Logic (1993) (0)
Review: Richard Mansfield, Perfect Subsets of Definable Sets of Real Numbers (1975) (0)
NATURAL NUMBERS (2020) (0)
A∗ Algorithm (2017) (0)
Paradoxes and Axioms (1994) (0)
Replacement and Other Axioms (1994) (0)
The basic classical notions (2009) (0)
Guide to Part C: Recursion Theory (1977) (0)
Computability. By Douglas S. Bridges (1995) (0)
ABSOLUTE LOWER BOUNDS FOR UNIFORM PROCESSES (2012) (0)
Preface (2011) (0)
Association for symbolic logic (1989) (0)
DETAILED PROOF OF THEOREM 4 . 1 IN SENSE AND DENOTATION AS ALGORITHM AND VALUE (2007) (0)
The recursion theorem (2009) (0)
UNIFORMISATION IN A PLAYFUL UNIVERSE (2007) (0)
The Palmer House Hilton Hotel, Chicago, Illinois April 19–21, 2007 (2007) (0)
The constructible universe (2009) (0)
Well Ordered Sets (1994) (0)
Association for Symbolic Logic (1993) (0)
LOWER BOUNDS FOR COPRIMENESS AND OTHER DECISION PROBLEMS IN ARITHMETIC (2007) (0)
Sense and denotation as algorithm and value Advanced course (2010) (0)
JSL volume 47 issue 4 Cover and Back matter and errata (1982) (0)
Meeting of the Association for Symbolic Logic (1969) (0)
Meeting of the Association for Symbolic Logic, San Francisco, 1981 (1983) (0)
1997 European Summer Meeting of the Association for Symbolic Logic (1998) (0)
JSL volume 46 issue 4 Cover and Back matter and Errata (1981) (0)
The Kleene symposium and the summer meeting of the Association for Symbolic Logic, Madison 1978 (1979) (0)
Review: Peter G. Hinman, Hierarchies of Effective Descriptive Set Theory (1972) (0)
Association for Symbolic Logic (1994) (0)
HORNER’S RULE IS OPTIMAL FOR POLYNOMIAL NULLITY (2011) (0)
The Euclidean algorithm on the natural numbers Æ= 0, 1,... can be specified succinctly by the recursive program (2004) (0)
Review: Georg Kreisel, Daniel Lacombe, Ensembles Recursivement Mesurable et Ensembles Recursivement Ouverts ou Fermes (1966) (0)
Notices (2012) (0)
SOME CONSEQUENCES OF THE AXIOM OF DEFINABLE (2016) (0)
-Suslin and -Borel (2009) (0)
Concluding Remarks in the Panel Discussion (1989) (0)
Association for Symbolic Logic (1991) (0)
Structure theory for pointclasses (2009) (0)
Choice’s Consequences (1994) (0)
Mansfield Richard. Perfect subsets of definable sets of real numbers. Pacific journal of mathematics , vol. 35 (1970), pp. 451–457. (1975) (0)
Review: Yoemon Sampei, A Proof of Mansfield's Theorem by Forcing Method (1975) (0)
The playful universe (2009) (0)

This paper list is powered by the following services:

Other Resources About Yiannis N. Moschovakis

en.wikipedia.org

What Schools Are Affiliated With Yiannis N. Moschovakis?

Yiannis N. Moschovakis is affiliated with the following schools:

Image Attributions

Image Source for Yiannis N. Moschovakis