Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs
Ivan Kramosil (1981)
Kybernetika
Similarity:
The search session has expired. Please query the service again.
Ivan Kramosil (1981)
Kybernetika
Similarity:
Nguyen, Quy Hy, Nguyen, Ngoc Cuong (2015-12-08T12:59:38Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
R. Kaufman (1970)
Studia Mathematica
Similarity:
Romm, Freddy A., Figovsky, Oleg L. (1998)
Discrete Dynamics in Nature and Society
Similarity:
G. Trybuś (1974)
Applicationes Mathematicae
Similarity:
Mustafa, Ghulam, Nosh, Nusrat Anjum, Rashid, Abdur (2005)
Lobachevskii Journal of Mathematics
Similarity:
Kifer, Yuri (1998)
Documenta Mathematica
Similarity:
S. K. Srinivasan, K. S. S. Iyer (1965)
Applicationes Mathematicae
Similarity:
W. Dziubdziela (1976)
Applicationes Mathematicae
Similarity:
D. Banjevic, Z. Ivkovic (1979)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Aya Hmissi, Farida Hmissi, Mohamed Hmissi (2012)
ESAIM: Proceedings
Similarity:
This paper deals with some characterizations of gradient-like continuous random dynamical systems (RDS). More precisely, we establish an equivalence with the existence of random continuous section or with the existence of continuous and strict Liapunov function. However and contrary to the deterministic case, parallelizable RDS appear as a particular case of gradient-like RDS. The obtained results are generalizations of well-known analogous theorems in the framework of deterministic...