Specifics of transitions in binary Markov logic

The paper presents a research on transitive probabilities of a binary Markov logic. Analytical dependencies are obtained of such transitions. A Markov interpretation is introduced of propositional-logic formulas using only two binary Markov matrices, two rules and a suitably selected negation of binary vectors. Formulas are obtained for final transitive probabilities for each of the two selected binary Markov matrix. Numeric examples are presented for a Markov interpretation of propositional-logic logical operations.