Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, ^ (conjunction) and ≡ (equivalence). Moreover, the ⇒ (implication) connective can be derived as A ⇒ B := (A ^ B) ≡ A. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such as Modus Ponens(MP) rule, Hypothetical Syllogism(HS) rule and completeness, etc. Especially, we provide two ways to prove the completeness of this logic system. We also introduce two extensions of equality propositional logic. The first one is involutive equality propositional logic, which is equality propositional logic with double negation. The second one adds prelinearity which is rich enough to enjoy the strong completeness property. Finally, we introduce additional connective Δ(delta) in equality propositional logic and demonstrate that the resulting logic holds soundness and completeness.