Review: Yuri L. Ershov, Definability and Computability [Book Review]

Journal of Symbolic Logic 63 (2):747-748 (1998)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,846

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Computability by means of effectively definable schemes and definability via enumerations.Ivan N. Soskov - 1990 - Archive for Mathematical Logic 29 (3):187-200.
Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.
Preface.Yuri L. Ershov, Klaus Keimel, Ulrich Kohlenbach & Andrei Morozov - 2009 - Annals of Pure and Applied Logic 159 (3):249-250.
The Ershov Hierarchy.Marat M. Arslanov - 2011 - In S. B. Cooper & Andrea Sorbi (eds.), Computability in Context: Computation and Logic in the Real World. World Scientific.
A. M. Turing. Computability and λ-definability. The journal of symbolic logic, Bd. 2 , S. 153–163. [REVIEW]Rózsa Péter - 1938 - Journal of Symbolic Logic 3 (2):89-89.
E. PALIUTIN [1975] Addendum to the paper of Ershov [1975], Algebra i Logika, 14, pp. 284-287; transl. 14.D. Scott, Vl Selivanov, Shoenfield Jr & Ra Shore - 1999 - In Edward R. Griffor (ed.), Handbook of computability theory. New York: Elsevier. pp. 119.
Computability and λ-definability.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):153-163.
Definability and undefinability with real order at the background.Yuri Gurevich & Alexander Rabinovich - 2000 - Journal of Symbolic Logic 65 (2):946-958.
Computability and $lambda$-Definability.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):153-163.
Abstract computability and invariant definability.Yiannis N. Moschovakis - 1969 - Journal of Symbolic Logic 34 (4):605-633.
Representation theorems for transfinite computability and definability.Dag Normann - 2002 - Archive for Mathematical Logic 41 (8):721-741.
On definability in multimodal logic.Joseph Y. Halpern, Dov Samet & Ella Segev - 2009 - Review of Symbolic Logic 2 (3):451-468.
On Genericity and Ershov's Hierarchy.Amy Gale & Rod Downey - 2001 - Mathematical Logic Quarterly 47 (2):161-182.

Analytics

Added to PP
2013-11-22

Downloads
16 (#905,800)

6 months
1 (#1,469,946)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references