| Abstract: | Equivalent deductive systems were introduced in 4] with the goal of treating 1‐deductive systems and algebraic 2‐deductive systems in a uniform way. Results of 3], appropriately translated and strengthened, show that two deductive systems over the same language type are equivalent if and only if their lattices of theories are isomorphic via an isomorphism that commutes with substitutions. Deductive equivalence of π‐institutions 14, 15] generalizes the notion of equivalence of deductive systems. In 15, Theorem 10.26] this criterion for the equivalence of deductive systems was generalized to a criterion for the deductive equivalence of term π‐institutions, forming a subclass of all π‐institutions that contains those π‐institutions directly corresponding to deductive systems. This criterion is generalized here to cover the case of arbitrary π‐institutions. |
