On Founding the Theory of Algorithms (1998)

Cached

Download Links

by Yiannis Moschovakis My , Yiannis N. Moschovakis , Let L

Active Bibliography

9 On Founding the Theory of Algorithms – Yiannis N. Moschovakis, Let L - 1998
1 On – Yiannis N. Moschovakis
1 What Is an Algorithm? – Yiannis N. Moschovakis
23 What Is an Algorithm? – Yiannis N. Moschovakis - 2000
A Game-Theoretic, Concurrent and Fair Model – Of The Typed, Yiannis N. Moschovakis
3 The Logic Of Functional Recursion – Yiannis N. Moschovakis - 1997
1 A Game-Theoretic, Concurrent and Fair Model of the Typed Lambda-Calculus, With Full Recursion – Yiannis N. Moschovakis
Moschovakis' Notion Of Meaning As Applied To Linguistics – Michiel Van, Michiel van Lambalgen, Fritz Hamm - 2002
An Intensional Investigation of Parallelism – Denis Dancanet - 1994
19 Higher Order Logic – Daniel Leivant - 1994
WHAT IS AN ALGORITHM? (REVISED) – Yuri Gurevich
53 Structural Cut Elimination - I. Intuitionistic and Classical Logic – Frank Pfenning - 2000
20 Computational Foundations of Basic Recursive Function Theory – Robert L. Constable, Scott Fraser Smith - 1988
7 1996], Computation on abstract data types. The extensional approach, with an application to streams – Solomon Feferman, C. Kleene
Global semantic typing for inductive and coinductive computing – Daniel Leivant
3 Event-calculus semantics of Polish aspect – Piotr Labenz - 2004
Syntactic Reduction of Predicate Tableaux to Propositional Tableaux – Ján Komara, Paul J. Voda - 1995
1 Term Induction – Georg Christian Moser - 2001
8 Automated Generation of Analytic Calculi for Logics with Linearity – Agata Ciabattoni - 2004