Ershov Yuri L.. Definability and computability. English translation of Opredelimost′ i vychislimost′. Siberian school of algebra and logic. Consultants Bureau, New York, London, and Moscow, 1996, xiv + 264 pp [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

DOI

10.2307/2586863

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

External links

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

Review: Yuri L. Ershov, Definability and Computability. [REVIEW]Ivan Soskov - 1998 - Journal of Symbolic Logic 63 (2):747-748.
Definability and Computability.Yuri L. Ershov - 1998 - Studia Logica 61 (3):439-441.
Minc G. É.. Analog téorémy Erbrana dlá konstruktivnogo isčisléniá prédikatov. Doklady Akadémii Nauk SSSR, vol. 147 , pp. 783–786.Minc G. É.. An analogue of Herbranďs theorem for the constructive predicate calculus. English translation of the preceding by Goss R. N.. Soviet mathematics, vol. 3 no. 6 , pp. 1712–1715. [REVIEW]J. van Heijenoort - 1971 - Journal of Symbolic Logic 36 (3):525-525.
G. É. Minc. Dizúnktivnaá intérprétaciá isčisléniá LJ. Isslédovaniá po konstruktivnoj matématiké i matématičéskoj logiké, II, edited by A. O. Slisénko, Zapiski Naučnyh Séminarov Léningradskogo Otdéléniá Ordéna Lénina Matématičéskogo Instituta im. V. A. Stéklova AN SSSR, vol. 8, Izdatél′stvo “Nauka,” Leningrad 1968, pp. 182–188. - G. E. Mints. Disjunctive interpretation of the LJ calculus. English translation of the preceding. Studies in constructive mathematics and mathematical logic, Part II, edited by A. O. Slisenko, Seminars in Mathematics, V. A. Steklov Mathematical Institute, Leningrad, vol. 8, Consultants Bureau, New York-London1970, pp. 86–89. [REVIEW]J. van Heijenoort - 1971 - Journal of Symbolic Logic 36 (3):527-528.
Computability by means of effectively definable schemes and definability via enumerations.Ivan N. Soskov - 1990 - Archive for Mathematical Logic 29 (3):187-200.
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Recursive Structures and Ershov's Hierarchy.Christopher J. Ash & Julia F. Knight - 1996 - Mathematical Logic Quarterly 42 (1):461-468.
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.
Agafonov V. N.. Složnost' vyčisléniá psévdoslučajnyh poslédovatél'nostéj. Algébra i logika, vol. 7 no. 2 , pp. 4–19.Agafonov V. N.. Complexity of computing pseudorandom sequences. English translation of the preceding. Algebra and logic , vol. 7 , pp. 72–81. [REVIEW]D. W. Loveland - 1975 - Journal of Symbolic Logic 40 (2):248-249.
Tacitus: The Histories. With an English Translation by Clifford H. Moore of Harvard University (Books IV-V). The Annals, with an English Translation by John Jackson (Books I-III). (The Loeb Library.) Pp. 643, 3 maps. London: Heinemann; New York, Putnam, 1931. Cloth, 10s. net. [REVIEW]J. G. C. Anderson - 1932 - The Classical Review 46 (01):39-.
Computability and continuity in computable metric partial algebras equipped with computability structures.Fredrik Dahlgren - 2004 - Mathematical Logic Quarterly 50 (4):486.
Preface.Yuri L. Ershov, Klaus Keimel, Ulrich Kohlenbach & Andrei Morozov - 2009 - Annals of Pure and Applied Logic 159 (3):249-250.
Florus and Nepos Lucius Annaeus Florus. With an English translation by E. S. Forster, M.A. Cornelius Nepos. With an English translation by J. C. Rolfe, Litt.D. London : Heinemann; New York: Putnam's Sons, 1929. Pp. xv + 744. Cloth, 10s.; leather, 12s. 6d. [REVIEW]E. J. Wood - 1930 - The Classical Review 44 (05):194-195.
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.
, Routledge, London and New York (1996) ISBN 0-415-13113-8, p. xii + 286.(paper) $19.95., , Routledge, London and New York (1996) ISBN 0-415-13114-6., p. xii + 286. [REVIEW]K. BurgessjacKson - 1999 - Ethics and the Environment 4 (1):115-121.

Analytics

Added to PP
2016-06-30

Downloads
22 (#730,656)

6 months
2 (#1,255,269)

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