Skip to main content
SpringerLink
Log in

From logicism to proceduralism (an autobiographical account)

  • Conference paper
  • First Online:
Algorithms in Modern Mathematics and Computer Science

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 122))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. A. Markov, Teoriia Algorifmov, Trudy Matem. inst. im. V. A. Steklova 42 (1954).

    Google Scholar 

  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. 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. 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. 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. 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. 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. 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. 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. A. K. Zholkovskii, I. A. Mel'chuk, “O semanticheskom sinteze,” Problemy Kibernetiki 19 (1967), 177–238.

    Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

  1. Leningrad State University, Leningrad, USSR

    G. S. Tseytin

Authors
  1. G. S. Tseytin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei P. Ershov Donald E. Knuth

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tseytin, G.S. (1981). From logicism to proceduralism (an autobiographical account). In: Ershov, A.P., Knuth, D.E. (eds) Algorithms in Modern Mathematics and Computer Science. Lecture Notes in Computer Science, vol 122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11157-3_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-11157-3_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11157-3

  • Online ISBN: 978-3-540-38621-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation