# Venjunction

Chapter
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 101)

## Abstract

The first chapter is entirely dedicated to venjunction, which is represented as a logic-dynamical operation of asynchronous sequential logic. This operation is being thoroughly examined from all angles, such as: prerequisites of appearing, particularities of the implied time, necessary definitions, methods of analytical and graphical representations, enumeration of two-variable functions, and finishing by basic features of venjunctions in connection with operations of Boolean algebra. In the beginning of this section one will find clarifications of terminology to avoid incomprehension, and assure continuity between generally accepted notions and innovations. This to one or another degree refers to the following notions: format of a binary set, asynchronous sequence, logical switchings, moments and background of switchings, sequence of logical switchings, switching and venjunctive functions, venjunctive complete form, graph of venjunctive function, cyclic graph of switchings, and venjunctive representation of indeterminacy.

## Keywords

Binary Variable Binary Sequence Versus Versus Versus Versus Truth Table Boolean Variable
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. 1.
Vasyukevich, V.: Whenjunction as a logic/dynamic operation. Definition, implementation and applications. Automatic Control and Computer Sciences 18(6), 68–74 (1984)Google Scholar
2. 2.
Vasyukevich, V.: Asynchronous sequences decoding. ACCS Journal 41(2), 93–99 (2007)Google Scholar
3. 3.
Peirce, C.: On the Algebra of Logic. American Journal of Mathematics 3, 15–57 (1880)
4. 4.
Sheffer, H.: A set of five independent postulates for Boolean algebras, with application to logical constants. Transactions of the American Mathematical Society 14, 481–488 (1913)
5. 5.
Venn, J.: On the Diagrammatic and Mechanical Representation of Propositions and Reasonings. Philosophical Magazine and Journal of Science, Ser. 5 10(59) (1880)Google Scholar
6. 6.
Zhegalkin, I.: On the Technique of Calculating Propositions in Symbolic Logic. Mathematical Journal 34(1), 9–28 (1927) (in Russian)Google Scholar
7. 7.
Veitch, E.: A Chart Method for Simplifying Truth Functions. Transactions of the 1952 ACM Annual Meeting, 127–133 (1952)Google Scholar
8. 8.
Karnaugh, M.: The Map Method for Synthesis of Combinational Logic Circuits. Transactions of the American Institute of Electrical Engineers, P. I 72(9), 593–599 (1953)
9. 9.
De Morgan, A.: Formal Logic; or, The Calculus of Inference, Necessary and Probable. Taylor and Walton (1847)Google Scholar
10. 10.
Blake, A.: Canonical expressions in Boolean algebra. The Journal of Symbolic Logic 3(2) (1938)Google Scholar
11. 11.
Poretsky, P.: On methods of solution of logical equalities and on inverse method of mathematical logic. Collected Reports of Meetings of Physical and Mathematical Sciences Section of Naturalists’ Society at Kazan University 2 (1984) (in Russian)Google Scholar