format: text

text:
# Nonmonotonic Logics and Semantics This work was partially supported by the Jean and Helene Alfassa fund for research in Artificial Intelligence and by grant 136/94-1 of the Israel Science Foundation on “New Perspectives on Nonmonotonic Reasoning”.

## 1 Introduction

This paper is intended for logicians. It builds on the insights, motivations and techniques developed by researchers in Knowledge Representation and Artificial Intelligence, but its purpose is to present the topic of (AI-type) nonmonotonic deduction (or induction) to logicians. It is not claimed that the results of this paper will prove useful to AI practice. It uses the language of Mathematics (theorems and proofs) to study a form of deduction that is more general than the one used in Mathematics. A logician interested only in the (monotonic) kind of deduction used in Mathematics should not read further.

A semantics for nonmonotonic reasoning, more general than Shoham’s , will be presented. This semantics is closely related to, but generalizes, concepts developed by the Social Choice community. In this semantic framework one may define the family of preferential operations of  in a way that does not assume a pre-existing monotonic logic or connectives. Connectives may then be defined and studied by introduction-elimination rules as is done in monotonic logics.

## 2 Monotonic Logics

In the thirties, Tarski made a number of fundamental advances in the study of mathematical logic: he proposed a semantics for logical deduction (see in particular \[40, p. 127\]): a formula $`a`$ follows from a set $`A`$ of formulas iff $`a`$ holds in all models in which all the elements of $`A`$ hold. These ideas were first expounded in  (English translation in , Chapters 3 and 5 respectively). He characterized the consequence operations that may be defined by such a semantics as those operations that satisfy Inclusion, Idempotence and Monotonicity, as in Theorem 1. That theorem, however, does not seem to appear in Tarski’s work, since he deals from the start only with compact operations. After having settled the question of what is deduction, or what is a logic, without being tied to any specific logical calculus, he was able to deal with the meaning of connectives, one at a time. This section contains a sketch of some results concerning monotonic deductive operations, that we are interested in generalizing to nonmonotonic operations.

Let us assume a non-empty set (language) $``$ and a function $`𝒞:2^{}2^{}`$ are given. Nothing is assumed about the language. Assume $``$ is a set (of models), about which no assumption is made, and $`\times `$ is a (satisfaction) binary relation. For any set $`A`$, we shall denote by $`\widehat{A}`$ or by $`\mathrm{Mod}(A)`$ the set of all models that satisfy all elements of $`A`$:

$$\widehat{A}=\mathrm{Mod}(A)=\{xxa,aA\}.$$

For typographical reasons we shall use both notations, sometimes even in the same formula. For any set of models $`X`$, we shall denote by $`\overline{X}`$ the set of all formulas that are satisfied in all elements of $`X`$:

$$\overline{X}=\{axa,xX\}.$$

The following are easily proven, for any $`A,B`$, $`X,Y`$: they amount to the fact that the operations $`X\overline{X}`$ and $`A\widehat{A}`$ form a Galois connection.

$$A\overline{\widehat{A}},X\widehat{\overline{X}}$$

$$\widehat{AB}=\widehat{A}\widehat{B},\overline{XY}=\overline{X}\overline{Y}$$

$$AB\widehat{B}\widehat{A},XY\overline{Y}\overline{X}$$

$$AB\overline{\widehat{A}}\overline{\widehat{B}},XY\widehat{\overline{X}}\widehat{\overline{Y}}$$

$$\widehat{A}=\widehat{\overline{\widehat{A}}},\overline{X}=\overline{\widehat{\overline{X}}}$$

###### Theorem 1

There exists a set $``$ (of models) and a satisfaction relation $`\times `$ such that $`𝒞(A)=\overline{\widehat{A}}`$ iff $`𝒞`$ satisfies the following three conditions:

$$\mathrm{𝐈𝐧𝐜𝐥𝐮𝐬𝐢𝐨𝐧}A𝒞(A),$$

$$\mathrm{𝐈𝐝𝐞𝐦𝐩𝐨𝐭𝐞𝐧𝐜𝐞}𝒞(𝒞(A))=𝒞(A),$$

$$\mathrm{𝐌𝐨𝐧𝐨𝐭𝐨𝐧𝐢𝐜𝐢𝐭𝐲}AB𝒞(A)𝒞(B).$$

Proof: The only if part is very easy to prove, using the Galois connection properties of the transformations $`X\overline{X}`$ and $`A\widehat{A}`$.

The if part takes $``$ to be the set of all theories, the set of all sets $`T`$ such that $`T=𝒞(T)`$. Define, then, $`Ta`$ iff $`aT`$. By the definition of $``$, $`\overline{X}=_{TX}T`$ and $`\widehat{A}`$ is the set of theories $`T`$ that include $`A`$. $`\overline{\widehat{A}}`$ is therefore the intersection of all theories that include $`A`$. Since, by Idempotence, $`𝒞(A)`$ is a theory, and since it includes $`A`$ by Inclusion, $`\overline{\widehat{A}}𝒞(A)`$. By Monotonicity $`𝒞(A)𝒞(T)=T`$ for any theory $`T`$ that includes $`A`$, and therefore $`𝒞(A)`$ is a subset of the intersection of all such theories $`T`$, i.e., $`𝒞(A)\overline{\widehat{A}}`$.

As customary in the literature, $`𝒞(A,B)`$ will denote $`𝒞(AB)`$, $`𝒞(a)`$ denotes $`𝒞(\{a\})`$ and $`𝒞(A,a)`$ denotes $`𝒞(A\{a\})`$. A number of important results about the operations that satisfy Inclusion, Idempotence and Monotonicity have been proven. Let us mention three of them, in order to consider their generalization to nonmonotonic operations. The first one is that an intersection of theories is a theory. If, for any $`iI`$, $`A_i=𝒞(A_i)`$, then $`_{iI}A_i=𝒞(_{iI}A_i)`$. The second one is that given a family $`𝒞_i`$, $`iI`$, of operations that satisfy Inclusion, Idempotence and Monotonicity, their intersection, defined by, $`(_{iI}𝒞)(A)\stackrel{\mathrm{def}}{=}_{iI}(𝒞(A))`$ also satisfies Inclusion, Idempotence and Monotonicity. Another result, worth noticing, is that, if $`𝒞`$ satisfies Inclusion, Idempotence and Monotonicity, and if $`B`$, then the operation $`𝒞^{}`$ defined by $`𝒞^{}(A)=𝒞(A,B)`$, i.e., the operation that follows from the acceptance of $`B`$ once and for all satisfies Inclusion, Idempotence and Monotonicity. A last, for us, important result of Tarski that will be generalized in Section 8.2 is that the propositional connectives may be characterized elegantly and one at a time by Introduction-Elimination rules.

## 3 Plan of this work

This paper proposes a new family of operations, introduced in Section 4. This family is defined by five properties, two of them introduced here for the first time. These properties replace Tarski’s condition of Monotonicity by three weaker properties. The main purpose of this paper is to show the importance of this family, and why it crops up naturally in different contexts. To this effect, we, first, in Section 5, describe two very different semantics, or ontologies, for nonmonotonic reasoning. The equivalence of these semantics is proved, under a simplifying assumption. This equivalence lends weight to the claim that both semantics are natural and important. The first one is based on choice functions, enjoying properties that have been studied by researchers in Social Choice (Social Preferences, Rational Choice or Revealed Preference Theory may have been names more to the point)  already almost half a century ago. The link between their preoccupations and ours certainly needs further study. The second one is based on a qualitative notion of a measure. Its origins may be traced to Ben-David and Ben-Eliyahu’s . The formalism of Friedman and Halpern’s  is the one used here.

Then, in Section 6, the simplifying logical assumption is removed and the properties we expect of choice functions in the more general framework are discussed. One of the central ideas necessary to deal with the general case definability preservation has been put in evidence by Schlechta’s . The semantics proposed are a natural generalization of Tarski’s semantics. The interest and importance of the family of operations described in Section 4 are put in evidence in Section 7, where it is shown that they characterize exactly the operations defined by the semantics of Section 6. In Section 8 we discuss further properties of the operations of the family defined in Section 4 and, in particular, the characterization of propositional connectives by Introduction-Elimination rules. It is shown that the logics of the (semantically) classical connectives is classical propositional calculus. In Section 9 it is shown that, if the language $``$ is a propositional calculus, the finitary consequence relations defined by our family of operations are exactly the preferential consequence relations of . In Section 10 a more restricted family of operations, defined by equivalent semantic restrictions concerning choice functions on one hand and qualitative measures on the other hand, is characterized by an additional requirement on the nonmonotonic operations. Properties of this family are briefly discussed. Section 11 is a conclusion.

## 4 Nonmonotonic Deduction Operations

In this section we shall present five properties of an operation $`𝒞:2^{}2^{}`$, discuss them and their relation to properties of monotonic operations. We shall argue that they should be satisfied by inference operations. In the next sections, we shall define suitable semantics for them and prove a representation theorem.

Our first two properties are uncontroversial, at least for mathematical logicians. They may not be satisfied by most deductive agents with bounded resources, though. Inclusion and Idempotence are two of the conditions characterizing monotonic deduction and seem most natural also in the context of nonmonotonic deduction.

$$\mathrm{𝐈𝐧𝐜𝐥𝐮𝐬𝐢𝐨𝐧}AA𝒞(A),$$

$$\mathrm{𝐈𝐝𝐞𝐦𝐩𝐨𝐭𝐞𝐧𝐜𝐞}A𝒞(𝒞(A))=𝒞(A).$$

The first one, Inclusion, requires that all assumptions be part of the conclusions. The second one, Idempotence, expresses the requirement that the strength or the validity of a conclusion be unaffected by the length of the chain of arguments leading to its acceptance. We require the operation $`𝒞`$ squeeze the fruit, i.e., the assumptions to the end, i.e., until no more conclusions can be obtained.

The next three properties are properties of restricted monotonicity. They are implied by Monotonicity, and express that, in certain situations, Monotonicity is required.

$$\mathrm{𝐂𝐚𝐮𝐭𝐢𝐨𝐮𝐬}\mathrm{𝐌𝐨𝐧𝐨𝐭𝐨𝐧𝐢𝐜𝐢𝐭𝐲}A,BAB𝒞(A)𝒞(A)𝒞(B)$$

Cautious Monotonicity is a restricted form of Monotonicity: any monotonic operation is cautiously monotonic. This property was first introduced by D. Gabbay , in its finitary form and by D. Makinson  in its infinitary form. It requires that one does not retract previous conclusions when one learns that a previous conclusion is indeed true. It seems to have been accepted as reasonable by all researchers in the field. A discussion of its appeal may be found in .

The next two properties are described here for the first time, but they are closely related to the property previously discussed under the name of Deductivity or Infinite Conditionalization in . The first one, termed Conditional Monotonicity, expresses the requirement that $`𝒞`$ behave monotonically if one replaces, in the assumptions, some of the assumptions by their consequences. It asserts that non-monotonicity cannot be caused by the deduction process itself. It is only the addition of new assumptions unrelated to the old ones or assumptions that are less than the full sets of conclusions that can lead to non-monotonicity.

$$\mathrm{𝐂𝐨𝐧𝐝𝐢𝐭𝐢𝐨𝐧𝐚𝐥}\mathrm{𝐌𝐨𝐧𝐨𝐭𝐨𝐧𝐢𝐜𝐢𝐭𝐲}A,B,𝒞(A,B)𝒞(𝒞(A),B)$$

This is indeed a monotonicity requirement, if $`𝒞`$ satisfies Inclusion, since $`AB𝒞(A)B`$. But this is a very restricted form of Monotonicity: we do not allow adding arbitrary, unrelated, assumptions, only replacing part of the assumptions by their consequences. When doing so, we do require that one does not lose conclusions, but one may add conclusions. It is worth noticing that Conditional Monotonicity is an intrinsically infinitary condition: even if $`A`$ and $`B`$ are finite, $`𝒞(A)`$ that appears on the right hand side is typically infinite. If $`𝒞`$ is a Tarski deductive operation, i.e., satisfies Inclusion, Idempotence and Monotonicity, then,

$$𝒞(A,B)𝒞(𝒞(A),B)𝒞(𝒞(A),𝒞(B))𝒞(𝒞(A,B))𝒞(A,B)$$

and we have: $`𝒞(A,B)=𝒞(𝒞(A),B)`$. In the system presented here, $`𝒞(A,B)`$ may be a strict subset of $`𝒞(𝒞(A),B)`$. Conditional Monotonicity seems related with Cautious Monotonicity, but it is not. In Cautious Monotonicity, we allow the addition of a subset of $`𝒞(A)`$, whereas Conditional Monotonicity requires the addition of $`𝒞(A)`$ in its entirety. In Conditional Monotonicity, the addition may be done in the presence of some other assumptions ($`B`$), whereas in Cautious Monotonicity $`B`$ must be empty. The intuitive justification for Conditional Monotonicity will be given now, it explains the term Conditional Monotonicity: if $`c𝒞(A,B)`$, then, in $`𝒞(A)`$, there should be something (some conditional statements) to the effect that: if $`B`$ then $`c`$. But, together with $`B`$, this should imply $`c`$ and therefore $`c`$ should be in $`𝒞(𝒞(A),B)`$.

Our last property, termed Threshold Monotonicity, requires that $`𝒞`$ behave monotonically in all cases in which the deduction process has already been applied to part of the assumptions, i.e., above the threshold of some $`𝒞(A)`$. If $`𝒞(A)`$ is part of the assumptions, then $`𝒞`$ behaves monotonically.

$$\mathrm{𝐓𝐡𝐫𝐞𝐬𝐡𝐨𝐥𝐝}\mathrm{𝐌𝐨𝐧𝐨𝐭𝐨𝐧𝐢𝐜𝐢𝐭𝐲}𝒞(A)BC𝒞(B)𝒞(C)$$

The intuitive reason for this requirement is similar to the one for Conditional Monotonicity. We expect that, if $`𝒞(A)B`$ and $`c𝒞(B)`$, formulas saying that: if $`B`$ then $`c`$, are already in $`𝒞(A)`$. The set $`C`$, then, contains both if $`B`$ then $`c`$ and $`B`$, therefore $`𝒞(C)`$ should contain $`c`$.

Before we move to our main representation result, let us draw one important consequence of the properties above.

###### Lemma 1 (Cumulativity, Makinson )

If $`𝒞`$ satisfies Idempotence and Cautious Monotonicity, then it satisfies

$$\mathrm{𝐂𝐮𝐦𝐮𝐥𝐚𝐭𝐢𝐯𝐢𝐭𝐲}AB𝒞(A)𝒞(B)=𝒞(A).$$

The importance of Cumulativity has been stressed early on by Makinson .

Proof: By Cautious Monotonicity, $`𝒞(A)𝒞(B)`$. Therefore we have $`B`$ $`𝒞(A)`$ $`𝒞(B)`$. By Cautious Monotonicity again, we have $`𝒞(B)`$ $`𝒞(𝒞(A))`$. By Idempotence, then $`𝒞(B)𝒞(A)`$.

## 5 Two semantics in a simplified framework

We shall now describe two natural different semantics for nonmonotonic operations: one based on choice functions and one based on qualitative probability measures. We shall show their equivalence, under simplifying assumptions to be described now. The exact fit between the semantics based on choice functions and the formal properties of nonmonotonic deduction operations described in Section 4 will be proved in Section 7.

### 5.1 A simplifying assumption

The general setting, assuming an arbitrary language $``$, will be developed in Section 6. It requires that sets of models that may be defined by a set of formulas be given prominence.

###### Definition 1

A set $`X`$ of models is said to be definable iff one of the two following equivalent conditions holds:

1. $`A`$ such that $`X=\widehat{A}`$, or
2. $`X=\widehat{\overline{X}}`$.

The set of all definable subsets of $`X`$ will be denoted by $`D_X`$.

A set of models is definable iff it is the set of all models satisfying some set of formulas. In many situations in which a finiteness assumption is reasonable, one may avoid the consideration of the special role of definable sets. For example, researchers in Social Choice typically assume the set of outcomes is finite. Friedman and Halpern, also, assume, at least in part of their work, that the base set is finite. For expository purposes, to keep definitions and justifications simple, we shall now make a similar assumption, to be lifted in Section 6. We shall assume that every set of models is definable.

$$\mathrm{𝐒𝐢𝐦𝐩𝐥𝐢𝐟𝐲𝐢𝐧𝐠}\mathrm{𝐀𝐬𝐬𝐮𝐦𝐩𝐭𝐢𝐨𝐧}X,X=\widehat{\overline{X}}$$

Any propositional calculus on a finite number of atomic propositions satisfies our Simplifying Assumption.

### 5.2 Choice functions

The properties described in this section have been put in evidence for the first time, probably, by researchers in social choice, triggered by H. Chernoff , H. Uzawa  and K. Arrow  (for an updated survey, see ). The exact nature of the link between nonmonotonic logics and the theory of choice functions needs further research. For the sake of those readers who are not familiar with this literature, let us describe briefly its framework: each individual has personal preferences over a set of possible outcomes. The society, given a subset of those, the feasible outcomes, must come up with a the subset of those feasible outcomes that are acceptable socially, in view of the individual preferences. Different methods of social decision result in different functions from sets of feasible outcomes to sets of acceptable outcomes. Social Choice investigates the relations between those different methods for social decision and the choice functions they determine.

Independently, Y. Shoham, in , proposed a general semantics for nonmonotonic reasoning, based on preferences among models. The link between the properties of choice functions studied by Social Choice researchers and Nonmonotonic Reasoning has been put in evidence by Doyle and Wellman , Rott  and Lindström . Lindström generalizes the finitary framework considered in Revealed Preference Theory to an infinitary framework. In , Karl Schlechta rediscovered choice functions and their properties, in the infinitary framework. He also considered an additional property needed in such a framework. Schlechta’s line of research is best described in  and . The only novelty of this section is the detailed argumentation justifying the assumptions about the choice function.

The basic idea is that one can generalize Tarski’s semantic analysis of deduction by considering, instead of all models of a set $`A`$ of formulas, only a subset of this set: the set of best models of $`A`$, jumping, on the basis of $`A`$, to the conclusion that the situation at hand is one of those best situations. Such a manner of drawing conclusions from categorical information has been time and again attested by researchers in cognitive sciences. Lakoff’s  is a good introduction. The author’s  represents a very tentative formalization.

We consider a set $``$ of models, a satisfaction relation $``$ and a choice function $`f:2^{}2^{}`$ that chooses, for a set $`X`$ of models, the set of best, most typical, most important, or preferred models for the set $`X`$. Then we define the function $`𝒞`$ by

(1)
$$𝒞(A)=\overline{f(\widehat{A})}.$$

The use of a choice function to define a (nonmonotonic) consequence operation generalizes Shoham’s semantics and represents one step up in the abstraction ladder from Shoham’s semantics. Shoham assumed that the choice function $`f`$ is defined in a particular way: $`f(X)`$ is the set of all elements of $`X`$ that are minimal in $`X`$, under some, pre-existing, order relation on $``$. We prefer to deal directly with properties of the function $`f`$, without assuming any order relation on $``$.

Let us now present natural conditions on $`f`$. The monotonic case corresponds to the case that the function $`f`$ is required to be the identity function. The conditions below are trivially satisfied by the identity function.

Let us take the following running example, that will exemplify the fact that the properties of the choice function $`f`$ define, in a sense the logic of optimization. You are looking for an apartment in Paris. The set of apartments on the market in Paris is the set $``$. Your real estate agent asks for your desiderata and your financial possibilities. You expect her to come up with a limited list of the best apartments available in Paris. You expect a list that is neither too small nor too large. Notice that this example does not fit exactly the Social Choice paradigm, interested in finding a subset of outcomes that are acceptable in the view of contradictory preferences of the individuals, since we assumed you alone are looking for an apartment. But it may be fitted to the Social Choice paradigm if you consider that you are shopping for an apartment that fits in some way the contradictory desiderata of a family, and of the real estate agent.

The first property we expect of $`f`$ is a property of contraction.

$$\mathrm{𝐂𝐨𝐧𝐭𝐫𝐚𝐜𝐭𝐢𝐨𝐧}f(X)X$$

Indeed, intuitively, $`f`$ picks the preferred models of the set $`X`$ and those models are in the set $`X`$. The identity function satisfies Contraction. Contraction is assumed in the Social Choice literature without even mentioning it explicitly.

If you requested an apartment in Paris, you expect to get a list of apartments in Paris, not in Neuilly or in San Francisco.

The second property expresses the fact that, if $`X`$ is a subset of $`Y`$, it is more difficult to be one of the best of the bigger set $`Y`$ than to be one of the best of the smaller set $`X`$. Therefore we expect any element of $`f(Y)`$ that happens to be in $`X`$ to be in $`f(X)`$.

$$\mathrm{𝐂𝐨𝐡𝐞𝐫𝐞𝐧𝐜𝐞}XYXf(Y)f(X)$$

This is Sen’s  property $`\alpha `$. The identity function satisfies Coherence. Coherence is a kind of antimonotonicity: if $`XY`$, then antimonotonicity would require: $`f(Y)f(X)`$, whereas Coherence only requires that this part of $`f(Y)`$ that is included in $`X`$ is included in $`f(X)`$. The term Coherence seems to be an appropriate name since it expresses the existence of some kind of coherent test by which the preferred elements of a set are picked up: the test corresponding to a superset must be at least as demanding as the one of a subset. The Coherence property appears in Chernoff’s  and has been given his name in . It has been endorsed by all researchers in Social Choice.

To illustrate Coherence, suppose you now remember you promised your wife you would live on the left bank, but forgot to tell that to your agent. You tell her that and get a new list, of apartments on the left bank. You expect all the left bank apartments that appeared in the first list to be included in the second list. The second list will probably also include other apartments, that were not part of the, say twenty, best apartments in Paris, but are part the best apartments on the left bank.

The third and last property expresses the fact that, if $`Y`$ is a subset of $`X`$, but large enough to include all of $`f(X)`$, then we do not expect $`f(Y)`$ to be larger than $`f(X)`$.

$$\mathrm{𝐋𝐨𝐜𝐚𝐥}\mathrm{𝐌𝐨𝐧𝐨𝐭𝐨𝐧𝐢𝐜𝐢𝐭𝐲}f(X)YXf(Y)f(X)$$

The term Local Monotonicity expresses that this is a property of qualified monotonicity for $`f`$: $`YX`$ implies $`f(Y)f(X)`$, conditional on $`f(X)Y`$, somehow a local condition. The importance of property has been put in evidence by M. A. Aizerman . The identity function satisfies Local Monotonicity, because it is monotonic, but also trivially, because the assumption implies $`X=Y`$.

Suppose all best apartments of Paris included in the list you got from your agent happen to be on the left bank. You certainly would not expect a larger list if you told her you want only apartments on the left bank.

Any choice function satisfying Contraction, Coherence and Local Monotonicity is considered acceptable in this work. A number of other properties of choice functions, from the literature, will be discussed now. Researchers in Social Choice have universally endorsed the following: $`f(X)`$ is not empty if $`X`$ is not empty. Some have noticed that this property is not crucial and that they could build the theory without it. We have no reason to make this requirement: it may well be the case that our search for a large cheap apartment in Paris in the best quarter leaves us with an empty list.

Another property that has been widely considered is:

$$\mathrm{𝐄𝐱𝐩𝐚𝐧𝐬𝐢𝐨𝐧}f(X)f(Y)f(XY)$$

It does not follow from Contraction, Coherence and Local Monotonicity. We do not endorse it. An apartment, on the Ile de la Cité, that makes the list of the ten best apartments on the left bank and (or) the Ile de la Cité and also makes the list of the ten best apartments on the right bank and (or) the Ile de la Cité, does not necessarily makes the list of the ten best apartments in Paris. One easily sees that the semantics proposed by Shoham in  validates Contraction, Coherence, Local Monotonicity and also Expansion: if $`z`$ is minimal in $`X`$ and minimal in $`Y`$ it is minimal in the union $`XY`$. Therefore, the semantics proposed in this paper is a strict generalization of Shoham’s. In fact, under our simplifying assumption, Shoham’s semantics is equivalent to considering choice functions that satisfy Contraction, Coherence, Local Monotonicity and Expansion.

We have presented a semantic framework that generalizes Tarski’s. It involves a choice function on sets of models. This choice function is assumed to satisfy three conditions. We argued that those three conditions are natural, but the ultimate test of their interest lies ahead. The Social Choice literature mentions two main results about choice functions that satisfy Contraction, Coherence and Local Monotonicity. In , it is shown that they are exactly the choice functions that satisfy Contraction and

$$\mathrm{𝐏𝐚𝐭𝐡}\mathrm{𝐈𝐧𝐝𝐞𝐩𝐞𝐧𝐝𝐞𝐧𝐜𝐞}f(XY)=f(f(X)Y).$$

In , it is shown that, if $``$ is finite, they are exactly the pseudo-rationalizable choice functions, i.e., those that may be defined by a finite set of binary preference relations $`>_i`$ on $``$ by taking, for $`f(X)`$, the set of all elements of $`X`$ that are minimal in $`X`$ for at least one of the $`>_i`$’s. None of these results will be used in this paper.

### 5.3 Qualitative Measures

A completely different generalization of Tarski’s semantic analysis will be reviewed now. Its origins may be traced to Dubois and Prade  and Ben-David and Ben-Eliyahu . Up to small technical changes, our presentation will be that of Friedman and Halpern . The connection between both approaches is described in . Some more results concerning the link between plausibility measures and preferential relations may be found in .

Suppose we had some way of measuring the size or the importance of sets of models. One is tempted to say that a formula $`a`$ may be deduced from a set $`A`$ of formulas iff the measure of the set of all models of $`A`$ that satisfy $`a`$ is larger than that of the set of models of $`A`$ that do not satisfy $`a`$. Since, as in the case of monotonic logic, one would like to deduce anything from an inconsistent set of formulas, the case that the set of models of $`A`$ is negligible, i.e., not larger than the empty set, has to be treated separately. With the notations of Section 5.2, one would like to assume a binary relation $`>`$ on $`2^{}`$ ($`X>Y`$ iff the measure of $`X`$ is larger than that of $`Y`$) and define the deductive operation by:

(2)
$$a𝒞(A)\mathrm{iff}\mathrm{either}\widehat{A}\widehat{\{a\}}>\widehat{A}\widehat{\{a\}}\mathrm{or}\widehat{A}\mathrm{}.$$

This definition indeed generalizes Tarski’s. For Tarski: $`X>Y`$ iff $`Y=\mathrm{}`$ and $`X\mathrm{}`$.

The following list of natural properties for $`>`$ is similar to Friedman and Halpern’s definition of a Qualitative Plausibility Measure.<sup>1</sup><sup>1</sup>1Friedman and Halpern assume a function $`Pl:2^{}D`$ and a reflexive, transitive and anti-symmetric relation $``$ on $`D`$ satisfying:    A1 if $`XY`$ then $`Pl(X)Pl(Y)`$,    A2 if $`X,Y,Z`$ are pairwise disjoint sets, $`Pl(XY)Pl(Z)`$ and $`Pl(XZ)Pl(Y)`$, then $`Pl(X)Pl(YZ)`$,    A3 if $`Pl(X)=Pl(Y)=Pl(\mathrm{})`$, then $`Pl(XY)=Pl(\mathrm{})`$.    The properties described here are in fact stronger than theirs: the representation result holds for both sets of properties. First, it seems reasonable to require that $`>`$ be a strict partial order relation, i.e., irreflexive and transitive. This seems implied by our description of $`X>Y`$ as meaning that the measure of $`X`$ is larger than that of $`Y`$. Note that we do not require the relation $`>`$ to be total, which would not be reasonable since $`X`$ and $`Y`$ may have equal measure without being equal, nor even to be modular, i.e., satisfy the property $`X>Y`$ implies that, for any $`Z`$, either $`X>Z`$ or $`Z>Y`$. Modularity will be assumed in Section 10.

(3)
$$\mathrm{The}\mathrm{relation}>\mathrm{is}\mathrm{irreflexive}\mathrm{and}\mathrm{transitive}.$$

A second very natural property of $`>`$ is that it should behave as expected with respect to set inclusion. The reader will easily be convinced that, in our setting, the correct formulation is the following:

(4)
$$WX>YZW>Z.$$

Our third property deals with the special character of the empty set. The empty set is the ultimate small set and any set $`X`$ that is not strictly greater than the empty set must be extremely small and negligible. In many cases, any nonempty set will be strictly greater than the empty set, but we do not wish to make this a requirement. Since the union of any family of empty sets is empty, it is reasonable to require that the union of a family of negligible sets be negligible.

(5)
$$iI,X_i\mathrm{}\underset{iI}{}X_i\mathrm{}$$

This is the infinitary version of property (A3) of Friedman and Halpern. The finitary version is not enough for Theorem 3 to hold. The next two properties have to deal with the qualitative character of the relation $`>`$. Qualitatively greater has to be understood here as an order of magnitude greater. Assume $`XY>Y`$. If $`XY`$ is an order of magnitude greater than $`Y`$, it must be that $`X`$ is already greater than $`Y`$.

(6)
$$XY>YX>Y$$

Note that the definition of $`𝒞`$ in 2 makes use of the relation $`>`$ only between sets with an empty intersection. Property 6 can therefore only have an indirect influence. The qualitative plausibility measures of Friedman and Halpern need not satisfy Property 6. The results presented in Section 5.4 show that one may add this property without harm. Friedman and Halpern consider a property (A2) that implies the finitary version of 7. The finitary version of 7 together with 6 imply (A2). The next and last property is the fundamental one that makes the qualitative character of $`>`$ apparent.

(7)
$$iI,X>Y_iX>\underset{iI}{}Y_i$$

A set that is greater than every one of a family of sets must be greater than their union: pooling small sets never makes a big set. This seems to be the essence of qualitative.

We have presented a set of properties for $`>`$ and have argued that they are natural properties for a qualitative measure. No such argument can be completely convincing. In the next section, it will be shown that the properties 3, 4, 5, 6 and 7 for $`>`$ are equivalent to the conditions of Contraction, Coherence and Local Monotonicity for $`f`$. This equivalence suggests that those two sets of properties and the nonmonotonic operations they define have a central role to play in the study of nonmonotonic logics. To the best of my knowledge, the qualitative measures have not been studied by the Social Choice community. Since, as will be seen in Section 5.4, they are equivalent to choice functions, it may be worthwhile to ask whether they can help there. The property of Expansion considered in Social Choice translates readily into $`_{iI}X_i>Z`$ implies that there is some $`iI`$ such that $`X_i>Z`$.

### 5.4 A Semantic Equivalence

###### Theorem 2

Suppose $`f`$ is a choice function that satisfies Contraction, Coherence and Local Monotonicity. Then, the relation $`>`$ defined by: $`X>Y`$ iff $`f(X)\mathrm{}`$ and $`Yf(XY)=\mathrm{}`$ satisfies properties 3, 4, 5, 6 and 7. If $`𝒞`$ is defined by Equation 1, then it satisfies Equation 2.

Before we get to the proof, let us ponder on the translation proposed. Is it a natural translation, i.e., does it fit the intuitive interpretations given to $`>`$ and $`f`$? The sets $`X`$ such that $`f(X)=\mathrm{}`$ are the no solution sets (in our running examples: no suitable apartments in $`X`$). They may be assumed to be small. If $`X`$ is qualitatively larger than $`Y`$, it is reasonable to assume that $`X`$ is not so small as to have an empty image under $`f`$. In Section 5.3, the intuition we developed was that $`X`$ is qualitatively larger than $`Y`$ means that $`X`$ contains some important elements $`Y`$ does not contain. The important elements are those of $`f(X)`$ and $`Y`$ contains none of them.

Proof: Let us show, first, that $`𝒞`$ satisfies Equation 2. Obviously $`a\overline{f(\widehat{A})}`$ iff $`f(\widehat{A})\widehat{\{a\}}`$. By Contraction, we have

$$f(\widehat{A})\widehat{\{a\}}\mathrm{iff}(\widehat{A}\widehat{\{a\}})f(\widehat{A})=\mathrm{}.$$

The only thing left for us to check is that if $`(\widehat{A}\widehat{\{a\}})f(\widehat{A})=\mathrm{}`$ and $`f(\widehat{A})\mathrm{}`$, then $`f(\widehat{A}\widehat{\{a\}})\mathrm{}`$, which follows from Coherence.

Irreflexivity of $`>`$ follows from Contraction. For Transitivity, assume $`f(X)\mathrm{}`$, $`Yf(XY)=\mathrm{}`$, $`f(Y)\mathrm{}`$ and $`Zf(YZ)=\mathrm{}`$. We want to show that $`Zf(XZ)=\mathrm{}`$. By Contraction, we know that $`f(XYZ)`$ $`(XZ)`$ $`(YZ)f(XYZ)`$. By Coherence, $`(YZ)f(XYZ)`$ $`f(YZ)`$. By assumption, $`f(YZ)`$ $`YZ`$. We conclude that $`f(XYZ)`$ $`(XY)Z`$ and therefore $`f(XYZ)`$ $`XY`$. By Coherence again, then $`f(XYZ)`$ $`f(XY)`$ and, by assumption, $`f(XYZ)X`$. We have $`f(XYZ)`$ $`XZ`$ $`XYZ`$. By Local Monotonicity, then, we conclude that $`f(XZ)`$ $`f(XYZ)`$. Therefore $`f(XZ)`$ $`(XY)Z`$. We conclude that $`Zf(XZ)=\mathrm{}`$.

For property 4, assume $`XY`$, $`WZ`$, $`f(Y)\mathrm{}`$ and $`Wf(YW)=\mathrm{}`$. Assume $`f(X)=\mathrm{}`$. We have $`f(X)`$ $`YX`$ and, by Local Monotonicity, $`f(Y)f(X)`$ and $`f(X)\mathrm{}`$. We have shown that $`f(X)\mathrm{}`$. We have $`f(YW)`$ $`Y`$ $`YZ`$ $`YW`$. By Local Monotonicity, then, we have $`f(YZ)`$ $`f(YW)`$. By Coherence,

$$(YZ)f(XZ)f(YZ)f(YW)YWYZ.$$

We conclude that $`Zf(XZ)=\mathrm{}`$.

For property 5, we notice that, from the definition of $`>`$, $`X>\mathrm{}`$ iff $`f(X)\mathrm{}`$. We have to show that $`f(X_i)=\mathrm{}`$ for any $`iI`$ implies $`f(_{iI}X_i)=\mathrm{}`$. This follows from Contraction and Coherence.

For property 6, assume $`f(XY)\mathrm{}`$ and $`Yf(XY)=\mathrm{}`$. The only thing left for us to prove is that we have $`f(X)\mathrm{}`$. Notice that, by Coherence, $`Xf(XY)`$ $`f(X)`$. It is enough to show that $`Xf(XY)\mathrm{}`$. By Contraction, $`f(XY)`$ $`XY`$ and, therefore,

$$f(XY)Xf(XY)Yf(XY)=Xf(XY),$$

by assumption.

Before we prove the last property needed, 7, let us prove a lemma.

###### Lemma 2

$`f(_{iI}X_i)_{iI}f(X_i)`$.

Proof: By Coherence, we have $`X_if(_{iI}X_i)`$ $`f(X_i)`$. By Contraction, $`f(_{iI}X_i)`$ $`_{iI}X_i`$.

For property 7, assume $`f(X)\mathrm{}`$ and $`Y_if(XY_i)=\mathrm{}`$ for any $`iI`$. By Lemma 2, $`f(X_{iI}Y_i)`$ $`_{iI}f(XY_i)`$. But, by assumption, $`f(XY_i)`$ $`X`$, for any $`iI`$. Therefore, for any $`jI`$, $`f(X_{iI}Y_i)`$ $`XY_j`$. By Coherence, then, $`(XY_j)f(X_{iI}Y_i)`$ $`f(XY_j)XY_j`$. We have shown that, for any $`jI`$, $`f(X_{iI}Y_i)`$ $`XY_j`$. We conclude that

$$\underset{jI}{}Y_jf(X\underset{iI}{}Y_i)=\mathrm{}.$$

Before we get to the second leg of our equivalence trip, let us notice an additional property.

###### Definition 2

If $`xX`$ we shall say that $`x`$ is heavy in $`X`$ iff $`X\{x\}`$.

###### Lemma 3

If the relation $`>`$ is defined as in Theorem 2, then, if $`f(X)=\mathrm{}`$ all the members of $`X`$ are heavy, and if $`f(X)\mathrm{}`$, the heavy elements of $`X`$ are precisely the members of $`f(X)`$.

The proof is obvious.

The second half of the equivalence between choice functions and qualitative measures will be described now.

###### Theorem 3

Suppose $`>`$ is a qualitative measure that satisfies properties 3, 4, 5, 6 and 7. Then, the choice function $`f`$ defined by taking for $`f(X)`$ the set of heavy elements (see Definition 2) of $`X`$ satisfies Contraction, Coherence and Local Monotonicity. If $`𝒞`$ is defined by Equation 2, it satisfies Equation 1.

Proof: By definition, $`f`$ satisfies Contraction. For Coherence, assume $`XY`$ and $`xX`$ is heavy in $`Y`$, i.e., $`Y\{x\}`$. By property 4, $`X\{x\}`$ and $`x`$ is heavy in $`X`$. We have proved that $`f`$ satisfies Coherence.

For Local Monotonicity, assume $`YX`$ and all heavy elements of $`X`$ are in $`Y`$. Let $`y`$ be a heavy element of $`Y`$. We know that $`yX`$. We must show that $`y`$ is heavy in $`X`$. Since all heavy elements in $`X`$ are in $`Y`$, any member $`z`$ of $`XY`$ is not heavy in $`X`$ and therefore $`X>\{z\}`$. By property 7, we have $`X>XY`$. If $`y`$ was not heavy in $`X`$, again by 7, we would have $`X>(XY)\{y\}`$. By property 6, then, $`Y\{y\}>`$ $`XY\{y\}`$. By property 4, then, we would have $`Y>\{y\}`$, contrary to the assumption that $`y`$ is heavy in $`Y`$. We have shown that $`f`$ satisfies Local Monotonicity.

We must now show that $`𝒞`$ satisfies Equation 1. Our proof will be exactly the same as the corresponding part of the proof of Theorem 2, once we have shown that the property used as a definition in Theorem 2 holds true.

(8)
$$X>Y\mathrm{iff}f(X)\mathrm{}\mathrm{and}Yf(XY)=\mathrm{}$$

Assume $`X>Y`$. By property 4, $`X>\mathrm{}`$. By property 5, there is some element of $`xX`$ such that $`\{x\}>\mathrm{}`$. The element $`x`$ is heavy in $`\{x\}`$ since $`>`$ is irreflexive, and therefore $`xf(\{x\})`$. By Coherence, we conclude that $`f(X)\mathrm{}`$. By property 4, if $`yY`$, then $`X>\{y\}`$ and $`y`$ is not heavy in $`X`$. We have shown that $`Yf(X)=\mathrm{}`$.

Suppose now that $`f(X)\mathrm{}`$ and $`Yf(XY)=\mathrm{}`$. For any element $`yY`$, $`XY>\{y\}`$. By property 7, $`XY>Y`$. By property 6, $`X>Y`$.

We have shown that the two very different semantic frameworks proposed by choice functions and qualitative measures are equivalent. This is a clear indication that the notion captured is important and that the operations $`𝒞`$ that may be defined in those frameworks form a class of great interest. Section 4 proposes a characterization of those operations. The representation result is proved in Section 7.

## 6 Choice functions: a general semantics for nonmonotonic operations

It is now time to get rid of the simplifying assumption that all sets of models are definable (see Definition 1), made in Section 5.2. In the general case, when certain sets of models are not definable, we must take a second look at the properties of choice functions considered in Section 5.2. Notice, first, that in the definition of $`𝒞(A)`$ as $`\overline{f(\widehat{A})}`$, the argument of $`f`$ is a definable set ($`\widehat{A}`$). We have no need for applying $`f`$ to a set that is not definable and, therefore, we shall assume that the domain of $`f`$ is the set of definable sets of models. First, we shall require that the image under $`f`$ of a definable set be definable. This requirement has been introduced by Schlechta in . Then, we shall understand the variables $`X`$ and $`Y`$ appearing in the definition of the properties of $`f`$ that we considered (Contraction, Coherence and Local Monotonicity), not as ranging over all sets of models $`X`$ and $`Y`$, but only over definable such sets.

On the first point, we expect to be able to describe (by a set of formulas) the sets in which we are interested, and on which we want to apply the choice function $`f`$. But, similarly, we expect the result of the application of $`f`$, the set of preferred elements of a set $`X`$ to be definable by a set of formulas (otherwise, how could we describe it in the language at our disposal?). We shall consider choice functions that are defined only on definable sets of models and that send definable sets to definable sets, i.e., we assume:

$$\mathrm{𝐃𝐞𝐟𝐢𝐧𝐚𝐛𝐢𝐥𝐢𝐭𝐲}\mathrm{𝐏𝐫𝐞𝐬𝐞𝐫𝐯𝐚𝐭𝐢𝐨𝐧}A,f(\widehat{A})=\widehat{\overline{f(\widehat{A})}}$$

The identity function obviously preserves definability. This property has never been considered by the Social Choice community, which seems to have been interested so far only in the case that $``$ is finite.

On the second point, for example, Local Monotonicity is now understood as: for any definable sets $`X`$, $`Y`$, such that $`f(X)`$ $`Y`$ $`X`$, one has $`f(Y)f(X)`$. It turns out (the proof is left to the reader) that one may extend any $`f`$ defined on definable sets (and satisfying Contraction, Coherence and Local Monotonicity) to arbitrary subsets by: $`f(X)=Xf(\widehat{\overline{X}})`$. This extension satisfies Contraction and Coherence for any subsets $`X`$, $`Y`$, but it does not satisfy Local Monotonicity for arbitrary such sets. It satisfies the following: for any sets $`X`$, $`Y`$ such that $`f(\widehat{\overline{X}})YX`$, one has $`f(Y)f(X)`$.

In the next section, the family of nonmonotonic operations defined by Equation 1 from definability-preserving choice functions that satisfy Contraction, Coherence and Local Monotonicity will be described.

## 7 Representation result

We shall now state and then prove our main characterization result. It proves an exact correspondence between the choice function semantics of Section 6 and the properties of $`𝒞`$ described in Section 4. Theorems 2 and 3 show that those properties also correspond exactly with the qualitative measures of Section 5.3, at least under the simplifying assumption of Section 5.1. Lifting this simplifying assumption there would involve a careful study of which sets of models are measurable in the qualitative sense. This can surely be done.

###### Theorem 4

Suppose we are given a language $``$ and a function $`𝒞:2^{}2^{}`$. Then, the following two conditions are equivalent:

1. $`𝒞`$ satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity and Threshold Monotonicity,
2. there exists a set $``$ (of models), a satisfaction relation $`\times `$ and a definability-preserving choice function $`f:D_{}D_{}`$ satisfying Contraction, Coherence and Local Monotonicity such that $`𝒞(A)=\overline{f(\widehat{A}})`$.

The notation $`D_{}`$ is explained in Definition 1.

Proof: First, let us show soundness: property 2 implies property 1. Assume $``$ is a set and $``$ a binary relation on $`\times `$. Assume $`f`$ satisfies Definability Preservation, Contraction, Coherence and Local Monotonicity. Define $`𝒞(A)=\overline{f(\widehat{A})}`$. We shall show that $`𝒞`$ satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity and Threshold Monotonicity.

For Inclusion, notice that, by Contraction, $`f(\widehat{A})`$ $`\widehat{A}`$, and therefore $`\overline{\widehat{A}}`$ $`\overline{f(\widehat{A})}=`$ $`𝒞(A)`$. But $`A\overline{\widehat{A}}`$ and we conclude that $`A𝒞(A)`$. We shall now prove a lemma that makes use of the definability preservation property.

###### Lemma 4

$`f(\widehat{A})=\widehat{𝒞(A)}`$.

Proof: By Definability Preservation, $`f(\widehat{A})=`$ $`\widehat{\overline{f(\widehat{A})}}`$. But $`\widehat{\overline{f(\widehat{A})}}=`$ $`\widehat{𝒞(A)}`$.

For Idempotence, notice that, by Inclusion (already proved), we have $`A𝒞(A)`$ and therefore $`\widehat{𝒞(A)}\widehat{A}`$. By Coherence, then, we have $`\widehat{𝒞(A)}f(\widehat{A})`$ $`f(\widehat{𝒞(A)})`$. By Lemma 4, $`\widehat{𝒞(A)}f(\widehat{A})=`$ $`f(\widehat{A})`$ and $`f(\widehat{A})`$ $`f(\widehat{𝒞(A)})`$. We conclude that we have $`𝒞(𝒞(A))𝒞(A)`$. The opposite inclusion follows from Inclusion.

For Cautious Monotonicity, we use Local Monotonicity and Lemma 4. Assume $`A`$ $`B𝒞(A)`$. We have $`\widehat{𝒞(A)}`$ $`\widehat{B}\widehat{A}`$. By Lemma 4, $`f(\widehat{\overline{\widehat{A}}})=`$ $`f(\widehat{A})`$ $`\widehat{B}\widehat{A}`$. Local Monotonicity, then, implies that $`f(\widehat{B})`$ $`f(\widehat{A})`$. We conclude that $`𝒞(A)𝒞(B)`$.

The next remark will be useful.

###### Lemma 5

$`\overline{\widehat{A}}𝒞(A)`$.

Proof: Since, by Contraction, $`f(\widehat{A})\widehat{A}`$.

We shall prove Conditional Monotonicity and Threshold Monotonicity. Since $`\widehat{AB}`$ $`\widehat{A}`$, Coherence implies that we have $`\widehat{AB}f(\widehat{A})`$ $`f(\widehat{AB})`$. By Lemma 4, $`\widehat{AB}\widehat{𝒞(A)}`$ $`f(\widehat{AB})`$. Therefore $`\mathrm{Mod}(AB𝒞(A))`$ $`f(\widehat{AB})`$ and

$$𝒞(A,B)\overline{\mathrm{Mod}(AB𝒞(A))}=\overline{\mathrm{Mod}(𝒞(A)B)}\overline{\mathrm{Mod}(𝒞(A)BC)},C.$$

By Lemma 5, then, $`𝒞(A,B)`$ $`𝒞(𝒞(A),B,C)`$. Conditional Monotonicity is obtained by taking $`C=\mathrm{}`$. For Threshold Monotonicity, take $`A=𝒞(D)`$ and use Idempotence.

We have proved the soundness part. Let us proceed to the proof of completeness: property 1 implies property 2. Assume that $`𝒞`$ satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity and Threshold Monotonicity. We shall now describe $``$ and the satisfaction relation $``$ in a unsurprising way. We shall take $``$ to be set of all sets $`T`$ of formulas such that $`T=𝒞(T)`$. Such a set $`T`$ will be called a theory. We shall define $``$ by: $`Ta`$ iff $`aT`$.

Let us draw some consequences from the definition of $``$.

###### Lemma 6

For any $`A`$, $`\widehat{A}`$ is the set of all theories that include $`A`$ and $`\overline{\widehat{A}}=`$ $`_B𝒞(A,B)`$.

Proof: By definition, $`\widehat{A}`$ is the set of all theories that include $`A`$ and $`\overline{\widehat{A}}`$ is the intersection of all theories that include $`A`$. Let $`T`$ be any theory that includes $`A`$: $`A`$ $`T=`$ $`𝒞(T)=`$ $`𝒞(A,T)`$ and therefore $`T=𝒞(A,B)`$ for some $`B`$. We have shown that $`_B𝒞(A,B)`$ $`\overline{\widehat{A}}`$.

But, $`𝒞(A,B)`$ is a theory, by Idempotence, and it includes $`A`$ by Inclusion. Therefore $`\overline{\widehat{A}}`$ $`_B𝒞(A,B)`$ and our claim is proved.

To simplify notations we shall write:

(9)
$$𝒞n(A)=\overline{\widehat{A}}=\underset{B}{}𝒞(A,B).$$

Since $`𝒞n(A)`$ is the intersection of the sets $`𝒞(B)`$ for all sets $`B`$ including $`A`$, it is the largest monotonic sub-mapping of $`𝒞`$. Since $`𝒞n(A)=\overline{\widehat{A}}`$, it is a consequence operation, i.e., satisfies Inclusion, Idempotence and Monotonicity. This remark is very close to a result of J. Dietrich in . Notice that, by Conditional Monotonicity and Threshold Monotonicity we have:

(10)
$$𝒞(A,B)𝒞n(𝒞(A),B).$$

###### Lemma 7

$`A𝒞n(A)𝒞(A)`$.

Proof: We have seen that $`𝒞n`$ satisfies Inclusion. By taking, in the definition of $`𝒞n`$, $`B=\mathrm{}`$, one sees that $`𝒞n(A)𝒞(A)`$.

###### Lemma 8 (Right Absorption)

$`𝒞`$($`𝒞n`$(A)) = $`𝒞`$(A).

Proof: By Lemmas 7 and 1.

###### Lemma 9 (Left Absorption)

$`𝒞n`$($`𝒞`$(A)) = $`𝒞`$(A).

Proof: By Lemma 7, we have $`𝒞(A)𝒞n(𝒞(A))𝒞(𝒞(A))`$. By Idempotence, we have $`𝒞(A)=𝒞n(𝒞(A))=𝒞(𝒞(A))`$.

We may now define the choice function $`f`$. Consider an arbitrary definable set $`X=\widehat{A}`$. By Lemma 8, $`\widehat{A}=\widehat{B}`$ implies $`𝒞(A)=𝒞(B)`$ and therefore we may define $`f(X)`$ by:

(11)
$$f(\widehat{A})=\widehat{𝒞(A)}.$$

One immediately sees that the choice function $`f`$ preserves definability, since $`\widehat{𝒞(A)}`$ is definable. We must now show that $`f`$ satisfies Contraction, Coherence and Local Monotonicity, and that

(12)
$$𝒞(A)=\overline{f(\widehat{A})}.$$

Let us deal with this last question first. By (11), $`f(\widehat{A})=\widehat{𝒞(A)}`$. Therefore $`\overline{f(\widehat{A})}=`$ $`\overline{\widehat{𝒞(A)}}=`$ $`𝒞n(𝒞(A))`$. By Lemma 9, $`\overline{f(\widehat{A})}=𝒞(A)`$. We have shown that Equation 12 holds.

It is clear from Equation 11 that $`f`$ satisfies Contraction. Let us prove now that $`f`$ satisfies Coherence. Assume $`XY`$. We have $`\overline{Y}\overline{X}`$ and therefore $`𝒞(\overline{X})=`$ $`𝒞(\overline{Y},\overline{X})`$. By Equation 10, we have $`𝒞(\overline{X})`$ $`𝒞n(𝒞(\overline{Y}),\overline{X})`$. Therefore, $`\mathrm{Mod}(𝒞(\overline{Y})\overline{X})`$ $`\mathrm{Mod}(𝒞(\overline{X}))`$ and $`\widehat{𝒞(\overline{Y})}\widehat{\overline{X}}`$ $`\widehat{𝒞(\overline{X})}`$. But, $`X\widehat{\overline{X}}`$ and therefore

$$Xf(Y)=XY\widehat{𝒞(\overline{Y})}\widehat{\overline{X}}\widehat{𝒞(\overline{Y})}\widehat{𝒞(\overline{X})}.$$

We conclude that $`Xf(Y)`$ $`X\widehat{𝒞(\overline{X})}=`$ $`f(X)`$.

Finally, let us show that $`f`$ satisfies Local Monotonicity. Assume $`f(\widehat{\overline{X}})`$ $`YX`$. We have, by Equation 12, $`\overline{X}`$ $`\overline{Y}`$ $`\overline{f(\widehat{\overline{X}})}=`$ $`𝒞(\overline{X})`$. By Cautious Monotonicity, then, we conclude that $`𝒞(\overline{X})`$ $`𝒞(\overline{Y})`$ and $`\widehat{𝒞(\overline{Y})}`$ $`\widehat{𝒞(\overline{X})}`$. Since $`YX`$, $`Y\widehat{𝒞(\overline{Y})}`$ $`X\widehat{𝒞(\overline{X})}`$. The proof of Theorem 4 is now complete.

One may check that, if the operation $`𝒞`$ is monotonic, then, the operation $`f`$ defined in the construction above is the identity on definable sets: $`f(\widehat{A})`$ is $`\widehat{𝒞(A)}`$, the set of all theories that include $`𝒞(A)`$, which is equal to $`\widehat{A}`$, the set of all theories that include $`A`$.

## 8 Properties of nonmonotonic operations

### 8.1 First Properties

We shall consider some properties of the operations that satisfy Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity and Threshold Monotonicity, nonmonotonic operations in the sequel.

For such operations, the intersection of two theories is not always a theory. Consider, for example, the language that contains two elements $`a`$ and $`b`$ and the operation defined by: $`𝒞(A)=A`$ for any $`A\mathrm{}`$ and $`𝒞(\mathrm{})=\{a\}`$. This is not a monotonic operation: the only breach of monotonicity is $`𝒞(\mathrm{})𝒞(b)`$. It is easy to check that it satisfies our conditions. But $`𝒞(a)𝒞(b)=\mathrm{}`$ is not a theory.

In the monotonic framework, the operation $`𝒞`$ is defined by the set of its theories, $`𝒞(A)`$ being the intersection of all theories including $`A`$. In the nonmonotonic framework, this is not the case. Two different operations may define the same set of theories. The example above will prove our case. The operation $`𝒞^{}`$ defined by $`𝒞^{}(\mathrm{})=\{b\}`$ and otherwise $`𝒞^{}(X)=𝒞(X)`$ is different from $`𝒞`$ but it has exactly the same theories as $`𝒞`$.

The property concerning the intersection of a family of operations holds, but its proof is more intricate that in the monotonic case. If $`𝒞_i`$ is a family of nonmonotonic operations (i.e., satisfying Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity and Threshold Monotonicity), its intersection is a nonmonotonic operation. The easiest proof may be semantic: each $`𝒞_i`$ is defined by a set $`_i`$ and a choice function $`f_i`$. Consider the set $`_i_i`$ (assume the $`_i`$ have pairwise empty intersections) and the function $`f`$ that operates as $`f_i`$ on $`_i`$ and takes the union of the sets obtained this way. It is easy to see it satisfies Inclusion, Coherence and Local Monotonicity. The operation defined this way is the intersection of the $`𝒞_i`$’s.

It is easy to see that, if $`𝒞`$ is nonmonotonic, i.e., satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity and Threshold Monotonicity, then, so is $`𝒞^{}`$ defined by: $`𝒞^{}(A)=𝒞(A,B)`$.

### 8.2 Connectives

We shall now find elegant properties of (nonmonotonic) $`𝒞`$ that characterize the (semantically) classical propositional connectives. We shall see that the nonmonotonic logic of the (semantically) classical connectives is classical propositional logic. We do not consider, in this work, the many possibilities offered by nonmonotonic logics for the definition of non-classical connectives, i.e., connectives that are not defined by truth tables. As in the case of monotonic logic, some additional compactness property is needed for the completeness result. The property required is weak and does not amount at all to requiring the operation $`𝒞`$ to be compact.

A word of caution about terminology is needed here. In sequent calculus presentations, connectives are characterized by left and right rules. In natural deduction presentations, they are characterized by introduction and elimination rules. We mix those two terminologies freely to name the rules we are interested in.

Let us consider, first, the case of conjunction. Assume that $``$ is closed under a binary $``$ and that we consider only satisfaction relations that satisfy:

(13)
$$xab\mathrm{iff}xa\mathrm{and}xb.$$

Then $`𝒞`$, defined by $`𝒞(A)=\overline{f(\widehat{A})}`$ satisfies:

(14)
$$𝒞(A,ab)=𝒞(A,a,b).$$

The proof is very easy: the models that satisfy $`A`$ and $`ab`$ are exactly those that satisfy $`A`$, $`a`$ and $`b`$. Notice that the treatment of conjunction is exactly the same as in the monotonic case.

Let us, now, consider the case of negation. Assume $``$ is closed under a unary $`\neg `$ and that we consider only satisfaction relations that satisfy:

(15)
$$x\neg a\mathrm{iff}x\vDash ̸a.$$

The left introduction rule of the monotonic case: $`a𝒞(A)`$ implies $`𝒞(A,\neg a)=`$ $``$ is not valid in our nonmonotonic framework. The rules we propose to characterize negation are the following.

(16)
$$𝒞(A,a,\neg a)=$$

(17)
$$𝒞(A,\neg a)=a𝒞(A)$$

The validity of those rules is easy to prove. For the first one, there are no models that satisfy $`A\{a\}\{\neg a\}`$, therefore, by Contraction we have $`f(\mathrm{Mod}(A\{a\}\{\neg a\}))=`$ $`\mathrm{}`$ and $`𝒞(A,a,\neg a)=`$ $``$. For the second one, since no model satisfies all formulas, if $`𝒞(A,\neg a)=`$ $``$, it must be the case that $`f(\mathrm{Mod}(A\{\neg a\}))=`$ $`\mathrm{}`$. By Coherence, $`\mathrm{Mod}(\{\neg a\})f(\widehat{A})=\mathrm{}`$. Therefore $`f(\widehat{A})`$ $`\mathrm{Mod}(\{a\})`$ and $`a𝒞(A)`$. One may notice that a similar result fails in Relevance Logic , where the Boolean negation of , defined by (15), is not reasonable.

Consider, now, the case of disjunction. Assume $``$ is closed under a binary $``$ and that we consider only satisfaction relations that satisfy:

(18)
$$xab\mathrm{iff}\mathrm{either}xa\mathrm{or}xb.$$

The Or introduction rule of monotonic sequent calculus, a left introduction rule, is valid:

(19)
$$𝒞(A,a)𝒞(A,b)𝒞(A,ab).$$

This follows easily from the fact that a model that satisfies $`ab`$ satisfies at least one of $`a`$ or $`b`$ and from Coherence:

$$f(\mathrm{Mod}(A\{ab\}))f(\widehat{A}\widehat{\{a\}})f(\widehat{A}\widehat{\{b\}}).$$

The right elimination rule of the monotonic case: $`𝒞(A,ab)𝒞(A,a)𝒞(A,b)`$ is not valid. We replace it by a right introduction rule.

(20)
$$a𝒞(A)ab𝒞(A),b𝒞(A)ab𝒞(A).$$

Its validity is obvious.

Lastly, consider the case of material implication. Assume $``$ is closed under a binary $``$ and that we consider only satisfaction relations that satisfy:

(21)
$$x\vDash ̸ab\mathrm{iff}xa\mathrm{and}x\vDash ̸b.$$

The right introduction rule of the monotonic case is valid:

(22)
$$b𝒞(A,a)ab𝒞(A).$$

Assume $`b𝒞(A,a)`$. Let $`B`$ be set of all models in $`f(\widehat{A})`$ that satisfy $`a`$. By Coherence, $`Bf(\mathrm{Mod}(A\{a\}))`$ and therefore all models in $`B`$ satisfy $`b`$ and also $`ab`$. All models in $`f(\widehat{A})B`$ satisfy $`ab`$. We conclude that all models in $`f(\widehat{A})`$ satisfy $`ab`$ and $`ab𝒞(A)`$. The right elimination rule of the monotonic case: $`ab𝒞(A)`$ implies $`b𝒞(A,a)`$ is not valid. We shall use the following left introduction rule:

(23)
$$b𝒞(A,a,ab)$$

which is easily seen to be valid.

Suppose $``$ is closed under some subset of the connectives $``$, $`\neg `$, $``$ and $``$. Is it the case that any operation $`𝒞`$ that satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity, Threshold Monotonicity and the two properties corresponding to each one of the connectives concerned may be defined by a set of models, a satisfaction relation that satisfies the requirement concerning each of the connectives considered and a choice function that satisfies Inclusion, Coherence and Local Monotonicity?

The answer cannot be positive in general. Although the answer is positive for a language $``$ that contains conjunction as its sole connective, it is negative as soon as $``$ contains a negation. A compactness assumption will ensure a positive answer. Without any such assumption, already in the monotonic framework, the result does not hold. Consider the following example. The language $``$ has an infinite set of atomic propositions and is closed under negation. The monotonic operation $`𝒞`$ satisfies $`a𝒞(A)`$ iff $`𝒞(A,\neg a)=`$ $``$, and therefore we may always remove double negations and is defined (up to removal of double negations) by: $`𝒞(A)=A`$ if $`A`$ is finite and does not contain an atomic proposition and its negation, and $`𝒞(A)=`$ otherwise (i.e., if $`A`$ is infinite or contains an atomic proposition and its negation). Notice that this $`𝒞`$ fails the Lindenbaum lemma: there are consistent sets but no maximal consistent set. Assume $`𝒞`$ is representable by a suitable $`f`$. Let $`Y=f(\widehat{\mathrm{}})`$ and $`yY`$. We have $`\{y\}=\widehat{\overline{y}}`$, and, by Coherence, $`yf(\{y\})`$. Also, $`f(\{y\})=\widehat{𝒞(\overline{y})}`$. But $`\overline{y}`$ includes a infinite number of atomic propositions or an infinite number of negations of atomic propositions, therefore $`𝒞(\overline{y})=`$ and $`f(\{y\})=\mathrm{}`$. A contradiction to $`yf(\{y\})`$. We conclude that $`Y=\mathrm{}`$. But then $`𝒞(\mathrm{})=`$, a contradiction.

We shall, then, assume that $`𝒞`$ satisfies the following:

$$\mathrm{𝐖𝐞𝐚𝐤}\mathrm{𝐂𝐨𝐦𝐩𝐚𝐜𝐭𝐧𝐞𝐬𝐬}𝒞(A)=\mathrm{a}\mathrm{finite}B_fA\mathrm{such}\mathrm{that}𝒞(B)=.$$

Notice that the Weak Compactness assumed does not imply, in the nonmonotonic framework, that, if $`a𝒞(A)`$, then there is a finite subset $`B`$ of $`A`$ such that $`a𝒞(B)`$, even when proper connectives are available. In the monotonic case, the monotonic left introduction rule for negation makes Compactness follow from Weak Compactness, but we rejected this rule.

Before we state and prove the main theorem of this section, let us build the tools for the proof. We shall assume that $`𝒞`$ satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity, Threshold Monotonicity and Weak Compactness. We assume that $``$ is closed under some set of connectives that includes negation and that $`𝒞`$ satisfies the two properties described above for each of the connectives assumed to be in the language (in particular it satisfies 16 and 17). Recall that $`A`$ is a theory iff $`A=𝒞(A)`$.

###### Definition 3

A set $`A`$ is said to be inconsistent iff $`𝒞(A)=`$. A set that is not inconsistent is said to be consistent.

Notice that, by Idempotence, $`A`$ is consistent iff $`𝒞(A)`$ is consistent, and that there is only one inconsistent theory, namely $``$.

###### Lemma 10

If $`AB`$ and $`A`$ is inconsistent, then $`B`$ is inconsistent.

Proof: We have: $`AB=𝒞(A)`$. By Cautious Monotonicity, then, $`=`$ $`𝒞(A)`$ $`𝒞(B)`$.

The following notion is fundamental.

###### Definition 4

A set $`A`$ is said to be maximal consistent iff it is consistent and any strict superset $`BA`$ is inconsistent.

The next two lemmas are central.

###### Lemma 11

If $`A`$ is consistent, there is some maximal consistent set $`B`$ such that $`AB`$.

Proof: The proof is as in the classical case. It is included only for completeness sake. Consider any ascending chain of consistent sets, $`A_i`$, $`iI`$, where $`i<j`$ implies $`A_iA_j`$. We claim that the union $`B=_{iI}A_i`$ is consistent. If it were inconsistent, by Weak Compactness, there would be some finite inconsistent subset of $`B`$. This subset would be a subset of $`A_i`$ for some $`i`$, and by Lemma 10, $`A_i`$ would be inconsistent, contrary to assumption. We have shown that the union of any ascending chain of consistent sets is consistent. Zorn’s lemma, then, implies that any consistent $`A`$ may be embedded in a maximal consistent set.

###### Lemma 12

If $`A`$ is maximal consistent, then

1. $`A`$ is a theory,
2. (if $``$ is in the language) $`abA`$ iff $`aA`$ and $`bA`$,
3. $`\neg aA`$ iff $`aA`$,
4. (if $``$ is in the language) $`abA`$ iff $`aA`$ or $`bA`$,
5. (if $``$ is in the language) $`abA`$ iff $`aA`$ and $`bA`$.

Proof: Assume $`A`$ is maximal consistent. If $`𝒞(A)`$ were a strict superset of $`A`$ it would be inconsistent, but then $`A`$ would be inconsistent. Therefore $`𝒞(A)=A`$.

By 14, and since $`A`$ is a theory, $`abA`$ iff $`aA`$ and $`bA`$. The maximality of $`A`$ is not used here.

Assume $`\neg aA`$. If we had $`aA`$, we would, by 16 have $`𝒞(A)=`$, a contradiction to the consistency of $`A`$. Assume, now, $`\neg aA`$. Since $`A`$ is maximal consistent, $`𝒞(A,\neg a)=`$. By 17, we have $`a𝒞(A)=A`$.

Assume $`aA`$ or $`bA`$. By the right introduction rule 20, $`ab𝒞(A)=A`$. Assume, now that $`abA`$. We must show that at least one of $`a`$ or $`b`$ is in $`A`$. Suppose, a contrario, that neither one is in $`A`$. Since $`A`$ is maximal consistent, both $`𝒞(A,a)`$ and $`𝒞(A,b)`$ are equal to $``$. But, then, the left introduction rule 19 implies $`𝒞(A)=`$ $`𝒞(A,ab)=`$, a contradiction.

Assume $`aA`$. Since $`A`$ is maximal consistent, $`𝒞(A,a)=`$, and therefore $`b𝒞(A,a)`$ and, by the right introduction rule 22, $`ab𝒞(A)=A`$. Suppose, now, that $`aA`$. If $`abA`$, then, by the left introduction rule 23, $`b𝒞(A)=A`$. If $`abA`$, then, by the right introduction rule 22, $`b𝒞(A,a)=𝒞(A)=A`$.

The next theorem shows that the Introduction Elimination rules above define exactly the (semantically) classical connectives.

###### Theorem 5

Assume that $``$ is closed under some of the propositional connectives, including negation, and that $`𝒞`$ satisfies the Introduction and Elimination properties described above for each of the connectives of the language. Let $`𝒞`$ satisfy Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity, Threshold Monotonicity and Weak Compactness. Then, there is a set $``$, a satisfaction relation $``$ that behaves classically for each of the existing connectives and a definability-preserving choice function $`f`$ that satisfies Contraction, Coherence and Local Monotonicity that defines $`𝒞`$, i.e., such that $`𝒞(A)=\overline{f(\widehat{A})}`$, for any $`A`$.

Proof: The proof proceeds exactly as the proof of the completeness part of Theorem 4, except that, for the set $``$ we take, not all theories, but only the maximal consistent sets of formulas. The proof proceeds exactly in the same way, as soon as we have proved Lemma 13 to replace Lemma 6. The fact that the satisfaction relation behaves classically for the connectives follows from Lemma 12.

###### Lemma 13

For any $`A`$, $`\widehat{A}`$ is the set of all maximal consistent sets that include $`A`$ and $`\overline{\widehat{A}}=`$ $`_B𝒞(A,B)`$.

Proof: By definition, $`\widehat{A}`$ is the set of all maximal consistent sets that include $`A`$ and $`\overline{\widehat{A}}`$ is the intersection of all maximal consistent sets that include $`A`$. Let $`T`$ be such a set. By Lemma 12, $`T`$ is a theory and: $`A`$ $`T=`$ $`𝒞(T)=`$ $`𝒞(A,T)`$ and therefore $`T=𝒞(A,B)`$ for some $`B`$. We have shown that $`_B𝒞(A,B)`$ $`\overline{\widehat{A}}`$.

But, suppose, now, that $`a𝒞(A,B)`$. By 17, $`𝒞(A,B,\neg a)`$ (we need here the assumption that negation is in the language). By Lemma 11, $`𝒞(A,B,\neg a)`$ is a subset of some maximal consistent set. This set, since it is consistent and contains $`\neg a`$, does not contain $`a`$ (see 16). Therefore $`a\overline{\widehat{A}}`$. We have shown that $`\overline{\widehat{A}}`$ $`_B𝒞(A,B)`$ and our claim is proved.

One may ask whether the result holds even for languages that do not include negation. The question is open. But, notice that, in the proof, we make use of the fact that, if $`T`$ is a theory and $`aT`$, then there is a maximal consistent superset of $`T`$ that does not include $`a`$. This does not hold in general: for example, if $`𝒞`$ is the operation of deduction of intuitionistic logic and $`p`$ is an atomic proposition, $`p𝒞(\neg \neg p)`$, but any maximal consistent set that includes $`\neg \neg p`$ must include $`p`$.

We may now show that propositional nonmonotonic logic is not weaker than (and therefore exactly the same as) monotonic logic.

###### Theorem 6

Let $``$ be a propositional calculus and $`a,b`$. The following propositions are equivalent.

1. $`a`$ logically implies $`b`$, i.e., $`ab`$,
2. for any operation $`𝒞`$ that satisfies Inclusion, Idempotence, Monotonicity, Weak Compactness and the Introduction-Elimination rules above: $`b𝒞(a)`$,
3. for any operation $`𝒞`$ that satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity and Threshold Monotonicity, Weak Compactness and the Introduction-Elimination rules above: $`b𝒞(a)`$,
4. for any such $`𝒞`$ and for any $`A`$: $`b𝒞(A,a)`$,
5. for any such $`𝒞`$: $`𝒞(a,\neg b)=`$.

Proof: Property 5 implies 4, since, by Cumulativity, $`𝒞(a,\neg b)=`$ implies $`𝒞(A,a,\neg b)=`$, and, by the Left Elimination rule for negation: $`b𝒞(A,a)`$. Property 4 obviously implies 3, that obviously implies 2. It is easy to see that property 2 implies 1. Let $`m`$ be any propositional model that satisfies $`a`$. Let $`𝒞`$ be defined by $`𝒞(A)=\overline{\{m\}}`$, the set of formulas satisfied by $`m`$, if $`m\widehat{A}`$ and $`𝒞(A)=`$ otherwise. By assumption, $`b𝒞(a)`$. But $`𝒞(a)=\overline{\{m\}}`$ since $`m\widehat{\{a\}}`$, therefore $`mb`$.

The only non-trivial part of the proof is that 1 implies 5. Assume $`ab`$ and $`𝒞`$ satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity and Threshold Monotonicity, Weak Compactness and the Introduction-Elimination rules. By Theorem 5, there is a set $``$, a satisfaction relation $``$ that behaves classically with respect to the connectives and a definability-preserving choice function satisfying Contraction, Coherence and Local Monotonicity such that $`𝒞(a,\neg b)=`$ $`\overline{f(\widehat{\{a\}}\widehat{\{\neg b\}})}`$. But, by assumption $`\widehat{\{a\}}\widehat{\{\neg b\}}=\mathrm{}`$. By Contraction, then $`𝒞(a,\neg b)=`$ $`\overline{\mathrm{}}=`$ $``$.

Theorem 6 shows that the proof theory of the semantically-classical propositional connectives in a nonmonotonic setting is the same as in a monotonic setting. The nonmonotonic setting is very rich, and it is tempting to consider, there, connectives the semantics of which is not locally truth-functional: the truth-value of $`\mathrm{}a`$ or of $`ab`$ in a model $`m`$ depending on the choice function $`f`$. This is left for future work.

It is customary to consider Introduction-Elimination rules as definitions of the connectives. Hacking \[17, Section VII\] discusses this idea and proposes that, to be considered as bona fide definitions of the connectives, the rules must be such that they ensure that any legal logic on a small language may be conservatively extended to a legal logic on the language extended by closure under the connective. We may ask whether any nonmonotonic operation $`𝒞`$ on $``$ that satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity and Threshold Monotonicity may be conservatively extended to such an operation that satisfies the Introduction-Elimination rules above: (14), (16), (17), (19), (20), (22) and 23). From the discussion above, just before the definition of Weak Compactness, it seems that Weak Compactness will be required. The question of whether Weak Compactness is sufficient to ensure a conservative extension is open. The result will be proven under a stronger assumption: the set of atomic propositions is finite (this essentially the Simplifying Assumption of Section 5.1).

###### Theorem 7

Let $``$ be the propositional calculus on a finite set $`P`$ of atomic propositions. Let $`𝒞`$ be an operation on $`P`$ that satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity and Threshold Monotonicity. Then, there exists an operation $`𝒞`$’ on $``$ that satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity, Threshold Monotonicity and the rules: (14), (16), (17), (19), (20), (22) and (23), such that, for any $`AP`$, $`𝒞(A)=P𝒞^{}(A)`$.

Proof: Since $`P`$ is finite, $`𝒞`$ is trivially weakly compact, the assumptions of Theorem 5 hold and $`𝒞`$ is therefore generated by some $``$, $``$ and $`f`$. All subsets of $`M`$ are definable and $`f`$ is therefore defined on all subsets of $`M`$. We may extend $``$ to the language $``$ by using equations (13), (15), (18) and( 21). The choice function $`f`$, then defines an operation $`𝒞`$’ on $``$ by (1). Since $`f`$ satisfies Contraction, Coherence and Local Monotonicity, the operation $`𝒞`$’ satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity and Threshold Monotonicity. Since the models of $`M`$ satisfy equations (13), (15), (18) and( 21), $`𝒞`$ satisfies the Introduction-Elimination rules. It is left to us to see that $`𝒞(A)=P𝒞^{}(A)`$, for any $`AP`$. This follows straightforwardly from the fact that both $`𝒞(A)`$ and $`𝒞^{}(A)`$ are the set of formulas (the former of $`P`$, the latter of $``$) satisfied by all models of the set $`f(\widehat{A})`$.

## 9 Comparison with previous work

Let us assume that $``$ is a propositional language, and that $`𝒞`$ satisfies Weak Compactness, Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity, Threshold Monotonicity and the Introduction-Elimination rules for all the propositional connectives. One may define a consequence operation on $``$ by: $`a\text{ }b`$ iff $`b𝒞(\{a\})`$.

###### Theorem 8

Under the assumptions above, the relation $`\text{ }`$ is preferential (see ).

Proof: The result follows easily from Theorem 5. We shall treat only two of the six properties, the reader will easily treat the other four properties. Consider Left Logical Equivalence. Assume that $`a`$ is logically equivalent to $`a^{}`$. Then $`\widehat{\{a\}}=\widehat{\{a^{}\}}`$ and $`𝒞(\{a\})=𝒞(\{a^{}\})`$. Consider Or. Assume $`c𝒞(\{a\})`$ and $`c𝒞(\{b\})`$. Any $`xf(\widehat{\{a\}})`$ satisfies $`c`$. Any $`xf(\widehat{\{b\}})`$ satisfies $`c`$. Any $`f`$ satisfying Contraction and Coherence, satisfies $`f(XY)f(X)f(Y)`$. Therefore any $`xf(\widehat{\{a\}})f(\widehat{\{b\}})`$ satisfies $`c`$ and $`c𝒞(ab)`$.

Does the converse hold, i.e., may any preferential relation be obtained from such an operation $`𝒞`$ in such a way? The answer is yes.

###### Theorem 9

Let $`\text{ }`$ be any preferential relation. There is an operation $`𝒞`$ satisfying all the assumptions above such that $`a\text{ }b`$ iff $`b𝒞(\{a\})`$.

Proof: This follows from the construction of Theorem 14 of . The theorem claims that any finitary preferential operation (i.e., preferential relation) may be conservatively extended to an infinitary preferential operation $`𝒞`$. The definition of $`𝒞`$ is the following: $`b𝒞(A)`$ iff there exists some formula $`a`$ such that $`Aa`$ ($``$ is logical implication of propositional calculus) enjoying the following property: for any $`a^{}`$ such that $`Aa^{}`$ and $`a^{}a`$, one has $`a^{}\text{ }b`$.

The reader may check, with no need to use the theorem of  and relatively easily, that $`𝒞`$ satisfies all the properties requested. For example, $`𝒞`$ is weakly compact. Assume $`𝒞(A)=`$. Then $`\mathrm{𝐟𝐚𝐥𝐬𝐞}𝒞(A)`$ and there is some $`a`$ such that $`Aa`$ and $`a\text{ }\mathrm{𝐟𝐚𝐥𝐬𝐞}`$. But there is a finite subset $`B`$ of $`A`$ such that $`Ba`$ and $`B\text{ }\mathrm{𝐟𝐚𝐥𝐬𝐞}`$. Therefore $`\mathrm{𝐟𝐚𝐥𝐬𝐞}𝒞(B)`$.

## 10 Rational Monotonicity

In this section, an important sub-family of nonmonotonic operations will be described. It corresponds, in the present setting, to the rational relations of . The qualitative measures of Section 5.3 were partial orders. Measures (probability measures, for example) provide orders that obey an additional modularity property:

(24)
$$X>Y,XZZ>Y.$$

This seems a very natural property to require of a qualitative measure. Assume for example that there is a function $`m:2^{}𝐑`$, the set of real numbers such that $`X>Y`$ iff $`m(X)>m(Y)`$, then, $`>`$ is modular.

What is the property of choice functions that correspond to the modularity of a qualitative measure?

$$\mathrm{𝐀𝐫𝐫𝐨𝐰}XY,Xf(Y)\mathrm{}f(X)f(Y)$$

This property is in fact only one half of the property studied by K. Arrow in , assuming Contraction. The other half is Coherence. Note indeed that Arrow, Coherence and Contraction imply

(25)
$$XY,Xf(Y)\mathrm{}f(X)=Xf(Y),$$

the property originally considered by K. Arrow. Indeed, by Coherence $`Xf(Y)`$ $`f(X)`$; by Arrow, $`f(X)`$ $`f(Y)`$; by contraction $`f(X)`$ $`X`$.

The intuitive justification for Arrow is some kind of laziness principle for the choice function: if $`XY`$ and we have already a list of the best elements of $`Y`$, we shall take for the best elements of $`X`$ exactly those best elements of $`Y`$ that happen to be in $`X`$, at least whenever this new list is not empty. A remark will now show that there is a natural family of choice functions that satisfy Arrow. Suppose the elements of $``$ are ranked: our real estate agent, for example, gives a grade to every available apartment and, when asked about apartments in some area, delivers the list of all available apartments in this area that have the highest ranking. If the highest ranking in Paris is 10 and one of those apartments graded 10 happens to be on the left bank, then all best apartments on the left bank have grade 10 and are therefore part of the list of best apartments in Paris. We shall now show that Modularity and Arrow are indeed exact counterparts.

###### Theorem 10

If $`>`$ satisfies properties 4 and 24, then, the choice function $`f`$ defined by taking for $`f(X)`$ the set of heavy elements (see Definition 2) of $`X`$ satisfies Arrow. If $`f`$ is a choice function that satisfies Contraction, Coherence, Local Monotonicity and Arrow, then, the relation $`>`$ defined by: $`X>Y`$ iff $`f(X)\mathrm{}`$ and $`Yf(XY)=\mathrm{}`$ satisfies property 24.

Proof: Assume $`>`$ satisfies properties 4 and 24, and that $`XY`$ and $`xX`$ such that $`Y\{x\}`$. Let $`x^{}`$ be any heavy element of $`X`$: $`X\{x^{}\}`$. If $`x^{}`$ was not heavy in $`Y`$, we would have $`Y>\{x^{}\}`$ and, by 24, $`Y>X`$ and, by 4, $`Y>\{x\}`$, a contradiction. Therefore any heavy element of $`X`$ is a heavy element of $`Y`$.

Assume now that $`f`$ satisfies Contraction, Coherence, Local Monotonicity and Arrow and that $`X>Y`$. We shall show that either $`X>Z`$ or $`Z>Y`$. We know that $`f(X)\mathrm{}`$ and $`Yf(XY)=\mathrm{}`$. We distinguish two cases. Assume, first, that $`(YZ)f(XYZ)\mathrm{}`$. By Arrow, then, $`f(YZ)`$ $`f(XYZ)`$. But, by Contraction and then Coherence

$$f(XYZ)=f(XY(ZY))=$$

$$(XY)f(XY(ZY))(ZY)f(XY(ZY))f(XY)(ZY).$$

Therefore $`Yf(YZ)=\mathrm{}`$. If $`f(Z)\mathrm{}`$, then, we have $`Z>Y`$. If $`f(Z)=\mathrm{}`$, since, by Coherence, $`Zf(XZ)f(Z)`$, we have $`X>Z`$.

We are left with the case $`(YZ)f(XYZ)=\mathrm{}`$. By Contraction, $`f(XYZ)`$ $`X`$ $`XZ`$ $`XYZ`$. By Local Monotonicity, then, $`f(XZ)f(XYZ)`$. Therefore $`Zf(XZ)=\mathrm{}`$ and we conclude that $`X>Z`$.

Having proved the equivalence of Modularity and Arrow, we shall prove equivalence Modularity and the property of Rational Monotonicity for the operation $`𝒞`$.

###### Theorem 11

Suppose we are given a language $``$ and a function $`𝒞:2^{}2^{}`$. Then, the following two conditions are equivalent:

1. $`𝒞`$ satisfies Inclusion, Idempotence, Cautious Monotonicity, Conditional Monotonicity, Threshold Monotonicity and

$$\mathrm{𝐑𝐚𝐭𝐢𝐨𝐧𝐚𝐥}\mathrm{𝐌𝐨𝐧𝐨𝐭𝐨𝐧𝐢𝐜𝐢𝐭𝐲}𝒞(𝒞(A),B)𝒞(A)𝒞(A,B),$$
2. there exists a set $``$ (of models), a satisfaction relation $`\times `$ and a definability-preserving choice function $`f:`$ satisfying Contraction, Coherence, Local Monotonicity and Arrow such that $`𝒞(A)=`$ $`\overline{f(\widehat{A}})`$.

Rational Monotonicity, introduced in , has been studied at length in . Its intuitive justification is that, when the new information, contained in $`B`$, is consistent with what had been concluded from $`A`$, $`𝒞(A)`$, the new information will not force us to retract any previous conclusions, it may only add new conclusions. This is also a laziness principle.

Proof: We shall describe only those parts of the proof that differ from that of Theorem 4. For the soundness part: 2 implies 1, define $`𝒞(A)`$ as $`\overline{f(\widehat{A})}`$ and assume Arrow. We must derive Rational Monotonicity.

Assume $`𝒞(𝒞(A),B)`$. On one hand we have $`\mathrm{Mod}(AB)\widehat{A}`$ and on the other hand we have $`\overline{f(\mathrm{Mod}(𝒞(A)B))}`$. Therefore, $`f(\mathrm{Mod}(𝒞(A)B))\mathrm{}`$ and, by Contraction, $`\mathrm{Mod}(𝒞(A)B)\mathrm{}`$, in other terms, $`\widehat{𝒞(A)}\widehat{B}\mathrm{}`$. Since $`f`$ preserves definability: $`\widehat{𝒞(A)}=`$ $`f(\widehat{A})`$. We see that $`f(\widehat{A})\widehat{B}\mathrm{}`$ and, by Contraction, $`f(\widehat{A})\mathrm{Mod}(AB)\mathrm{}`$. By Arrow, $`f(\mathrm{Mod}(AB))`$ $`f(\widehat{A})`$. Therefore $`𝒞(A)`$ $`𝒞(A,B)`$.

For the completeness part, we define $`𝒞n`$ as in the proof of Theorem 4. The properties of $`𝒞n`$ proved there hold true. We must define $``$ slightly more carefully. We take for elements of $``$ only those sets $`T`$ such that $`T=𝒞n(T)`$. The satisfaction relation is defined as previously: $`Ta`$ iff $`aT`$. We see that, by construction, no element of $``$ satisfies all formulas of $``$ and therefore $`\overline{X}=`$ implies $`X=\mathrm{}`$. We define $`f`$ as previously. The proof that Equation 12 holds is unchanged. Assuming Rational Monotonicity, we must show that Arrow holds. Assume $`X`$ $`Y`$ and $`Xf(Y)\mathrm{}`$. We have $`\widehat{\overline{X}}`$ $`\widehat{\overline{Y}}`$ and $`Xf(Y)=`$ $`XY\widehat{𝒞(\overline{Y})}=`$ $`X\widehat{𝒞(\overline{Y})}`$ $`\mathrm{}`$. Therefore $`\widehat{\overline{X}}\widehat{𝒞(\overline{Y})}`$ $`\mathrm{}`$. Let us define $`A=\overline{X}`$ and $`B=\overline{B}`$. On one hand, we have $`\widehat{A}`$ $`\widehat{B}`$ and therefore $`𝒞n(B)𝒞n(A)`$ and on the other hand we have $`\widehat{A}\widehat{𝒞(B)}`$ $`\mathrm{}`$. Therefore $`\mathrm{Mod}(A𝒞(B))\mathrm{}`$. By the remark made at the start of this proof, when paying attention to exclude $``$ from the set $``$, we see that $`\overline{\mathrm{Mod}(A𝒞(B))}`$. Therefore $`𝒞(A,𝒞(B))`$. It is easy to show that $`𝒞(A,𝒞(B))=𝒞(𝒞n(A),𝒞(𝒞n(B)))`$. We may therefore use Rational Monotonicity to conclude that we have $`𝒞(B)𝒞(A)`$, i.e., $`𝒞(\overline{Y})`$ $`𝒞(\overline{X})`$ and $`\widehat{𝒞(\overline{X})}`$ $`\widehat{𝒞(\overline{Y})}`$. Therefore $`X\widehat{𝒞(\overline{X})}`$ $`Y\widehat{𝒞(\overline{Y})}`$, i.e., $`f(X)`$ $`f(Y)`$.

We have shown that the additional property of Rational Monotonicity, studied in the literature, corresponds exactly to an additional property of the choice function $`f`$. The family of nonmonotonic operations satisfying Rational Monotonicity has different closure properties than the larger family studied in the preceding sections. In particular, it is not closed under intersection. The reader will easily find a counter example. One such example is provided in .

## 11 Conclusion

We have described two quite different but equivalent semantic frameworks: choice functions and qualitative measures, that provide an ontology for nonmonotonic deduction. Choice functions have been studied by researchers in Social Choice for their rationalizability properties, i.e., by what kind of aggregation mechanism can they arise from individual preferences? The equivalence we have shown with qualitative measures may be of interest to those researchers. The family of nonmonotonic operations defined in Section 4 is precisely the family defined by choice functions or by qualitative measures, it is a natural generalization of Tarski’s monotonic deductive operations. The operations of this family are closed under intersection. The classical connectives may be defined elegantly for this family of operations, by properties that are weaker than those generally considered in the monotonic case. Only a very mild compactness assumption is needed. The sentential connectives may be defined by Introduction-Elimination rules. The connectives defined have a classical semantics. A further property of choice functions, considered by K. Arrow , is shown to be equivalent to the modularity (i.e., negative-transitivity) of the qualitative measure and the operations defined are characterized by the additional property of Rational Monotonicity of .

A large number of questions and alleys for future research are left open by this work. Let us mention a few, roughly from the small and technical to the vast and philosophical.

The equivalence of Qualitative Measures and Choice functions semantics has been shown only under the Simplifying Assumption. A more general equivalence requires the introduction of a family of definable sets in the framework of Qualitative Measures and probably the introduction of some counterpart to Definability Preservation.

Theorem 7 has been proved only under the assumption that $`P`$ is finite. Does it hold without this restriction, and if not, does it hold without this restriction if one assumes $`𝒞`$ to be weakly compact?

The framework of Choice Functions begs the semantic definition of non-classical, non-truth functional connectives. The study of such connectives (unary or, more probably, binary) in nonmonotonic logics seems particularly exciting. The preferred interpretation of the choice function suggests a link with deontic logics.

This work sheds new light on properties studied by researchers in Social Choice. In particular new insights on the case of an infinite set of outcomes have been presented. Are they relevant to the Social Choice community?

In, a positive answer was given to a question that can now be seen as equivalent to: given a choice function that satisfies Contraction, Coherence and Local Monotonicity, is there a canonical way to restrict this choice function in a way that ensures the Arrow property? This canonical construction, rational closure, offers a way to aggregate individual preferences into collective preferences that satisfy the Arrow property. This aggregation method does not satisfy Independence from Irrelevant Alternatives. Is it of any interest for Social Choice?

This work uses Tarski’s framework. Most proof-theoretic studies use Gentzen’s framework. The translation of the results of this paper to the language of Gentzen’s sequents may be illuminating. It seems one will have to consider sequents whose sides may be infinite sets of formulas.

## 12 Acknowledgments

A number of people provided me with suggestions that improved the presentation of this paper, in particular, Shai Berger, Tom Costello, David Israel, Michael Freund, Karl Schlechta and an anonymous referee. Very special thanks are due to David Makinson for his remarks, both conceptual and technical and to the students of CS67999 (5758 edition) who provided the motivation for this work and very useful comments.


text:
# Electroweak corrections to the decays of top squark and gluino

## Appendix A

In this appendix, we list the self-energies of top squark and top quark contributed by Fig.1(c) and Fig.1(d). The relevant Feynman rules are presented in Refs. . We adopt the notations of the couplings that chargino (neutralino) coupling with quark and squark in Ref.. They are written as bellow

$`\overline{b}\stackrel{~}{t}_i\overline{\stackrel{~}{\chi }}_j^+`$ $`:`$ $`\left(V_{b\stackrel{~}{t}_i\stackrel{~}{\chi }_j^+}^{(1)}P_L+V_{b\stackrel{~}{t}_i\stackrel{~}{\chi }_j^+}^{(2)}P_R\right)C,\overline{t}\stackrel{~}{b}_i\stackrel{~}{\chi }_j^+:V_{t\stackrel{~}{b}_i\stackrel{~}{\chi }_j^+}^{(1)}P_L+V_{t\stackrel{~}{b}_i\stackrel{~}{\chi }_j^+}^{(2)}P_R,`$
$`\overline{b}\stackrel{~}{b}_i\stackrel{~}{\chi }_j^0`$ $`:`$ $`V_{b\stackrel{~}{b}_i\stackrel{~}{\chi }_j^0}^{(1)}P_L+V_{b\stackrel{~}{b}_i\stackrel{~}{\chi }_j^0}^{(2)}P_R,\overline{t}\stackrel{~}{t}_i\stackrel{~}{\chi }_j^0:V_{t\stackrel{~}{t}_i\stackrel{~}{\chi }_j^0}^{(1)}P_L+V_{t\stackrel{~}{t}_i\stackrel{~}{\chi }_j^0}^{(2)}P_R,`$ (A.1)
where $`C`$ is the charge conjugation operator.

Defining $`H_m^0=(h^0,H^0,A^0,G^0)(m=1,2,3,4)`$ and $`H_n^\pm =(H^\pm ,G^\pm )(n=1,2)`$, the couplings between $`H_m^0(H_n^\pm )`$ and quark(squark) are denoted as

$`H_n^+\overline{t}b`$ $`:`$ $`V_{H_n^+tb}^{(1)}P_L+V_{H_n^+tb}^{(2)}P_R,H_n^+\stackrel{~}{t}_i\stackrel{~}{b}_j:V_{H_n^+\stackrel{~}{t}_i\stackrel{~}{b}_j},`$
$`H_n^+H_n^{}\stackrel{~}{t}_i\stackrel{~}{t}_j`$ $`:`$ $`V_{H_n^+H_n^{}\stackrel{~}{t}_i\stackrel{~}{t}_j},`$
$`H_m^0\overline{t}t`$ $`:`$ $`V_{H_m^0tt}(form=1,2);\gamma _5V_{H_m^0tt}(form=3,4),`$
$`H_m^0\stackrel{~}{t}_i\stackrel{~}{t}_j`$ $`:`$ $`V_{H_m^0\stackrel{~}{t}_i\stackrel{~}{t}_j},H_m^0H_m^0\stackrel{~}{t}_i\stackrel{~}{t}_j:V_{H_m^0H_m^0\stackrel{~}{t}_i\stackrel{~}{t}_j}.`$ (A.2)
The couplings between four squarks are denoted as

$`\stackrel{~}{t}_i\stackrel{~}{t}_j\stackrel{~}{t}_k\stackrel{~}{t}_l:V_{\stackrel{~}{t}_i\stackrel{~}{t}_j\stackrel{~}{t}_k\stackrel{~}{t}_l}\stackrel{~}{t}_i\stackrel{~}{t}_j\stackrel{~}{b}_k\stackrel{~}{b}_l:V_{\stackrel{~}{t}_i\stackrel{~}{t}_j\stackrel{~}{b}_k\stackrel{~}{b}_l}`$ (A.3)
And we denote the couplings between gluino , quark and squark as

$`\stackrel{~}{g}\stackrel{~}{t}_i\overline{t}:V_{\stackrel{~}{g}\stackrel{~}{t}_it}^{(1)}P_L+V_{\stackrel{~}{g}\stackrel{~}{t}_it}^{(2)}P_R\stackrel{~}{g}\stackrel{~}{b}_i\overline{b}:V_{\stackrel{~}{g}\stackrel{~}{b}_ib}^{(1)}P_L+V_{\stackrel{~}{g}\stackrel{~}{b}_ib}^{(2)}P_R`$ (A.4)
The stop quark self-energy contributed by Fig.1(c1)-(c3) reads

$`\mathrm{\Sigma }_{ij}^{\stackrel{~}{t}}(p^2)`$ $`=`$ $`{\displaystyle \frac{1}{16\pi ^2}}\{{\displaystyle \underset{m}{\overset{4}{}}}{\displaystyle \underset{\alpha }{\overset{2}{}}}[2iA_0(m_{H_m^0})V_{H_m^0H_m^0\stackrel{~}{t}_i\stackrel{~}{t}_j}B_0(p,m_{\stackrel{~}{t_\alpha }},m_{H_m^0})V_{H_m^0\stackrel{~}{t}_j\stackrel{~}{t}_\alpha }V_{H_m^0\stackrel{~}{t}_\alpha \stackrel{~}{t}_i}]`$ (A.5)
$``$ $`{\displaystyle \underset{n}{\overset{2}{}}}{\displaystyle \underset{\beta }{\overset{2}{}}}\left[iA_0(m_{H_n^+})V_{H_n^+H_n^{}\stackrel{~}{t}_i\stackrel{~}{t}_j}+B_0(p,m_{\stackrel{~}{b_\beta }},m_{H_n^+})V_{H_n^+\stackrel{~}{t}_i\stackrel{~}{b}_\beta }V_{H_n^+\stackrel{~}{t}_j\stackrel{~}{b}_\beta }\right]`$
$``$ $`{\displaystyle \underset{l}{\overset{4}{}}}[2(V_{t\stackrel{~}{t}_j\stackrel{~}{\chi }_l^0}^{(1)}V_{t\stackrel{~}{t}_i\stackrel{~}{\chi }_l^0}^{(1)}+V_{t\stackrel{~}{t}_j\stackrel{~}{\chi }_l^0}^{(2)}V_{t\stackrel{~}{t}_i\stackrel{~}{\chi }_l^0}^{(2)})(A_0(m_{\stackrel{~}{\chi }_l^0})+B_0(p,m_t,m_{\stackrel{~}{\chi }_l^0})m_t^2+B_1(p,m_t,m_{\stackrel{~}{\chi }_l^0})p^2)`$
$`+`$ $`2B_0(p,m_t,m_{\stackrel{~}{\chi }_l^0})m_tm_{\stackrel{~}{\chi }_l^0}(V_{t\stackrel{~}{t}_j\stackrel{~}{\chi }_l^0}^{(2)}V_{t\stackrel{~}{t}_i\stackrel{~}{\chi }_l^0}^{(1)}+V_{t\stackrel{~}{t}_j\stackrel{~}{\chi }_l^0}^{(1)}V_{t\stackrel{~}{t}_i\stackrel{~}{\chi }_l^0}^{(2)})]`$
$``$ $`{\displaystyle \underset{k}{\overset{2}{}}}[2(V_{b\stackrel{~}{t}_j\stackrel{~}{\chi }_k^+}^{(1)}V_{b\stackrel{~}{t}_i\stackrel{~}{\chi }_k^+}^{(1)}+V_{b\stackrel{~}{t}_j\stackrel{~}{\chi }_k^+}^{(2)}V_{b\stackrel{~}{t}_i\stackrel{~}{\chi }_k^+}^{(2)})(A_0(m_{\stackrel{~}{\chi }_k^+})+B_0(p,m_b,m_{\stackrel{~}{\chi }_k^+})m_b^2+B_1(p,m_b,m_{\stackrel{~}{\chi }_k^+})p^2)`$
$`+`$ $`2B_0(p,m_b,m_{\stackrel{~}{\chi }_k^+})m_bm_{\stackrel{~}{\chi }_k^+}(V_{b\stackrel{~}{t}_j\stackrel{~}{\chi }_k^+}^{(2)}V_{b\stackrel{~}{t}_i\stackrel{~}{\chi }_k^+}^{(1)}+V_{b\stackrel{~}{t}_j\stackrel{~}{\chi }_k^+}^{(1)}V_{b\stackrel{~}{t}_i\stackrel{~}{\chi }_k^+}^{(2)})]`$
$``$ $`{\displaystyle \underset{\alpha ,\beta }{\overset{2}{}}}[iA_0(m_{\stackrel{~}{t}_\alpha })V_{\stackrel{~}{t}_i\stackrel{~}{t}_\alpha \stackrel{~}{t}_\alpha \stackrel{~}{t}_j}+iA_0(m_{\stackrel{~}{b}_\beta })V_{\stackrel{~}{t}_i\stackrel{~}{b}_\beta \stackrel{~}{b}_\beta \stackrel{~}{t}_j}]\}`$
The top quark self-energy contributed by Fig.1(d1) and 1(d2) reads

$`\mathrm{\Sigma }_{tt}(p^2)`$ $`=`$ $`i(\text{/}p\mathrm{\Sigma }_{tt}^LP_L+\text{/}p\mathrm{\Sigma }_{tt}^RP_R+\mathrm{\Sigma }_{tt}^{SL}P_L+\mathrm{\Sigma }_{tt}^{SR}P_R),`$ (A.6)
where

$`\mathrm{\Sigma }_{tt}^L`$ $`=`$ $`{\displaystyle \frac{1}{16\pi ^2}}\{{\displaystyle \underset{m}{\overset{4}{}}}[(V_{H_m^0tt})^2B_1(p,m_t,m_{H_m^0})]{\displaystyle \underset{n}{\overset{2}{}}}[(V_{H_n^+tb}^{(2)})^2B_1(p,m_b,m_{H_n^+})]`$
$`+`$ $`{\displaystyle \underset{k}{\overset{2}{}}}{\displaystyle \underset{\beta }{\overset{2}{}}}[(V_{t\stackrel{~}{b}_\beta \stackrel{~}{\chi }_k^+}^{(2)})^2(B_0+B_1)(p,m_{\stackrel{~}{b}_\beta },m_{\stackrel{~}{\chi }_k^+})]+{\displaystyle \underset{l}{\overset{4}{}}}{\displaystyle \underset{\alpha }{\overset{2}{}}}[(V_{t\stackrel{~}{t}_\alpha \stackrel{~}{\chi }_l^0}^{(2)})^2(B_0+B_1)(p,m_{\stackrel{~}{t}_\alpha },m_{\stackrel{~}{\chi }_l^0})]\}`$
$`\mathrm{\Sigma }_{tt}^R`$ $`=`$ $`\mathrm{\Sigma }_{tt}^L\left(V_{H_n^+tb}^{(2)}V_{H_n^+tb}^{(1)},V_{t\stackrel{~}{b}_\beta \stackrel{~}{\chi }_k^+}^{(2)}V_{t\stackrel{~}{b}_\beta \stackrel{~}{\chi }_k^+}^{(1)},V_{t\stackrel{~}{t}_\alpha \stackrel{~}{\chi }_l^0}^{(2)}V_{t\stackrel{~}{t}_\alpha \stackrel{~}{\chi }_l^0}^{(1)}\right)`$
$`\mathrm{\Sigma }_{tt}^{SL}`$ $`=`$ $`{\displaystyle \frac{1}{16\pi ^2}}\{{\displaystyle \underset{m}{\overset{4}{}}}[(V_{H_m^0tt})^2m_tB_1(p,m_t,m_{H_m^0})]+{\displaystyle \underset{n}{\overset{2}{}}}[V_{H_n^+tb}^{(2)}V_{H_n^+tb}^{(1)}m_bB_1(p,m_b,m_{H_n^+})]`$
$`+`$ $`{\displaystyle \underset{k}{\overset{2}{}}}{\displaystyle \underset{\beta }{\overset{2}{}}}[V_{t\stackrel{~}{b}_\beta \stackrel{~}{\chi }_k^+}^{(2)}V_{t\stackrel{~}{b}_\beta \stackrel{~}{\chi }_k^+}^{(1)}m_{\stackrel{~}{\chi }_k^+}B_0(p,m_{\stackrel{~}{b}_\beta },m_{\stackrel{~}{\chi }_k^+})]+{\displaystyle \underset{l}{\overset{4}{}}}{\displaystyle \underset{\alpha }{\overset{2}{}}}[V_{t\stackrel{~}{t}_\alpha \stackrel{~}{\chi }_l^0}^{(2)}V_{t\stackrel{~}{t}_\alpha \stackrel{~}{\chi }_l^0}^{(1)}m_{\stackrel{~}{\chi }_l^0}B_0(p,m_{\stackrel{~}{t}_\alpha },m_{\stackrel{~}{\chi }_l^0})]\}`$
$`\mathrm{\Sigma }_{tt}^{SR}`$ $`=`$ $`\mathrm{\Sigma }_{tt}^{SL}\left(V_{H_n^+tb}^{(2)}V_{H_n^+tb}^{(1)}V_{H_n^+tb}^{(1)}V_{H_n^+tb}^{(2)},V_{t\stackrel{~}{b}_\beta \stackrel{~}{\chi }_k^+}^{(2)}V_{t\stackrel{~}{b}_\beta \stackrel{~}{\chi }_k^+}^{(1)}V_{t\stackrel{~}{b}_\beta \stackrel{~}{\chi }_k^+}^{(1)}V_{t\stackrel{~}{b}_\beta \stackrel{~}{\chi }_k^+}^{(2)},V_{t\stackrel{~}{t}_\alpha \stackrel{~}{\chi }_l^0}^{(2)}V_{t\stackrel{~}{t}_\alpha \stackrel{~}{\chi }_l^0}^{(1)}V_{t\stackrel{~}{t}_\alpha \stackrel{~}{\chi }_l^0}^{(1)}V_{t\stackrel{~}{t}_\alpha \stackrel{~}{\chi }_l^0}^{(2)}\right)`$
(A.7)
In our paper we adopt the definitions of the one-loop integrals in the Ref. . The numerical calculation of the vector and tensor one-loop integral functions can be traced back to four scalar loop integrals $`A_0`$, $`B_0`$, $`C_0`$, $`D_0`$ as shown in .

Figure Captions

Fig.1 Feynman diagrams including one-loop Yukawa corrections to the decays $`\stackrel{~}{t}_j\stackrel{~}{g}+t`$ and $`\stackrel{~}{g}\overline{t}+\stackrel{~}{t}_j`$: Fig.1(a) tree-level diagram. Fig.1(b) vertex corrections for stop decays. Fig.1(c) stop quark self-energies. Fig.1(d) top quark self-energies. In these Figures $`H_m^0=h^0,H^0,A^0,G^0(m=14)`$ and $`H_n^+=H^+,G^+(n=1,2)`$.

Fig.2 The relative correction for $`\stackrel{~}{t}_2\stackrel{~}{g}+t`$ as a function of $`m_{\stackrel{~}{g}}`$.

Fig.3 The relative correction for $`\stackrel{~}{t}_2\stackrel{~}{g}+t`$ as a function of $`m_{1/2}`$ in the mSUGRA scenario.

Fig.4 The relative correction for $`\stackrel{~}{g}\overline{t}+\stackrel{~}{t}_1`$ as a function of $`m_{\stackrel{~}{g}}`$.

Fig.5 The relative correction for $`\stackrel{~}{g}\overline{t}+\stackrel{~}{t}_1`$ as a function of $`m_{1/2}`$ in the mSUGRA scenario.