Results for 'IUrii Leonidovich Ershov'

81 found
Order:
  1. Handbook of Recursive Mathematics: Recursive Model Theory.IUrii Leonidovich Ershov (ed.) - 1998 - Elsevier.
    v. 1. Recursive model theory -- v. 2. Recursive algebra, analysis and combinatorics.
    Direct download  
     
    Export citation  
     
    Bookmark  
  2.  6
    Constructive Models.I͡Uriĭ Leonidovich Ershov - 2000 - Consultants Bureau.
    The theory of constructive (recursive) models follows from works of Froehlich, Shepherdson, Mal'tsev, Kuznetsov, Rabin, and Vaught in the 50s. Within the framework of this theory, algorithmic properties of abstract models are investigated by constructing representations on the set of natural numbers and studying relations between algorithmic and structural properties of these models. This book is a very readable exposition of the modern theory of constructive models and describes methods and approaches developed by representatives of the Siberian school of algebra (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  14
    Computable Categoricity and the Ershov Hierarchy.Bakhadyr Khoussainov, Frank Stephan & Yue Yang - 2008 - Annals of Pure and Applied Logic 156 (1):86-95.
    In this paper, the notions of Fα-categorical and Gα-categorical structures are introduced by choosing the isomorphism such that the function itself or its graph sits on the α-th level of the Ershov hierarchy, respectively. Separations obtained by natural graphs which are the disjoint unions of countably many finite graphs. Furthermore, for size-bounded graphs, an easy criterion is given to say when it is computable-categorical and when it is only G2-categorical; in the latter case it is not Fα-categorical for any (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  4.  12
    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.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  14
    Recursive Structures and Ershov's Hierarchy.Christopher J. Ash & Julia F. Knight - 1996 - Mathematical Logic Quarterly 42 (1):461-468.
    Ash and Nerode [2] gave natural definability conditions under which a relation is intrinsically r. e. Here we generalize this to arbitrary levels in Ershov's hierarchy of Δmath image sets, giving conditions under which a relation is intrinsically α-r. e.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  6.  18
    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. [REVIEW]Ivan Soskov - 1998 - Journal of Symbolic Logic 63 (2):747-748.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7.  12
    Asymptotic Density and the Ershov Hierarchy.Rod Downey, Carl Jockusch, Timothy H. McNicholl & Paul Schupp - 2015 - Mathematical Logic Quarterly 61 (3):189-195.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  13
    On the Path of Restructuring: The Dialectics of Productive Forces and Relations of Production.Iurii K. Pletnikov - 1988 - Russian Studies in Philosophy 27 (1):25-50.
    In the resolution of the Central Committee of the CPSU entitled "On the Periodical Kommunist," the study of the dialectics of the forces and relations of production is assigned to the sphere of economics. It is no accident that the question is posed in this way. Today, under conditions of restructuring, a concrete analysis of the economic connections, contradictions, and interactions of socialist society and of the real forms of manifestation of economic relations is more important than ever. The [current] (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  1
    Orthodox Theological Understanding of Church-State Relations in Ukraine at the Time of Development of Media and Information Technology.Iurii Kovalenko - 2015 - Ukrainian Religious Studies 74:197-211.
    Iurii Kovalenko.Orthodox theological understanding of church-state relations in Ukraine at the time of development of Media and Information Technology. The author, who for many years was the press-secretary to the Primate of the Ukrainian Orthodox Church, considers continuity UOC position on the principles of church-state relations and their genesis in accordance with the socio-political processes taking place in Ukraine, the development of media and information technology.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  2
    Symphony No.1 by Boris Tishchenko: Towards the “New Shores” (on the Revivalof Russian Symphonism in the 1960s).Iurii Eduardovich Serov - 2022 - Философия И Культура 2:13-25.
    The subject of this research is the period of Soviet music in the 1960s. A new generation of the composers – the “Sixtiers” – came upon the stage, demonstrating remarkable artistic achievements, fresh and modern musical language. This article is dedicated to the symphonic work of the prominent Russian composer of the late XX century Boris Ivanovich Tishchenko. Particular attention is given to the Symphony No.1, which he created at the age of 22. Tishchenko burst into the Soviet musical space (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  11.  8
    On Genericity and Ershov's Hierarchy.Amy Gale & Rod Downey - 2001 - Mathematical Logic Quarterly 47 (2):161-182.
    It is natural to wish to study miniaturisations of Cohen forcing suitable to sets of low arithmetic complexity. We consider extensions of the work of Schaeffer [9] and Jockusch and Posner [6] by looking at genericity notions within the Δ2 sets. Different equivalent characterisations of 1-genericity suggest different ways in which the definition might be generalised. There are two natural ways of casting the notion of 1-genericity: in terms of sets of strings and in terms of density functions, as we (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  12. Innovative Trends in the Symphonic Works of Soviet Composers of the 1960s and Symphony No.3 by B. Tishchenko. Part 2.Iurii Eduardovich Serov - 2021 - Философия И Культура 10:1-15.
    The subject of this research is the period of Russian symphonic music of the 1960s. A new generation of composers – the “Sixtiers” – introduced a fresh modern musical language and remarkable artistic achievements. In first part of the article, the author dwell on several fundamental symphonic works by R. Shchedrin, S. Slonimsky, E. Denisov, Y. Falik, N. Karetnikov, as well gives general characteristics to this period. The second part of the article examines the compositions by A. Schnittke and L. (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  13. Renewal of the Domestic Symphonism of the 1960s in the Works of Young Leningrad Composers.Iurii Eduardovich Serov - 2022 - Философия И Культура 4:9-24.
    The subject of the study is the period of Russian symphonic music of the 1960s. A new generation of "sixties" composers has entered the Soviet music scene, imperiously declaring themselves with bright creative achievements, fresh and modern musical language. The epoch of the turning point dictated a new reality, required new artistic thinking, generated diverse creative ideas. The panorama of Russian music was quite colorful, many things in art appeared and disappeared very rapidly, stylistic pluralism, lost at the dawn of (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  14.  32
    The Hausdorff-Ershov Hierarchy in Euclidean Spaces.Armin Hemmerling - 2006 - Archive for Mathematical Logic 45 (3):323-350.
    The topological arithmetical hierarchy is the effective version of the Borel hierarchy. Its class Δta 2 is just large enough to include several types of pointsets in Euclidean spaces ℝ k which are fundamental in computable analysis. As a crossbreed of Hausdorff's difference hierarchy in the Borel class ΔB 2 and Ershov's hierarchy in the class Δ0 2 of the arithmetical hierarchy, the Hausdorff-Ershov hierarchy introduced in this paper gives a powerful classification within Δta 2. This is based (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  15. Structure and Content of the Training Process Aimed at Increasing the Power Endurance in the Preparatory Period.Vladimir Leonidovich Konovalov, Aleksey Ivanovich Kishkin & Irina Nikolaevna Katkanova - 2021 - Kant 38 (1):263-269.
    An increase in the level of strength endurance can be carried out during the period of a special preparatory stage in the annual cycle of training athletes. The present research proposes a periodization of shooters' sports training with the substantiation of the measures taken to develop such a motor quality as strength endurance. The aim of the research is to organize the training process in a way that the development of the motor quality, strength endurance, enhanced performance in shooting. Young (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16. Econometric Modeling in the System Assessment of the Scope of Public Services Provision.Alexander Leonidovich Osipov & Vladimir Nikolaevich Babeshko - 2021 - Kant 39 (2):82-85.
    The purpose of the study is to establish a causal relationship of job satisfaction depending on the average number of employees, the level of wages, the number of applications and the time factor. The article deals with the problem of modeling socio-economic satisfaction with the work of employees in the provision of public services. Based on the correlation analysis, linear and nonlinear models of the interrelationships of factors related to this problem are formed. Econometric models have been developed to effectively (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17. Algorithms in Modern Mathematics and Computer Science: Proceedings, Urgench, Uzbek Ssr, September 16-22, 1979.A. P. Ershov & Donald Ervin Knuth (eds.) - 1981 - Springer Verlag.
  18.  26
    Yu. L. Ershov and E. A. Palyutin. Mathematical Logic. Revised English Translation by Vladimir Shokurov of the Preceding. Mir Publishers, Moscow1984, 303 Pp. [REVIEW]Elliott Mendelson - 1986 - Journal of Symbolic Logic 51 (3):829-829.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  19.  11
    Preface.Yuri L. Ershov, Klaus Keimel, Ulrich Kohlenbach & Andrei Morozov - 2009 - Annals of Pure and Applied Logic 159 (3):249-250.
  20.  1
    Open Orthodoxy as an Alternative and Perspective.Iurii Kovalenko - 2018 - Ukrainian Religious Studies 86:48-57.
    In this research, author analyzes and interprets data of sociological researches of the Razumkov Centre concerning the religious self-identification of Ukrainian citizens, their attitude towards the Church in general and towards the denominations and religions presented in Ukraine in the dynamics from the year 2000 to nowadays. The author also considers external and internal outlook trends and shows a dangerous contradiction between them. As an alternative to solve this conflict, the author suggests the idea of Open Orthodoxy and presents an (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21.  8
    On the Classification of (Effective) Φ-Spaces.YuL Ershov - 2009 - Annals of Pure and Applied Logic 159 (3):285-291.
    In this article we study the problem of classifying φ-spaces with a fixed basis subspace. In the first part, this problem is treated in a more general topological context. The second part is devoted to effective φ-spaces.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  22.  9
    Yuriĭ L. Ershov. Opredelimost′ I Rychislimost′. Russian Original of the Preceding. Sibirskaya Shkola Algebry I Logiki. Nauchnaya Kniga, Novosibirsk1996, 300 Pp. - Richard Lassaigne and Michel de Rougemont. Logique Et Complexité. Collection Informatique. Hermès, Paris1996, Viii + 322 Pp. [REVIEW]Denis Therien - 1998 - Journal of Symbolic Logic 63 (2):748-748.
  23.  3
    RRC-Fields with Small Absolute Galois Groups.YuL Ershov - 1989 - Annals of Pure and Applied Logic 43 (3):197-208.
  24.  8
    Review: Yu. L. Ershov, E. A. Palyutin, Mathematical Logic. [REVIEW]Elliott Mendelson - 1986 - Journal of Symbolic Logic 51 (3):829-829.
  25. An Ax-Kochen-Ershov Principle for Intermediate Structures Between Valued Groups and Valued Fields.F. Delon & P. Simonetta - 1999 - Journal of Symbolic Logic 64 (3):991-1027.
  26. Local Organising Committee.D. P. Gorsky, Yu L. Ershov, V. I. Kuptsov, V. A. Lektorsky, S. T. Melyukhin, Yu V. Sachkov, V. S. Stepin, I. S. Melyukhin, S. A. Nikolsky & S. I. Adyan - 1988 - Synthese 76:453-473.
     
    Export citation  
     
    Bookmark  
  27.  21
    Review: Yu. L. Ershov, I. A. Lavrov, A. D. Taimanov, M. A. Taitslin, P. M. Cohn, Elementary Theories. [REVIEW]C. Smorynski - 1974 - Journal of Symbolic Logic 39 (3):603-603.
  28.  16
    Review: Yuri L. Ershov, Definability and Computability. [REVIEW]Ivan Soskov - 1998 - Journal of Symbolic Logic 63 (2):747-748.
  29.  9
    Index Sets in Ershov's Hierarchy.Jacques Grassin - 1974 - Journal of Symbolic Logic 39 (1):97-104.
  30.  23
    Un Principe d'Ax-Kochen-Ershov Pour Des Structures Intermediares Entre Groupes Et Corps Values.Françoise Delon & Patrick Simonetta - 1999 - Journal of Symbolic Logic 64 (3):991-1027.
    An Ax-Kochen-Ershov principle for intermediate structures between valued groups and valued fields. We will consider structures that we call valued B-groups and which are of the form $\langle G, B, *, v\rangle$ where - G is an abelian group, - B is an ordered group, - v is a valuation defined on G taking its values in B, - * is an action of B on G satisfying: ∀ x ∈ G ∀ b ∈ B v(x * b) = (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  31.  27
    On Σ₁-Structural Differences Among Finite Levels of the Ershov Hierarchy.Yue Yang & Liang Yu - 2006 - Journal of Symbolic Logic 71 (4):1223 - 1236.
    We show that the structure R of recursively enumerable degrees is not a Σ₁-elementary substructure of Dn, where Dn (n > 1) is the structure of n-r.e. degrees in the Ershov hierarchy.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  32.  6
    An Ax-Kochen-Ershov Theorem for Monotone Differential-Henselian Fields.Tigran Hakobyan - 2018 - Journal of Symbolic Logic 83 (2):804-816.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33.  11
    Friedberg Numberings in the Ershov Hierarchy.Serikzhan A. Badaev, Mustafa Manat & Andrea Sorbi - 2015 - Archive for Mathematical Logic 54 (1-2):59-73.
    We show that for every ordinal notation ξ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\xi}$$\end{document} of a nonzero computable ordinal, there exists a Σξ-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma^{-1}_\xi}$$\end{document}—computable family which up to equivalence has exactly one Friedberg numbering, which does not induce the least element in the corresponding Rogers semilattice.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34.  47
    Bounding Computably Enumerable Degrees in the Ershov Hierarchy.Angsheng Li, Guohua Wu & Yue Yang - 2006 - Annals of Pure and Applied Logic 141 (1):79-88.
    Lachlan observed that any nonzero d.c.e. degree bounds a nonzero c.e. degree. In this paper, we study the c.e. predecessors of d.c.e. degrees, and prove that given a nonzero d.c.e. degree , there is a c.e. degree below and a high d.c.e. degree such that bounds all the c.e. degrees below . This result gives a unified approach to some seemingly unrelated results. In particular, it has the following two known theorems as corollaries: there is a low c.e. degree isolating (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35.  2
    Weak Density and Nondensity Among Transfinite Levels of the Ershov Hierarchy.Yong Liu & Cheng Peng - 2020 - Notre Dame Journal of Formal Logic 61 (4):521-536.
    We show that for any ω-r.e. degree d and n-r.e. degree b with d
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  36.  27
    Rogers Semilattices of Families of Two Embedded Sets in the Ershov Hierarchy.Serikzhan A. Badaev, Mustafa Manat & Andrea Sorbi - 2012 - Mathematical Logic Quarterly 58 (4-5):366-376.
    Let a be a Kleene's ordinal notation of a nonzero computable ordinal. We give a sufficient condition on a, so that for every equation image-computable family of two embedded sets, i.e., two sets A, B, with A properly contained in B, the Rogers semilattice of the family is infinite. This condition is satisfied by every notation of ω; moreover every nonzero computable ordinal that is not sum of any two smaller ordinals has a notation that satisfies this condition. On the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  37.  8
    Classifying equivalence relations in the Ershov hierarchy.Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi & Mars Yamaleev - 2020 - Archive for Mathematical Logic 59 (7-8):835-864.
    Computably enumerable equivalence relations received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility \. This gives rise to a rich degree structure. In this paper, we lift the study of c-degrees to the \ case. In doing so, we rely on the Ershov hierarchy. For any notation a for a non-zero computable ordinal, we prove several algebraic properties of the degree structure induced by \ on the \ equivalence (...)
    No categories
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  38.  25
    Ú. L. Éršov. I. A. Lavrov, A. D. Tajmanov, and M. A. Tajclin. Eléméntarnyé Téorii. Uspéhi Matématičéskih Nauk, Vol. 20 No. 4 , Pp. 37–108. - Yu. L. Ershov, I. A. Lavrov, A. D. Taimanov, and M. A. Taitslin. Elementary Theories. English Translation of the Preceding by P. M. Cohn. Russian Mathematical Surveys, Vol. 20 No. 4 , Pp. 35–105. [REVIEW]C. Smorynski - 1974 - Journal of Symbolic Logic 39 (3):603.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39.  1
    Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy.Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev & Luca San Mauro - 2021 - In Sujata Ghosh & Thomas Icard (eds.), Logic, Rationality, and Interaction: 8th International Workshop, Lori 2021, Xi’an, China, October 16–18, 2021, Proceedings. Springer Verlag. pp. 1-13.
    Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order complexity of their defining formulas. The Ershov Hierarchy classifies Δ20\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varDelta ^0_2$$\end{document} sets with respect to the number of mistakes that are needed to approximate them. Biacino and Gerla extended the Kleene Hierarchy to the realm of fuzzy sets, whose membership functions range in a complete lattice L. (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  40. Merchant Moscow: Images of Russia's Vanished Bourgeoisie. Edited by James L. West and Iurii A. Petrov.F. S. Zuckerman - 2000 - The European Legacy 5 (4):617-617.
     
    Export citation  
     
    Bookmark  
  41.  38
    S. V. Bredikhin, Yu. L. Ershov, and V. E. Kal'nei. Fields with Two Linear Orderings. Mathematical Notes of the Academy of Sciences of the USSR, Vol. 7, Pp. 319–325. , Pp. 525–536.) - Moshe Jarden. The Elementary Theory of Large E-Fold Ordered Fields. Acta Mathematica, Vol. 149 , Pp. 239–260. - Alexander Prestel. Pseudo Real Closed Fields. Set Theory and Model Theory, Proceedings of an Informal Symposium Held at Bonn, June 1–3, 1979, Edited by R. B. Jensen and A. Prestel, Lecture Notes in Mathematics, Vol. 872, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, Pp. 127–156. - Moshe Jarden. On the Model Companion of the Theory of E-Fold Ordered Fields. Acta Mathematica, Vol. 150, Pp. 243–253. - Alexander Prestel. Decidable Theories of Preordered Fields. Mathematische Annalen, Vol. 258 , Pp. 481–492. - Ju. L. Eršov. Regularly R-Closed Fields. Soviet Mathematics—Doklady, Vol. 26 , Pp. 363–366. , Pp. 538-540.). [REVIEW]Gregory Cherlin - 1986 - Journal of Symbolic Logic 51 (1):235-237.
  42.  21
    Anthony Heywood, Engineer of Revolutionary Russia: Iurii V. Lomonosov and the Railways. Farnham: Ashgate, 2011. Pp. Xxvi+400. ISBN 978-0-7546-553908. £75.00. [REVIEW]Steven Main - 2012 - British Journal for the History of Science 45 (2):305-306.
  43.  8
    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. Elsevier. pp. 119.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  44.  9
    Anthony Heywood. Engineer of Revolutionary Russia: Iurii L. Lomonosov and the Railways. Xxvi + 500 Pp., Illus., Bibl., Index. Burlington, Vt.: Ashgate, 2011. $155.95. [REVIEW]Paul Josephson - 2012 - Isis 103 (4):798-799.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45.  9
    The Discrete Parts of Approximately Decidable Sets in Euclidean Spaces.Armin Hemmerling - 2003 - Mathematical Logic Quarterly 49 (4):428.
    It is shown that the classes of discrete parts, A ∩ ℕk, of approximately resp. weakly decidable subsets of Euclidean spaces, A ⊆ ℝk, coincide and are equal to the class of ω-r. e. sets which is well-known as the first transfinite level in Ershov's hierarchy exhausting Δ02.
    Direct download  
     
    Export citation  
     
    Bookmark  
  46.  25
    Weak Computability and Representation of Reals.Xizhong Zheng & Robert Rettinger - 2004 - Mathematical Logic Quarterly 50 (45):431-442.
    The computability of reals was introduced by Alan Turing [20] by means of decimal representations. But the equivalent notion can also be introduced accordingly if the binary expansion, Dedekind cut or Cauchy sequence representations are considered instead. In other words, the computability of reals is independent of their representations. However, as it is shown by Specker [19] and Ko [9], the primitive recursiveness and polynomial time computability of the reals do depend on the representation. In this paper, we explore how (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  47.  22
    Characterizations of the Class ~2^T^a Over Euclidean Spaces.Armin Hemmerling - 2004 - Mathematical Logic Quarterly 50 (4):507.
    We present some characterizations of the members of Δta2, that class of the topological arithmetical hierarchy which is just large enough to include several fundamental types of sets of points in Euclidean spaces ℝk. The limit characterization serves as a basic tool in further investigations. The characterization by effective difference chains of effectively exhaustible sets yields only a hierarchy within a subfield of Δta2. Effective difference chains of transfinite order types, consisting of complements of effectively exhaustible sets, as well as (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  6
    On Principles of Creative Upbringing and Training of Contemporary Youth.P. L. Kapitsa - 1972 - Russian Studies in Philosophy 10 (4):299-315.
    Petr Leonidovich Kapitsa, world-renowned physicist, often turns to themes that at first glance seem far removed from the sphere of his basic scientific interests. He is the author of numerous articles and papers on problems of the development of science and the organization of scientific work . Many have read with interest his remarkable recollections of Rutherford, published in Novy mir.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  57
    A mathematical characterization of interpretation between theories.J. Van Benthem - 1984 - Studia Logica 43:295.
    Of the various notions of reduction in the logical literature, relative interpretability in the sense of Tarskiet al. [6] appears to be the central one. In the present note, this syntactic notion is characterized semantically, through the existence of a suitable reduction functor on models. The latter mathematical condition itself suggests a natural generalization, whose syntactic equivalent turns out to be a notion of interpretability quite close to that of Ershov [1], Szczerba [5] and Gaifman [2].
    Direct download (4 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   15 citations  
  50.  51
    The Russian Cosmists: The Esoteric Futurism of Nikolai Fedorov and His Followers.George M. Young - 2012 - Oxford University Press.
    The spiritual geography of Russian cosmism. General characteristics ; Recent definitions of cosmism -- Forerunners of Russian cosmism. Vasily Nazarovich Karazin (1773-1842) ; Alexander Nikolaevich Radishchev (1749-1802) ; Poets: Mikhail Vasilyevich Lomonosov, (1711-1765) and Gavriila Romanovich Derzhavin (1743-1816) ; Prince Vladimir Fedorovich Odoevsky (1803-1869) ; Aleksander Vasilyevich Sukhovo-Kobylin (1817-1903) -- The Russian philosophical context. Philosophy as a passion ; The destiny of Russia ; Thought as a call for action ; The totalitarian cast of mind -- The religious and spiritual (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
1 — 50 / 81