Bilateral proof systems, which provide rules for both affirming and denying sentences, have been prominent in the development of proof-theoretic semantics for classical logic in recent years. However, such systems provide a substantial amount of freedom in the formulation of the rules, and, as a result, a number of different sets of rules have been put forward as definitive of the meanings of the classical connectives. In this paper, I argue that a single general schema for bilateral proof rules has a reasonable claim to inferentially articulating the core meaning of all of the classical connectives. I propose this schema in the context of a bilateral sequent calculus in which each connective is given exactly two rules: a rule for affirmation and a rule for denial. Positive and negative rules for all of the classical connectives are given by a single rule schema, harmony between these positive and negative rules is established at the schematic level by a pair of elimination theorems, and the truth-conditions for all of the classical connectives are read off at once from the schema itself.

双边证明系统为肯定句和否定句提供规则，近年来在经典逻辑证明论语义的发展中发挥着重要作用。然而，这样的系统在规则的制定方面提供了很大的自由度，因此，已经提出了许多不同的规则集作为经典连接词含义的定义。在本文中，我认为双边证明规则的单一通用模式有合理的主张来推理性地阐明所有经典连接词的核心含义。我在双边顺序演算的背景下提出了这个模式，其中每个连接词都被赋予了两个规则：肯定规则和否定规则。所有经典连接词的正面和负面规则都由单个规则图式给出，这些正面和负面规则之间的和谐是通过一对消除定理在图式层面建立的，并且所有经典连接词的真值条件是立即从模式本身读取。