Theoretical aspects of Σ-programming

  • Goncharov S. S. 
  • Sviridenko D. I. 
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 215)


List Extension Dynamic Logic Subject Domain Conservative Extension Recursive Definition 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barwise J. Admissible sets and structures, B., Springer-Verlag, 1975.Google Scholar
  2. 2.
    Ershov Yu.L. The principle of Σ-enumeration, Doklady AN SSSR, 1983, v.270, No 5, p. 786–788.Google Scholar
  3. 3.
    Ershov Yu.L. The dynamic logic over admissible sets, Doklady AN SSSR, 1983, v.273, No 5, p. 1045–1048.Google Scholar
  4. 4.
    Goncharov S.S., Sviridenko D.I. Σ-programming. In: Vychislitel'nye sistemy, vyp.107, Novosibirsk, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Goncharov S. S. 
  • Sviridenko D. I. 

There are no affiliations available

Personalised recommendations