Application of Semi-Tensor Product to Reasoning

The semi-tensor product (STP) approach to logical reasoning is proposed. After reviewing the notions of formal reasoning for propositions, we show how mathematical reasoning for propositions can be verified using the STP of matrices over their structure matrices. Then, after introducing predicate logic, logical reasoning is considered. We also proved that when the argument domain is finite, any formulae in predicate logic can be expressed in their algebraic state space representation (ASSR). Logical reasoning can then also be performed using the STP approach.