This paper extends earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising a theory to introduce a proposition. In the course of the earlier work, Gardenfors developed general postulates of a more or less equational nature for such processes, whilst Alchourron and Makinson studied the particular case of contraction functions that are maximal, in the sense of yielding a maximal subset of the theory (or alternatively, of one of (...) its axiomatic bases), that fails to imply the proposition being eliminated. In the present paper, the authors study a broader class, including contraction functions that may be less than maximal. Specifically, they investigate "partial meet contraction functions", which are defined to yield the intersection of some nonempty family of maximal subsets of the theory that fail to imply the proposition being eliminated. Basic properties of these functions are established: it is shown in particular that they satisfy the Gardenfors postulates, and moreover that they are sufficiently general to provide a representation theorem for those postulates. Some special classes of partial meet contraction functions, notably those that are "relational" and "transitively relational", are studied in detail, and their connections with certain "supplementary postulates" of Gardenfors investigated, with a further representation theorem established. (shrink)

The so called Ramsey test is a semantic recipe for determining whether a conditional proposition is acceptable in a given state of belief. Informally, it can be formulated as follows: (RT) Accept a proposition of the form "if A, then C" in a state of belief K, if and only if the minimal change of K needed to accept A also requires accepting C. In Gärdenfors (1986) it was shown that the Ramsey test is, in the context of some other (...) weak conditions, on pain of triviality incompatible with the following principle, which was there called the preservation criterion: (P) If a proposition B is accepted in a given state of belief K and the proposition A is consistent with the beliefs in K, then B is still accepted in the minimal change of K needed to accept A. (RT) provides a necessary and sufficient criterion for when a 'positive' conditional should be included in a belief state, but it does not say anything about when the negation of a conditional sentence should be accepted. A very natural candidate for this purpose is the following negative Ramsey test: (NRT) Accept the negation of a proposition of the form "if A, then C" in a consistent state of belief K, if and only if the minimal change of K needed to accept A does not require accepting C. This note shows that (NRT) leads to triviality results even in the absence of additional conditions like (P). (shrink)

In earlier papers (Lindström & Rabinowicz, 1989. 1990), we proposed a generalization of the AGM approach to belief revision. Our proposal was to view belief revision as a relation rather thanas a function on theories (or belief sets). The idea was to allow for there being several equally reasonable revisions of a theory with a given proposition. In the present paper, we show that the relational approach is the natural result of generalizing in a certain way an approach to belief (...) revision due to Adam Grove. In his (1988) paper, Grove presents two closely related modelings of functional belief revision, one in terms of a family of "spheres" around the agent's theory G and the other in terms of an epistemic entrenchment ordering of propositions. The "sphere"-terminology is natural when one looks upon theories and propositions as being represented by sets of possible worlds. Grove's spheres may be thought of as possible "fallback" theories relative to the agent's original theory: theories that he may reach by deleting propositions that are not "sufficiently" entrenched (according to standards of sufficient entrenchment of varying stringency). To put it differently, fallbacks are theories that are closed upwards under entrenchment The entrenchment ordering can be recovered from the family of fallbacks by the definition: A is at least as entrenched as B iff A belongs to every fallback to which B belongs. To revise a theory T with a proposition A, we go to the smallest sphere that contain A-worlds and intersect it with A. The relational notion of belief revision that we are interested in, results from weakening epistemic entrenchment by not assuming it to be connected. I.e., we want to allow that some propositions may be incomparable with respect to epistemic entrenchment. As a result, the family of fallbacks around a given theory will no longer have to be nested. This change opens up the possibility for several different ways of revising a theory with a given proposition. (shrink)