Abstract
The problem of equivalent transformations of logical expressions with quantifiers finds wide applications when the engineer uses logical models for the solution of practical problems; here the engineer has to deal with an extensive parenthesis form of logical functions of a large number of variables. In this paper, a description is given of an algebraic system of the uncovering of quantifiers, in which use is made of a componentwise uncovering method combined with a developed block of theorems of equivalent transformations not only at the level of variables, but also at the level of logical functions. Results of the program implementation of the system are set out in examples with a large number of variables.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Kobrinskii, N.E. and Trakhtenbrot, B.A., Vvedenie v teoriyu konechnykh avtomatov (Introduction to the Theory of Finite Automata), Moscow: Fizmatgiz, 1962.
Novikov, P.S., Elementy matematicheskoi logiki (Elements of Mathematical Logic), Moscow: Fizmatgiz, 1973.
Serikov, Yu.A., Logical Methods of the Solution of Some Diagnostic Problems, Cand. Sci. Dissertation, Moscow, 1973.
Author information
Authors and Affiliations
Additional information
__________
Translated from Avtomatika i Telemekhanika, No. 10, 2005, pp. 108–119.
Original Russian Text Copyright © 2005 by Serikov.
Rights and permissions
About this article
Cite this article
Serikov, Y.A. A Mechanism of Uncovering of Quantifiers in Boolean Variables. Autom Remote Control 66, 1628–1639 (2005). https://doi.org/10.1007/s10513-005-0196-9
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10513-005-0196-9