Connectives stranger than tonk (Q853814)

From the viewpoint of proof-theoretic semantics that the meaning of a logical operation is given by a suitable inference rules in the natural deduction system, Prior's binary connective ``tonk'' brings about something undesirable, for it is indeed given by means of inference rules in natural deduction but trivializes logical systems unless the derivability is not transitive. Recently, Cook has modelled the connective by modifying the four-valued semantics of Belnap, in which therefore the consequence relation is not transitive. In this paper, the author examines this kind of trivializing phenomenon in generalized contexts on logical systems allowing not only non-transitivity but also non-reflexivity for syntactical derivability (and/or semantical consequence), and shows among others that there can be given such a trivializing (0-ary) connective in any non-trivial context. Thus the author remarks that the acceptance of arbitrary introduction rules for logical operations permits operations leading to triviality in general.