Advertisement

Some model-theoretical properties of logic for programs with random control

  • Extended Abstract
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 148)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Gill, Computational complexity of probabilistic Turing Machines, SIAM Journ. on Comp., vol.6, No 4, 1977 pp.675–695Google Scholar
  2. [2]
    Grabowski M., Kreczmar A., Dynamic theories of real and complex numbers, Proc. of MFCS 1978 Zakopane, Lect. Notes in Comp. Sc. vol.64, Spr. Ver.Google Scholar
  3. [3]
    Havel D., First order dynamic logic, Lect. Notes in Comp. Sc. vol.68, 1979, Spr. Ver.Google Scholar
  4. [4]
    Mirkowska G., Algorithmic logic with nondeterministic programs, Fund. Inf. 3 1979 pp.45–64Google Scholar
  5. [5]
    Rabin M., Probabilistic algorithms, Proc. of Symp. Algorithms and complexity, Carnegie-Mellon UNIV., April 7–9, 1976, edited by J. TraubGoogle Scholar
  6. [6]
    Reif J.H., Logics for probabilistic programming, Proc. of STOC conf., 1980, pp.Google Scholar
  7. [7]
    Salwicki A., On algorithmic theory of stacks, Proc. of MFCS 1978, Zakopane, Lect. Notes in Comp. Sc. vol.64, Spr. Ver.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Extended Abstract
    • 1
  1. 1.Michał Grabowski Institute of Computer ScienceWarsaw UniversityPoland

Personalised recommendations