Result 1 to 20 from 60 total
Kleene’s amazing second recursion theorem. (English)
Bull. Symb. Log. 16, No. 2, 189-239 (2010).
1
Kleene’s amazing second recursion theorem (English)
Bulletin of Symbolic Logic 16, No. 2, 189-239 (2010).
2
Kleene’s amazing second recursion theorem. (Extended abstract). (English)
Grädel, Erich (ed.) et al., Computer science logic. 23rd international workshop, CSL 2009, 18th annual conference of the EACSL, Coimbra, Portugal, September 7‒11, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04026-9/pbk). Lecture Notes in Computer Science 5771, 24-39 (2009).
3
Descriptive set theory. 2nd ed. (English)
Mathematical Surveys and Monographs 155. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4813-5/hbk). xiv, 502~p. \$~115.00 (2009).
4
Arithmetic complexity. (English)
ACM Trans. Comput. Log. 10, No. 1 (2009).
5
Kleene’s amazing second recursion theorem (English)
CSL, 24-39 (2009).
6
Inductive scales on inductive sets. (English)
Kechris, Alexander S. (ed.) et al., Games, scales, and Suslin cardinals. The Cabal Seminar, Vol. I. Reprints of papers and new material based on the Los Angeles Caltech-UCLA Logic Cabal Seminar 1976‒1985. Cambridge: Cambridge University Press; Urbana, IL: Association for Symbolic Logic (ASL) (ISBN 978-0-521-89951-2/hbk). Lecture Notes in Logic 31, 94-101 (2008).
7
Elementary algorithms and their implementations. (English)
Cooper, S. Barry (ed.) et al., New computational paradigms. Changing conceptions of what is computable. New York, NY: Springer (ISBN 978-0-387-36033-1/hbk). 87-118 (2008).
8
Elementary induction on abstract structures (English)
Elementary induction on abstract structures, I-X, 1-218 (2008).
9
The axiomatic derivation of absolute lower bounds (English)
LICS, 405 (2008).
10
Recursion and complexity. (English)
Cooper, S. Barry (ed.) et al., New computational paradigms. First conference on computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8‒12, 2005. Proceedings. Berlin: Springer (ISBN 3-540-26179-6/pbk). Lecture Notes in Computer Science 3526, 350-357 (2005).
11
Recursion and complexity (English)
CiE, 350-357 (2005).
12
Is the Euclidean algorithm optimal among its peers? (English)
Bull. Symb. Log. 10, No. 3, 390-418 (2004).
13
Is the Euclidean algorithm optimal among its peers? (English)
Bulletin of Symbolic Logic 10, No. 3, 390-418 (2004).
14
On primitive recursive algorithms and the greatest common divisor function. (English)
Theor. Comput. Sci. 301, No.1-3, 1-30 (2003).
15
What is an algorithm? (English)
Engquist, Björn (ed.) et al., Mathematics unlimited - 2001 and beyond. Berlin: Springer. 919-936 (2001).
16
On founding the theory of algorithms. (English)
Dales, H. G. (ed.) et al., Truth in mathematics. Lectures of a conference, Mussomeli, Sicily, Italy, September 13‒20, 1995. Oxford: Clarendon Press. Oxford Science Publications. 71-104 (1998).
17
A game-theoretic, concurrent and fair model of the typed $λ$-calculus, with full recursion. (English)
Nielsen, Mogens (ed.) et al., Computer science logic. 11th international workshop, CSL ’97. Annual conference of the EACSL, Aarhus, Denmark, August 23‒29, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1414, 341-359 (1998).
18
The logic of recursive equations. (English)
J. Symb. Log. 63, No.2, 451-478 (1998).
19
The logic of recursive equations (English)
J. Symb. Log. 63, No. 2, 451-478 (1998).
20
Result 1 to 20 from 60 total
Start
Contact
Print
General Help
