Yiannis N. Moschovakis - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2016

Hyperarithmetical SetsYiannis N. Moschovakis. In Eugenio G. Omodeo, Alberto Policriti, editors, Martin Davis on Computability, Computational Logic, and Mathematical Foundations. Volume 10 of Outstanding Contributions to Logic, pages 107-149, Springer, 2016. [doi]

2011

PrefaceJoan Bagaria, Yiannis N. Moschovakis, Margarita Otero, Ivan Soskov. APAL, 162(7):489, 2011. [doi]

2010

Kleene s amazing Second Recursion TheoremYiannis N. Moschovakis. bsl, 16(2):189-239, 2010. [doi]

Classical descriptive set theory as a refinement of effective descriptive set theoryYiannis N. Moschovakis. APAL, 162(3):243-255, 2010. [doi]

2009

Kleene s Amazing Second Recursion TheoremYiannis N. Moschovakis. csl 2009: 24-39 [doi]

Arithmetic complexityLou van den Dries, Yiannis N. Moschovakis. tocl, 10(1), 2009. [doi]

2008

The Axiomatic Derivation of Absolute Lower BoundsYiannis N. Moschovakis. lics 2008: 405 [doi]

Elementary induction on abstract structuresYiannis N. Moschovakis. Dover Publications, 2008.

2006

Notes on set theory, Second EditionYiannis N. Moschovakis. Undergraduate texts in mathematics, Springer, 2006.

2005

Recursion and ComplexityYiannis N. Moschovakis. cie 2005: 350-357 [doi]

2004

Is the Euclidean algorithm optimal among its peers?Lou van den Dries, Yiannis N. Moschovakis. bsl, 10(3):390-418, 2004. [doi]

2003

On primitive recursive algorithms and the greatest common divisor functionYiannis N. Moschovakis. TCS, 1-3(301):1-30, 2003. [doi]

1998

The Logic of Recursive EquationsAntonius J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence S. Moss, Glen T. Whitney. JSYML, 63(2):451-478, 1998.

1997

A Game-Theoretic, Concurrent and Fair Model of the Typed Lambda-calculus, with Full RecursionYiannis N. Moschovakis. csl 1998: 341-359

1995

Computable Concurrent ProcessesYiannis N. Moschovakis. TCS, 139(1&2):243-273, 1995. [doi]

1994

Powerdomains, Powerstructures and FairnessYiannis N. Moschovakis, Glen T. Whitney. csl 1995: 382-396

1991

A Model of Concurrency with Fair Merge and Full RecursionYiannis N. Moschovakis. iandc, 93(1):114-171, July 1991.

1990

Computable processesYiannis N. Moschovakis. popl 1990: 72-80

1989

A Game-Theoretic Modeling of ConcurrencyYiannis N. Moschovakis. lics 1989: 154-163

A Mathematical Modeling of Pure, Recursive AlgorithmsYiannis N. Moschovakis. ershov 1989: 208-229

The Formal Language of RecursionYiannis N. Moschovakis. JSYML, 54(4):1216-1252, 1989.

1983

Meeting of the Association for Symbolic Logic: San Francisco, 1981Jon Barwise, Robert L. Vaught, Yiannis N. Moschovakis. JSYML, 48(2):505-513, 1983.

1979

The Kleene Symposium and the Summer Meeting of the Association for Symbolic LogicJohn Addison, Jon Barwise, H. Jerome Keisler, Kenneth Kunen, Yiannis N. Moschovakis. JSYML, 44(3):469-480, 1979.

1978

Global Inductive DefinabilityJon Barwise, Yiannis N. Moschovakis. JSYML, 43(3):521-534, 1978.

1971

The Next Admissible SetK. Jon Barwise, Robin O. Gandy, Yiannis N. Moschovakis. JSYML, 36(1):108-120, 1971.

1969

Meeting of the Association for Symbolic LogicYiannis N. Moschovakis. JSYML, 34(1):152-160, 1969.

Abstract Computability and Invariant DefinabilityYiannis N. Moschovakis. JSYML, 34(4):605-633, 1969.

Sign in or sign up to see more results.

runs on WebDSL