B. È. Shapirovskiĭ. O π-kharaktere i π-vese v bikompaktakh. Doklady Akademii Nauk SSSR, vol. 223 (1975), pp. 799–802. - B. È. Šapirovskiĭ. On π-character and π-weight in compact Hausdorff spaces. English translation by I. Juhász of the preceding. Soviet mathematics, vol. 16 no. 4 (for 1975, pub. 1976), pp. 999–1004. - B. È. Shapirovskiĭ. Ob otobrazheniyakh na Tikhonovskie kuby. Uspekhi matematich-eskikhnauk, vol. 35 no. 3 (1980), pp. 122–130. - B. E. Shapirovskii. Maps onto Tikhonov cubes. English translation by A. West of the preceding. Russian mathematical surveys, vol. 35 no. 3 (1980), pp. 145–156 [Book Review]

Bulletin of Symbolic Logic 7 (4):536-537 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s1079898600005485

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

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

B. A. Trahténbrot. Ob avtosvodimosti. Doklady Akadémii Nauk SSSR, vol. 192 , pp. 1224–1227. - B. A. Trahtenbrot. On autoreducibility. English translation of the preceding by M. Machover. Soviet mathematics, vol. 11 no. 3 , pp. 814–817. [REVIEW]Richard E. Ladner - 1973 - Journal of Symbolic Logic 38 (3):527.
V. I. Amstislavskij. Téorétiko-množéstvénnyé operacii i rékursivnyé iérarhii. Doklady Akadémii Nauk SSSR, vol. 169 , pp. 995–998. - V. I. Amstislavskij. Set-theoretical operations and recursive hierarchies. English translation of the preceding by E. Wesley. Soviet mathematics, vol. 7 no. 4 , pp. 1029–1032. - V. I. Amstislavskij. Rasširénié rékursivnyh iérarhij i R-opéracii. Doklady Akadémii Nauk SSSR, vol. 180 , pp. 1023–1026. - V. I. Amstislavskij. Expansion of recursive hierarchies and R-operations. English translation of the preceding by A. Yablonsky. Soviet mathematics, vol. 9 no. 3 , pp. 703–706. - V. I. Amstislavskij. O razložénii téla množéstv, polučaémyh R-opéraciéj nad rékursivnymi množéstvami. Doklady Akadémii Nauk SSSR, vol. 191 , pp. 743–746. - V. I. Amstislavskij. On the decomposition of a field of sets obtained by an R-operation over recursive sets. English translation of the preceding by S. Shepherd. Soviet mathematics, vol. 11 no. 2 , pp. 419–422. - V. I. Amstislavskij. [REVIEW]Peter G. Hinman - 1972 - Journal of Symbolic Logic 37 (2):409-410.
Ú. I. Žuravlév. Ob algoritmahj uproščéniá dizúnktivnyh normal′nyh form. Doklady Akadémii Nauk SSSR, vol. 132 , pp. 260–263. - Yu. I. Žuravlev. On simplification algorithms for disjunctive normal forms. English translation of the preceding by E. Mendelson. Soviet mathematics, vol. 1 no. 3 , pp. 526–529. [REVIEW]Andrzej Rowicki - 1966 - Journal of Symbolic Logic 31 (1):141-141.
B. M. Kloss. K oprédéléniú složnosti algoritmov. Doklady Akademii Nauk SSSR, vol. 157 , pp. 38–40. - B. M. Kloss. The definition of complexity of algorithms. English translation of the preceding by S. L. Bloom. Soviet Mathematics, vol. 5 no. 4 , pp. 880–882. [REVIEW]Alan Cobham - 1969 - Journal of Symbolic Logic 34 (3):509.
V. A. Ánkov. O nékotoryh supérkonstruktivnyh isčisléniáh vyskazyvanij. Doklady Akadémii Nauk SSSR, vol. 151 , pp. 796–798. - V. A. Jankov. Some superconstructive propositional calculi. English translation of the preceding by Sue Walker. Soviet mathematics, vol. 4 no. 4 , pp. 1103–1105. - V. A. Ánkov. O réalizuémyh formulah logiki vyskazyvanij.Doklady Akadémii Nauk SSSR, vol. 151 , pp. 1035–1037. - V. A. Jankov. Realizable formulas of propositional logic. English translation of the preceding by Elliott Mendelson. Soviet mathematics, vol. 4 no. 4 , pp. 1146–1148. - V. A. Ánkov. O sváži méždu vyvodimost′ú ν intuičionistskom isčislénii vyskazyvanij i konéčnymi implikativnymi strukturami. Doklady Akadémii Nauk SSSR, vol. 151 , pp. 1293–1294. - V. A. Jankov. The relationship between deducibility in the intuitionist propositional calculus and finite implicational structures. English translation of the preceding by Elliott Mendelson. Soviet mathematics, vol. 4 no. 4 , pp. 1203–1204. [REVIEW]Gene F. Rose - 1970 - Journal of Symbolic Logic 35 (1):138-139.
M. I. Kratko. Ob odnom klassé isčislénij Posta. Doklady Akadémii Nauk SSSR, Vol. 165 , pp. 994–995. - M. I. Kratko. A class of post calculi. English translation of the preceding by E. Mendelson. Soviet mathematics, vol. 6 No. 6 , pp. 1544–1545. [REVIEW]J. W. Thatcher - 1967 - Journal of Symbolic Logic 32 (3):393.
A. V. Kuznécov and V. Á. Gérčiu. O supérintuicionistskih logikah i finitnoj approksimiruémosti. Doklady Akadémii Nauk SSSR, vol. 195 , pp. 1029–1032. - A. V. Kuznecov and V. A. Gerčiu. Superintuitionistic logics and finite approximability. English translation of the preceding by E. Mendelson. Soviet mathematics, vol. 11 no. 6 , pp. 1614–1619. [REVIEW]Ann Yasuhara - 1972 - Journal of Symbolic Logic 37 (4):757.
N. V. Bélákin. Mašiny T′uringa, rabotaúščié na ploskosti. Doklady Akadémii Nauk SSSR, vol. 168 , pp. 502–503. - N. V. Beljakin. Turing machines operating on a plane. English translation of the preceding by L. Ebner. Soviet mathematics, vol. 7 no. 3 , pp. 661–662. [REVIEW]Patrick C. Fischer - 1968 - Journal of Symbolic Logic 33 (3):469.
A. I. Mal'cév. O svobodnyh razréšimyh gruppah. Doklady Akadémii Nauk SSSR, vol. 130 , pp. 495–498. - A. I. Mal'cev. On free soluble groups. English translation of the preceding by K. A. Hirsch. Soviet mathematics, vol. 1 no. 1 , pp. 65–68. [REVIEW]Verena H. Dyson - 1965 - Journal of Symbolic Logic 30 (1):99.
A. I. Mal′cév. Sirogo rodstvénnyé modéli i rékursivno sovéršénnyé algebry. Doklady Akadémii Nauk SSSR, vol. 145 , pp. 276–279. - A. I. Mal′cév. Strongly related models and recursively complete algebras. English translation of the preceding by Elliott Mendelson. Soviet mathematics, vol. 3 no. 4 , pp. 987–991. [REVIEW]Verena H. Dyson - 1966 - Journal of Symbolic Logic 31 (4):649-650.

Analytics

Added to PP
2019-05-08

Downloads
21 (#729,174)

6 months
10 (#382,663)

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