Results for 'E. M. Fels'

(not author) ( search as author name )
1000+ found
Order:
  1.  9
    On the Reversibility of Algorithms.E. M. Fels & V. S. Cernavskij - 1966 - Journal of Symbolic Logic 31 (4):655.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  19
    V. S. Čérnávskij. Ob obratimosti algorifmov . Trudy Moskovskogo Matématičéskogo Obščéstva, vol. 9 , pp. 425–453.E. M. Fels - 1966 - Journal of Symbolic Logic 31 (4):655-656.
  3.  18
    Ánov Ú. I.. O logičéskih shémah algoritmov . Problémy kibérnétiki, vol. 1 , pp. 75–127.E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):362-363.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  10
    Ánov Ú. I.. О ravnosil′nosti i préobrazovaniáh shém programm . Doklady Akadémii Nauk SSSR, Vol. 113 , pp. 39–42.E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-391.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  5.  3
    Review: N. A. Sanin, Constructive Real Numbers and Constructive Functional Spaces. [REVIEW]E. M. Fels - 1969 - Journal of Symbolic Logic 34 (2):290-292.
  6.  18
    Review: N. M. Nagornyj, Some Generalizations of the Concept of Normal Algorithm. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):360-362.
  7.  6
    Review: S. U. Maslov, On the "Tag" Problem of E. L. Post. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (4):526-527.
  8.  18
    A. A. Lápunov. O logičéskih shémah programm. Problémy kibérnétiki, vol. 1 , pp. 46–74. - A. A. Lyapunov. The logical structure of programmes. English translation of the preceding. Problems of cybernetics, vol. 1 , pp. 48–81. - A. A. Ljapunow. Über logische Programm-Schemata. German translation of the same. Probleme der Kybernetik, vol. 1 , pp. 53–86. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 33 (3):466-467.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9.  7
    Asser Günter , pp. 20–27) has meanwhile gone farther and shown, inter alia, the equivalence of Kalužnin's graph-schematic algorithm concept with Asser's functional-algorithm concept. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):364-364.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10.  15
    Asser Günter. Funktionen-Algorithmen und Graphschemata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 20–27. [REVIEW]E. M. Fels - 1963 - Journal of Symbolic Logic 28 (4):292-292.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11.  10
    A. A. Markov. O konstruktivnyh funkciáh . Problémy konstruktivnogo napravléniá v matématiké, 1, Sbornik rabot, edited by N. A. Šanin, Trudy Maté-matičéskogo Instituta imèni V. A. Stéklova, vol. 52, Izdatél′stvo Akadémii Nauk SSSR, Moscow and Leningrad1958, pp. 315–348. [REVIEW]E. M. Fels - 1966 - Journal of Symbolic Logic 31 (2):255-258.
  12.  16
    A. P. Éršov. Opératornyé algorifmy. II. Problémy kibérnétiki, vol. 8 , pp. 211–233. - A. P. Jerschow. Operator-Algorithmen. II. German translation of the preceding by Heinz D. Modrow. Probleme der Kybernetik, vol. 8 , pp. 208–232. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 33 (3):467.
  13.  45
    Korolúk V. S.. O ponátii adrésnogo algoritma . Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 4 , pp. 95–110. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):364-366.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  14.  12
    Review: G. S. Cejtin, Associative Calculus with Unsolvable Equivalence Problem. [REVIEW]E. M. Fels - 1965 - Journal of Symbolic Logic 30 (2):254-255.
    Direct download  
     
    Export citation  
     
    Bookmark  
  15.  5
    Review: N. A. Sanin, On the Constructive Interpretation of Mathematical Judgments. [REVIEW]E. M. Fels - 1966 - Journal of Symbolic Logic 31 (2):255-258.
  16.  9
    Review: N. N. Vorob'ev, A New Algorithm of Deducibility in the Constructive Propositional Calculus. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):109-109.
  17.  11
    Review: U. I. Anov, On Logical Schemata of Algorithms. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):362-363.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  18.  4
    Review: U. I. Anov, On Matrix Schemata. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-391.
  19.  7
    Review: V. S. Koroluk, On the Concept of Address Algorithm. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):366-366.
  20.  12
    S. Ú. Maslov. O nékotoryh sposobah zadaniá množéstv v bazisah poroždéniá. Doklady Akadémii Nauk SSSR, Vol. 153 , pp. 266–269. - S. Ju. Maslov. Some methods for the definition of sets in generating bases. English translation of the preceding by Avner Falk. Soviet mathematics, vol. 4 no. 6 , pp. 1649–1652. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):392-393.
  21.  21
    S. Ú. Maslov. О strogoj prédstavimosti množéstv isčisléniámi. Doklady Akadémii Nauk SSSR, Vol. 152 , pp. 272–274. - S. Ju. Maslov. Strong representability of sets by calculi. English translation of the preceding by Elliott Mendelson. Soviet mathematics, vol. 4 no. 5 , pp. 1292–1295. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-392.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  22.  24
    N. M. Nagornyj. Nékotoryé obobščénia ponátiá normaľnogo algorifma, . Problémy konstruktivnogo napravléniá v matématiké, 1, Sbornik rabot, edited by N. A. Šanin. Trudy Matématičéskogo Instituta iméni V. A. Stéklova, vol. 52, Izdatéľstvo Akadémii Nauk SSSR, Moscow and Leningrad1958, pp. 7–65. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):360-362.
  23. Review: E. S. Orlovskij, Some Questions in the Theory of Algorithms. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):108-109.
  24. Review: N. M. Nagornyj, On a Minimal Alphabet of Algorithms Over a Given Alphabet. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):108-108.
  25.  13
    S. Ú. Maslov. O “Tag”-problémé E. L. Posta . Problémy konstruktivnogo napravléniá v matématiké, 3, Sbornik rabot, edited by N. A. Šanin, Trudy Matématičéskogo Instituta iméni V. A. Stéklova, vol. 72, Izdatél′stvo “Nauka,”Moscow and Leningrad1964, pp. 57–68. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 32 (4):526-527.
  26.  12
    S. Ú. Maslov. Nékotoryé svojstva apparata kanoničéskih isčislénij E. L. Posta . Problémy konstruktivnogo napravléniá v matématiké, 3, Sbornik rabot, edited by N. A. Šanin, Trudy Matématičéskogo Instituta iméni V. A. Stéklova, vol. 72, Izdatél′stvo “Nauka,”Moscow and Leningrad1964, pp. 5–56. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 32 (4):524-526.
  27.  8
    Review: S. U. Maslov, Some Properties of E. L. Post's Apparatus of Canonical Systems. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (4):524-526.
    Direct download  
     
    Export citation  
     
    Bookmark  
  28.  21
    G. S. Céjtin. Associativnoé isčslénié s nérazréšimoj problémoj ekvivaléntnosti . Problémy konstruktivnogo napravléniá v matématiké, 1, Sbornik rabot, edited by N. A. Šanin, Trudy Matématičéskogo Instituta iméni V. A. Stéklova, vol. 52, Izdatél'stvo Akadémii Nauk SSSR, Moscow and Leningrad1958, pp. 172–189. [REVIEW]E. M. Fels - 1965 - Journal of Symbolic Logic 30 (2):254-255.
  29.  5
    Maslov S. Ú.. Préobrazovanié proizvol′nyh kanoničéskih isčislénij v kanoničéskié isčisléniá spécial′nyh tipov. Doklady Akadémii Nauk SSSR, vol. 147 , pp. 779–782.Maslov S. Ju.. Transformation of arbitrary canonical calculi into canonical calculi of special types. English translation of the preceding by Gdss R. N.. Soviet mathematics, vol. 3 no. 6 , pp. 1708–1711. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 32 (4):527-527.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  30.  20
    N. A. Šanin. Konstruktivnyé véščéstvénnyé ĉisla i konstruktivnyé funkcional'nyé prostranstva (Constructive real numbers and constructive functional spaces). Problémy konstrukticnogo napravléniá v matématik, 2 (Konstruktivnyj matématičéskij analiz), Sbornik rabot, edited by N. A. Šanin, Trudy Matématičéskogo Instituta imèni V. A. Stéklova, vol. 67Izdatél′stvo Akadémii Nauk SSSR, Moscow and Leningrad1962, pp. 15–294. [REVIEW]E. M. Fels - 1969 - Journal of Symbolic Logic 34 (2):290-292.
  31.  49
    N. N. Vorob′év. Novyj algorifm vyvodimosti v konstruktivnom isčislénii uyskazyvanij . Problémy konstruktivnogo napravléniá v matématiké, 1, Sbornik rabot, edited by N. A. Šanin, Trudy Matématičéskogo Instituta imèni V. A. Stéklova, vol. 52, Izdatél′stvo Akadémii Nauk SSSR, Moscow and Leningrad1958, pp. 193–225. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):108-109.
  32.  7
    Review: A. A. Ljapuno, The Logical Structure of Programmes. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 33 (3):466-467.
  33. Review: A. A. Markov, On Constructive Functions. [REVIEW]E. M. Fels - 1966 - Journal of Symbolic Logic 31 (2):258-258.
     
    Export citation  
     
    Bookmark  
  34.  8
    Review: A. P. Jerschow, Heinz D. Modrow, Operator Algorithmen. II. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 33 (3):467-467.
  35.  7
    Review: A. P. Ersov, Operator Algorithms. I. Basic Concepts. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):364-366.
  36.  8
    Review: Gunter Asser, Funktionen-Algorithmen und Graphschemata. [REVIEW]E. M. Fels - 1963 - Journal of Symbolic Logic 28 (4):292-292.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37.  7
    Review: L. A. Kaluznin, On Algorithmization of Mathematical Problems. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):363-364.
  38.  12
    Review: N. V. Belakin, The Universality of a Computing Machine with Potentially Infinite Exterior Memory. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):366-366.
  39.  8
    Review: S. Ju. Maslov, Transformation of Arbitrary Canonical Calculi into CanonicaL Calculi of Special Types. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (4):527-527.
    Direct download  
     
    Export citation  
     
    Bookmark  
  40. Review: S. Ju. Maslov, Elliott Mendelson, Strong Representability of Sets by Calculi. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-392.
  41. Review: S. U. Maslov, Some Methods for the Definition of Sets in Generating Bases. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):392-393.
  42. Review: U. I. Anov, On the Equivalence and Transformations of Program Schemata. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-391.
  43.  12
    Review: V. K. Detlovs, The Equivalence of Normal Algorithms and Recursive Functions. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):362-362.
  44.  5
    Review: V. S. Cernavskij, On the Reversibility of Algorithms. [REVIEW]E. M. Fels - 1966 - Journal of Symbolic Logic 31 (4):655-656.
  45. Casotti, M., Maestro e Scolaro. [REVIEW]H. Fels - 1932 - Philosophisches Jahrbuch 45:253-254.
    No categories
     
    Export citation  
     
    Bookmark  
  46. How to Do Things with Gendered Words.E. M. Hernandez & Archie Crowley - 2024 - In Ernest Lepore & Luvell Anderson (eds.), The Oxford Handbook of Applied Philosophy of Language. New York, NY: Oxford University Press.
    With increased visibility of trans people comes increased philosophical interest in gendered language. This chapter aims to look at the research on gendered language in analytic philosophy of language so far, which has focused on two concerns: (1) determining how to define gender terms like ‘man’ and ‘woman’ such that they are trans inclusive and (2) if, or to what extent, we should use gendered language at all. We argue that the literature has focused too heavily on how gendered language (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  47. Wijsgerige vereniging Thomas Van aquino vijftigjarig bestaan.C. E. M. Struyker Boudier - 1984 - Tijdschrift Voor Filosofie 46 (3):546-549.
    No categories
     
    Export citation  
     
    Bookmark  
  48.  12
    Peter Abelard.E. M. Buytaert (ed.) - 1974 - The Hague,: M. Nijhoff.
  49.  20
    The Αθηναίων Πολιτεία and the Chronology of the Years 462—445.E. M. Walker - 1892 - The Classical Review 6 (03):95-99.
  50.  63
    Facts, freedom and foreknowledge: E. M. Zemach and D. Widerker.E. M. Zemach - 1987 - Religious Studies 23 (1):19-28.
    Is God's foreknowledge compatible with human freedom? One of the most attractive attempts to reconcile the two is the Ockhamistic view, which subscribes not only to human freedom and divine omniscience, but retains our most fundamental intuitions concerning God and time: that the past is immutable, that God exists and acts in time, and that there is no backward causation. In order to achieve all that, Ockhamists distinguish ‘hard facts’ about the past which cannot possibly be altered from ‘soft facts’ (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   11 citations  
1 — 50 / 1000