- IS THE EUCLIDEAN ALGORITHM OPTIMAL AMONG ITS PEERS? LOU VAN DEN DRIES AND YIANNIS N. MOSCHOVAKIS
- sense and denotation as algorithm and value 249 [30] , Sense in Frege, in Selected Essays [29], pp. 55--64.
- What Is an Algorithm? Yiannis N. Moschovakis #
- HORNER'S RULE IS OPTIMAL FOR POLYNOMIAL NULLITY YIANNIS N. MOSCHOVAKIS
- A gametheoretic, concurrent and fair model of the typed calculus, with full recursion
- The Journal of Symbolic Logic Volume 63, Number 2, June 1998
- Kleene's Amazing Second Recursion Theorem Extended Abstract
- MATHEMATICAL LOGIC YIANNIS N. MOSCHOVAKIS
- Two aspects of situated meaning Eleni Kalyvianaki and Yiannis N. Moschovakis
- Recursion and Complexity Yiannis N. Moschovakis
- DETAILED PROOF OF THEOREM 4.1 IN SENSE AND DENOTATION AS ALGORITHM AND VALUE
- On founding the theory of algorithms Yiannis N. Moschovakis
- Classical descriptive set theory as a refinement of effective descriptive set theory
- The Bulletin of Symbolic Logic Volume 16, Number 2, June 2010
- Powerdomains, Powerstructures and Fairness Yiannis N. Moschovakis1 and Glen T. Whitney2?
- Y I ANN I S N . MOSCHOVAK I S THE LOGIC OF FUNCTIONAL RECURSION
- ON PRIMITIVE RECURSIVE ALGORITHMS AND THE GREATEST COMMON DIVISOR FUNCTION
- A mathematical modeling of pure, recursive algorithms
- Arithmetic Complexity LOU VAN DEN DRIES
- LOWER BOUNDS FOR COPRIMENESS AND OTHER DECISION PROBLEMS IN ARITHMETIC
- COMPUTABLE CONCURRENT PROCESSES YIANNIS N. MOSCHOVAKIS
- The Logic of Recursive Equations Author(s): A. J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence S. Moss,
- ON PRIMITIVE RECURSIVE ALGORITHMS AND THE GREATEST COMMON DIVISOR FUNCTION
- On founding the theory of algorithms Yiannis N. Moschovakis
- MATHEMATICAL LOGIC YIANNIS N. MOSCHOVAKIS
- The Bulletin of Symbolic Logic Volume 10, Number 3, Sept. 2004
- A game-theoretic, concurrent and fair model of the typed -calculus, with full recursion
- What Is an Algorithm? Yiannis N. Moschovakis
