The volume analyses and develops David Makinson’s efforts to make classical logic useful outside its most obvious application areas. The book contains chapters that analyse, appraise, or reshape Makinson’s work and chapters that develop themes emerging from his contributions. These are grouped into major areas to which Makinsons has made highly influential contributions and the volume in its entirety is divided into four sections, each devoted to a particular area of logic: belief change, uncertain reasoning, normative systems and the resources (...) of classical logic. Among the contributions included in the volume, one chapter focuses on the “inferential preferential method”, i.e. the combined use of classical logic and mechanisms of preference and choice and provides examples from Makinson’s work in non-monotonic and defeasible reasoning and belief revision. One chapter offers a short autobiography by Makinson which details his discovery of modern logic, his travels across continents and reveals his intellectual encounters and inspirations. The chapter also contains an unusually explicit statement on his views on the role of logic in philosophy. (shrink)

Changing preferencesis a phenomenonoften invoked but rarely properlyaccounted for. Throughout the history of the social sciences, researchers have come against the possibility that their subjects’ preferenceswere affected by the phenomenato be explainedor by otherfactorsnot taken into accountin the explanation.Sporadically, attempts have been made to systematically investigate these in uences, but none of these seems to have had a lasting impact. Today we are still not much further with respect to preference change than we were at the middle of the last (...) century. This anthology hopes to provide a new impulse for research into this important subject. In particular, we have chosen two routes to amplify this impulse. First, we stress the use of modellingtechniquesfamiliar from economicsand decision theory. Instead of constructing complex, all-encompassing theories of preference change, the authors of this volume start with very simple, formal accounts of some possible and hopefully plausible mechanism of preference change. Eventually, these models may nd their way into larger, empirically adequate theories, but at this stage, we think that the most importantwork lies in building structure.Secondly,we stress the importance of interdisciplinary exchange. Only by drawing together experts from different elds can the complex empirical and theoretical issues in the modelling of preference change be adequately investigated. (shrink)

This book provides a critical examination of how the choice of what to believe is represented in the standard model of belief change. In particular the use of possible worlds and infinite remainders as objects of choice is critically examined. Descriptors are introduced as a versatile tool for expressing the success conditions of belief change, addressing both local and global descriptor revision. The book presents dynamic descriptors such as Ramsey descriptors that convey how an agent’s beliefs tend to be changed (...) in response to different inputs. It also explores sentential revision and demonstrates how local and global operations of revision by a sentence can be derived as a special case of descriptor revision. Lastly, the book examines revocation, a generalization of contraction in which a specified sentence is removed in a process that may possibly also involve the addition of some new information to the belief set. (shrink)

An operator of belief change is reconstructible as another such operator if and only if any outcome that can be obtained with the former can also be obtained with the latter. Two operators are mutually reconstructible if they generate exactly the same set of outcomes. The relations of reconstructibility among fifteen operators of contraction, including the common AGM contraction operators, are completely characterized. Furthermore, the additional such relations are characterized that arise if all belief sets are required to be finite-based (...) or if the language is finite. These results are significant for the choice of a formal model to represent how real-world agents change their beliefs. In particular, if two contraction operators are mutually reconstructible, then that limits the types of considerations that can legitimately be invoked in favour of one over the other. (shrink)

The basic assumption of repertoire contraction is that only some of the logically closed subsets of the original belief set are viable as contraction outcomes. Contraction takes the form of choosing directly among these viable outcomes, rather than among cognitively more far-fetched objects such as possible worlds or maximal consistent subsets of the original belief set. In this first investigation of repertoire contraction, postulates for various variants of the operation are introduced. Necessary and sufficient conditions are given for when repertoire (...) contraction coincides with AGM contraction or with operations generated by AGM-style contraction on a belief base. A close connection is shown to hold between repertoire contraction and specified meet contraction. (shrink)

The probability that a fair coin tossed yesterday landed heads is either 0 or 1, but the probability that it would land heads was 0.5. In order to account for the latter type of probabilities, past probabilities, a temporal restriction operator is introduced and axiomatically characterized. It is used to construct a representation of conditional past probabilities. The logic of past probabilities turns out to be strictly weaker than the logic of standard probabilities.

The outcome set of a belief change operator is the set of outcomes that can be obtained with it. Axiomatic characterizations are reported for the outcome sets of the standard AGM contraction operators and eight types of base-generated contraction. These results throw new light on the properties of some of these operators.

Multiple contraction (simultaneous contraction by several sentences) and iterated contraction are investigated in the framework of specified meet contraction (s.m.c.) that is extended for this purpose. Multiple contraction is axiomatized, and so is finitely multiple contraction (contraction by a finite set of sentences). Two ways to reduce finitely multiple contraction to contraction by single sentences are introduced. The reduced operations are axiomatically characterized and their properties are investigated. Furthermore, it is shown how iterated contraction can be reduced to single-step, single-sentence (...) contraction. However, in this framework the outcome of iterated contraction depends unavoidably on the order in which the inputs are received. This order-dependence makes it impossible to treat two inputs on an equal footing. Therefore it is often preferable to perform changes involving several pieces of information as multiple rather than iterated change. (shrink)

Generalizations of partial meet contraction are introduced that start out from the observation that only some of the logically closed subsets of the original belief set are at all viable as contraction outcomes. Belief contraction should proceed by selection among these viable options. Several contraction operators that are based on such selection mechanisms are introduced and then axiomatically characterized. These constructions are more general than the belief base approach. It is shown that partial meet contraction is exactly characterized by adding (...) to one of these constructions the condition that all logically closed subsets of the belief set can be obtained as the outcome of a single (multiple) contraction. Examples are provided showing the counter-intuitive consequences of that condition, thus confirming the credibility of the proposed generalization of the AGM framework. (shrink)

Two of the major problems in AGM-style belief revision, namely the difficulties in accounting for iterated change and for Ramsey test conditionals, have satisfactory solutions in descriptor revision. In descriptor revision, the input is a metalinguistic sentence specifying the success condition of the operation. The choice mechanism selects one of the potential outcomes in which the success condition is satisfied. Iteration of this operation is unproblematic. Ramsey test conditionals can be introduced without giving rise to the paradoxical results that they (...) generate in other systems. In addition to standard Ramsey test conditionals, a more general variant of epistemic conditionals is defined, representing statements of the form ”if the belief state is changed to satisfy condition A then it will satisfy condition B”. An axiomatic characterization of such descriptor conditionals is presented. It is related in intricate ways to the KLM postulates for cumulative reasoning. (shrink)

In order to clarify the problems of iterated (global) belief change it is useful to study simple cases, in particular consecutive contractions by sentences that are both logically and epistemically independent. Models in which the selection mechanism is kept constant are much more plausible in this case than what they are in general. One such model, namely uniform specified meet contraction, has the advantage of being closely connected with the AGM model. Its properties seem fairly adequate for the intended type (...) of contraction. However, the revision operator based on it via the Levi identity collapses into an implausible operation that loses all old information when revising by new information. A weaker version, semi-uniform specified meet contraction, avoids the collapse but has the disadvantage of a remarkably weak logic. It is left as an open issue whether there is an intermediate class of contraction operators that yields a more satisfactory logic. (shrink)

Contractions on belief sets that have no finite representation cannot be finite in the sense that only a finite number of sentences is removed. However, such contractions can be delimited so that the actual change takes place in a logically isolated, finite-based part of the belief set. A construction that answers to this principle is introduced, and is axiomatically characterized. It turns out to coincide with specified meet contraction.

Traditionally, belief change is modelled as the construction of a belief set that satisfies a success condition. The success condition is usually that a specified sentence should be believed or not believed. Furthermore, most models of belief change employ a select-and-intersect strategy. This means that a selection is made among primary objects that satisfy the success condition, and the intersection of the selected objects is taken as outcome of the operation. However, the select-and-intersect method is difficult to justify, in particular (...) since the primary objects are not themselves plausible outcome candidates. Some of the most controversial features of belief change theory, such as recovery and the impossibility of Ramsey test conditionals, are closely connected with the select-and-intersect method. It is proposed that a selection mechanism should instead operate directly on the potential outcomes, and select only one of them. In this way many of the problems that are associated with the select-and-intersect method can be avoided. This model is simpler than previous models in the important Ockhamist sense of doing away with intermediate, cognitively inaccessible objects. However, the role of simplicity as a choice criterion in the direct selection among potential outcomes is left as an open issue. (shrink)

Blockage contraction is an operation of belief contraction that acts directly on the outcome set, i.e. the set of logically closed subsets of the original belief set K that are potential contraction outcomes. Blocking is represented by a binary relation on the outcome set. If a potential outcome X blocks another potential outcome Y, and X does not imply the sentence p to be contracted, then Y ≠ K ÷ p. The contraction outcome K ÷ p is equal to the (...) (unique) inclusion-maximal unblocked element of the outcome set that does not imply p. Conditions on the blocking relation are specified that ensure the existence of such a unique inclusion-maximal set for all sentences p. Blockage contraction is axiomatically characterized and its relations to AGM-style operations are investigated. In a finite-based framework, every transitively relational partial meet contraction is also a blockage contraction. (shrink)

We can often specify how we would contract by a certain sentence by saying that this contraction would coincide with some other contraction that we know how to perform. We can for instance clarify that our contraction by p&q would coincide with our contraction by p, or by q, or by {p, q}. In a framework where the set of potential outcomes is known, some contractions are “self-evident” in the sense that there is only one serious candidate that can be (...) the outcome of such a contraction. Contraction by a specific contractee (sentence or set of sentences to be contracted) is bootstrapped if it is specified by saying that it coincides with some such self-evident contraction. For a wide range of (multiple) contraction operators, contractions by any contractee can be bootstrapped. This means that the selection mechanism (selection function, incision function, etc.) can be replaced by a function called a bootstrapping selector that assigns to each contractee some “self-evident” contractee that yields the same outcome. With bootstrapping we can eliminate traditional extralogical components in contraction (e.g., selection functions) and replace them by bootstrapping selectors that reflect more closely the ways in which we actually reason and argue about belief contraction. (shrink)

Belief revision theories aim to model the dynamics of epistemic states. Besides beliefs, epistemic states comprise most importantly justificational structures. Typically, belief revision theories, however, model the dynamics of beliefs while neglecting justificational structures over and above logical relations. Despite some awareness that this approach is problematic, how devastating the consequences of this neglect are has not yet been fully grasped. In this paper, I argue that taking justificational structures into account could solve four well-known problems of belief revision.

The 1985 paper by Carlos Alchourrón (1931–1996), Peter Gärdenfors, and David Makinson (AGM), "On the Logic of Theory Change: Partial Meet Contraction and Revision Functions" was the starting-point of a large and rapidly growing literature that employs formal models in the investigation of changes in belief states and databases. In this review, the first twentyfive years of this development are summarized. The topics covered include equivalent characterizations of AGM operations, extended representations of the belief states, change operators not included in (...) the original framework, iterated change, applications of the model, its connections with other formal frameworks, computatibility of AGM operations, and criticism of the model. (shrink)

The 1985 paper by Carlos Alchourrón, Peter Gärdenfors, and David Makinson, “On the Logic of Theory Change: Partial Meet Contraction and Revision Functions” was the starting-point of a large and rapidly growing literature that employs formal models in the investigation of changes in belief states and databases. In this review, the first twenty-five years of this development are summarized. The topics covered include equivalent characterizations of AGM operations, extended representations of the belief states, change operators not included in the original (...) framework, iterated change, applications of the model, its connections with other formal frameworks, computatibility of AGM operations, and criticism of the model. (shrink)

Full meet contraction, that was devised by Carlos Alchourrón and David Makinson in the early 1980' s, has often been overlooked since it is not in itself a plausible contraction operator. However, it is a highly useful building-block in the construction of composite contraction operators. In particular, all plausible contraction operators can be reconstructed so that the outcome of contracting a belief set K by a sentence p is defined as K ∼ f, where ∼ is full meet contraction and (...) f a sentential selector, i.e. a function to and from sentences. This paper investigates the logic of full meet contraction. Seven properties of this operation are presented that contribute to making it useful as a building-block: Full meet contraction is a purely logical operation. It retains finitebasedness of the belief set. It is the inclusion-maximal contraction that removes all sentences that can contribute to implying the input sentence. It is the inclusion-maximal contraction that removes all non-tautologous consequences of the input sentence. Almost all contractions can be reconstructed as full meet contraction. Full meet contraction allows for recovery of the input sentence. Full meet contraction provides a unified account of multiple and singleton contraction. La llamada full meet contraction, creada por Carlos Alchourrón y David Makinson en los comienzos de los ' 80, ha sido a menudo desestimada puesto que ella no constituye un operador de contracción plausible. De todas formas ella es altamente útil en la construcción de operadores de contracción compuestos. En particular, todos los operadores de contracción plausibles pueden ser reconstruidos de forma tal que la contracción de un conjunto de creencias K por una sentencia p sea definida como K ∼ f, donde ∼ es una full meet contraction y f un selector de sentencias, i.e., una función de sentencias a sentencias. En este trabajo investigamos la lógica de la full meet contraction. Se presentan siete propiedades de esta operación que contribuyen a hacerla útil como building-block: Full meet contraction es una operación puramente lógica. Ella retiene la finit- basednes del conjunto de creencias. Ella es la máxima-inclusiva de las contracciones que elimina todas las sentencias que pueden contribuir a implicar la input-sentence. Es la contracción maximal inclusiva que elimina todas las consecuencias no tautológicas de la input-sentence. Casi todas las contracciones pueden ser reconstruidas como full-meet contractions. Full meet contraction permite la recuperación de la input-sentence. Full meet contracción da cuenta en forma unificada de las contracciones múltiples y singulares. (shrink)

Modern belief revision theory is based to a large extent on partial meet contraction that was introduced in the seminal article by Carlos Alchourrón, Peter Gärdenfors, and David Makinson that appeared in 1985. In the same year, Alchourrón and Makinson published a significantly different approach to the same problem, called safe contraction. Since then, safe contraction has received much less attention than partial meet contraction. The present paper summarizes the current state of knowledge on safe contraction, provides some new results (...) and offers a list of unsolved problems that are in need of investigation. (shrink)