For simplicity, most of the literature introduces the concept of definitional equivalence only for disjoint languages. In a recent paper, Barrett and Halvorson introduce a straightforward generalization to non-disjoint languages and they show that their generalization is not equivalent to intertranslatability in general. In this paper, we show that their generalization is not transitive and hence it is not an equivalence relation. Then we introduce another formalization of definitional equivalence due to Andréka and Németi which is equivalent to the Barrett–Halvorson (...) generalization in the case of disjoint languages. We show that the Andréka–Németi generalization is the smallest equivalence relation containing the Barrett–Halvorson generalization and it is equivalent to intertranslatability, which is another definition for definitional equivalence, even for non-disjoint languages. Finally, we investigate which definitions for definitional equivalences remain equivalent when we generalize them for theories in non-disjoint languages. (shrink)

A notable early result of David Makinson establishes that every monotone modal logic can be extended to LI, LV, or LF, and every antitone logic can be extended to LN, LV, or LF, where LI, LN, LV, and LF are logics axiomatized, respectively, by the schemas □α↔α, □α↔¬α, □α↔⊤, and □α↔⊥. We investigate logics that are both monotone and antitone (hereafter amphitone). There are exactly three: LV, LF, and the minimum amphitone logic AM axiomatized by the schema □α→□β. These logics, (...) along with LI, LN, and a wider class of “extensional” logics, bear close affinities to classical propositional logic. Characterizing those affinities reveals differences among several accounts of equivalence between logics. Some results about amphitone logics do not carry over when logics are construed as consequence or generalized (“multiple-conclusion”) consequence relations on languages that may lack some or all of the nonmodal connectives. We close by discussing these divergences and conditions under which our results do carry over. (shrink)

We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and the strong Beth properties since it does not have the strong Beth definability property.