Advertisement

From logicism to proceduralism (an autobiographical account)

  • G. S. Tseytin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 122)

Keywords

Natural Language Logical Description Predicate Logic Automatic Programming Informal Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. A. Markov, Teoriia Algorifmov, Trudy Matem. inst. im. V. A. Steklova 42 (1954).Google Scholar
  2. [2]
    B. M. Leγkina, T. N. Nikitina, M. I. Otkupshchikova, S. Ia. Fitialov, G. S. Tseitin, “Sistema avtomaticheskogo perevoda, razrabatyvaemaia v gruppe matematicheskoγ lingvistiki VTs LGU,” Nauchno-tekhnicheskaia Informatsiia (1966), No. 1, pp. 40–50; No. 4, p. 31.Google Scholar
  3. [3]
    G. S. Tseitin, “Odin sposob izlozheniia teorii algorifmov i perechislimykh mnozhestv,” Trudy Matem. inst. im. V. A. Steklova 72 (1964), 69–98.Google Scholar
  4. [4]
    G. S. Tseitin, “O verkhnikh granitsakh perechislimykh mnozhestv konstruktivnykh veshchestvennykh chisel,” Trudy Matem. inst. im. V. A. Steklova 113 (1970), 102–172.Google Scholar
  5. [5]
    G. S. Tseitin, “O logicheskom podkhode k avtomatizatsii programmirovaniia,” Vsesoiuzhaia konferentsiia po problemam teoreticheskoi kibernetiki 9–13 Iiunia 1969 g., Tezisy dokladov (Novosibirsk, 1969), 5–6.Google Scholar
  6. [6]
    G. S. Tseitin, “Nekotorye cherty iazyka dlia sistemy programmirovaniia, proveriaiushcheia dokazatel'stva,” Teoriia Programmirovaniia, Chast' 2, Trudy simpoziuma (Novosibirsk, 1972), 234–249. English translation: G. S. Tseytin, “Some features of a language for a proof-checking programming system,” Internation Symposium on Theoretical Programming, Lecture Notes in Computer Science 5 (Berlin: Springer, 1974), 394–407.Google Scholar
  7. [7]
    G. S. Tseitin, “Logiko-matematicheskii podkhod k postroeniiu ékonomiko-informatsionnoi sistemy,” Metody vychislenii, vyp. 6 (Izd. Leningradskogo un-ta, 1970), 107–127.Google Scholar
  8. [8]
    G. S. Tseitin, “Iazyk matematicheskoi logiki kak sredstvo issledovaniia semantiki estestvennogo iazyka,” Problemy Prikladnoi lingvistiki, Tezisy mezhvuzovskoi konferentsii 16–19 dekabria 1969 g., Chast'2 (MGPIIIA, Moskva, 1969), 326–335.Google Scholar
  9. [9]
    G. S. Tseitin, “O promezhutochnom étape pri perevode s estestvennogo iasyka na iazyk ischisleniia predikatov,” Tezisy dokladov na konferentsii po obrabotke informatsii, mashinnomy perevodu i avtomaticheskomu chteniiu teksta (VINITI, Moskva, 1961), 107–111.Google Scholar
  10. [10]
    A. K. Zholkovskii, I. A. Mel'chuk, “O semanticheskom sinteze,” Problemy Kibernetiki 19 (1967), 177–238.Google Scholar
  11. [11]
    G. S. Tseytin, “Features of natural languages in programming languages,” Proc. Fourth International Congress for Logic, Methodology and Philosophy of Science, Bucharest, 1971, P. Suppes, L. Henkin, Gr. C. Moisil, A. Joja, eds., Studies in Logic 74 (Amsterdam: North-Holland, 1973), 215–222. Russian translation: G. S. Tseitin, “Cherty estestvennykh iazykov v iazykakh programmirovaniia,” Mashinnyi Perevod i Prikladnaia Lingvistika 17 (MGPIIIA, Moskva, 1974), 134–143.Google Scholar
  12. [12]
    K. A. Tinn, É. Kh Tyugu, M. I. Unt, “Sistema modul'nogo programmirovaniia dlia TsVM Minsk-22,” VKP-2, Trudy Vsesoiuzhoi Konferentsii po Programmirovaniiu, Zasedanie G. (Novosibirsk, 1970), 23–39.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • G. S. Tseytin
    • 1
  1. 1.Leningrad State UniversityLeningradUSSR

Personalised recommendations