On undecidability of the propositional logic of an associative binary modality
摘要
It is shown that both classical and intuitionistic propositional logics of an associative binary modality are undecidable. The proof is based on the deduction theorem for these logics.