Abstract
Three routines which may be used in the computertreatment of general finite concrete logics aredescribed. The results for some particular finiteconcrete logics are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Gudder, S. (1979). Stochastic Methods in Quantum Mechanics, North-Holland, New York.
Kalmbach, G. (1983). Orthomodular Lattices, Academic Press, London.
Navara, M. (1994). An orthomodular lattice admiting no group-valued measure, Proceedings of American Mathematical Society, 122, 7–12.
Ovchinnikov, P. (1992). Measures on the logics of Gudder and Marchand, Konstruktivnaya Teoriya Funktsii i Funktsionalnyi Analiz, 8, 95–98.
Ovchinnikov, P. (1994). A Galois correspondence connected with extending signed measures on a σ-class of subsets of a finite set, Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 1994(5), 36–40.
Sultanbekov, F. (1993). Set logics and their representations, International Journal of Theoretical Physics, 32, 2177–2186.
Zerbe, J., and Gudder, S. (1985). Additivity of integrals on generalized measure spaces, Journal of Combinatorial Theory (A), 39, 42–51.
Rights and permissions
About this article
Cite this article
Sultanbekov, F. Solving Problems on Finite Concrete Logics with the Help of a PC. International Journal of Theoretical Physics 37, 199–202 (1998). https://doi.org/10.1023/A:1026694013057
Issue Date:
DOI: https://doi.org/10.1023/A:1026694013057