I am building a weakened version of the intuitionistic logic. It wouldn't satisfy (p∧¬p)→⊥ as a tautology, but rather, (⊤→(p∧¬p))→⊥. In plain English, contradictions admit no proof, but there might still be true contradictions anyway. (Of course, here "true" doesn't mean "tautological")
By not fully accepting the law of noncontradiction, in addition to being intuitionistic, this logic system is paraconsistent. But how should I call ⊥, if a "contradiction" is meant to indicate p∧¬p?