This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Gill, Computational complexity of probabilistic Turing Machines, SIAM Journ. on Comp., vol.6, No 4, 1977 pp.675–695
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.
Havel D., First order dynamic logic, Lect. Notes in Comp. Sc. vol.68, 1979, Spr. Ver.
Mirkowska G., Algorithmic logic with nondeterministic programs, Fund. Inf. 3 1979 pp.45–64
Rabin M., Probabilistic algorithms, Proc. of Symp. Algorithms and complexity, Carnegie-Mellon UNIV., April 7–9, 1976, edited by J. Traub
Reif J.H., Logics for probabilistic programming, Proc. of STOC conf., 1980, pp.
Salwicki A., On algorithmic theory of stacks, Proc. of MFCS 1978, Zakopane, Lect. Notes in Comp. Sc. vol.64, Spr. Ver.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abstract, E. (1983). Some model-theoretical properties of logic for programs with random control. In: Salwicki, A. (eds) Logics of Programs and Their Applications. Logic of Programs 1980. Lecture Notes in Computer Science, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11981-7_10
Download citation
DOI: https://doi.org/10.1007/3-540-11981-7_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11981-4
Online ISBN: 978-3-540-39445-7
eBook Packages: Springer Book Archive