Investigates the resolution of contradictions and ambiguous derogations in a code, by means of the imposition of partial orderings.

Investigates the resolution of contradictions and ambiguous derogations in a code, by means of the imposition of partial orderings. Although formulated as a study in the logic of norms, it provided the initial ideas for work on the logic of theory (or belief) change, developed by the authors in a series of papers by the authors and Peter Gardenfors beginning in 1985.

First published in 2000. Routledge is an imprint of Taylor & Francis, an informa company.

In the middle of the 1980s, logical tools were discovered that make it possible to model changes in belief and knowledge in entirely new ways. These logical tools turned out to be applicable both to human beliefs and to the contents of databases. This is the first textbook in this new area. It contains both discursive chapters with a minimum of formalism and formal chapters in which proofs and proof methods are presented. By using different selections from the formal section (...) the book can be used on all levels of University education. (shrink)

This comprehensive discussion of the problem of rational belief develops the subject on the pattern of Bayesian decision theory. The analogy with decision theory introduces philosophical issues not usually encountered in logical studies and suggests some promising new approaches to old problems."We owe Professor Levi a debt of gratitude for producing a book of such excellence. His own approach to inductive inference is not only original and profound, it also clarifies and transforms the work of his predecessors. In short, the (...) book deserves to become a classic....There is a great deal of interest in the book besides these basic matters [forumlating rules of acceptance]. Some of the most interesting chapters are those that examine the implications of such rules. The discussions of probability, generalization, and various forms of inference are brilliant and enlightening. Indeed, the problems and methods elaborated by Professor Levi in his book serve as a new foundation for the study of inductive inference."--Keith Lehrer, Nous"Levi's book is an extremely interesting report on 'tentative and speculative first steps' toward a decision-theoretic approach to inductive inference....Professor Levi is to be congratulated on his ingenious development and application of this approach...."--Richard C. Jeffrey, The Journal of Philosophy. (shrink)

The aim of this paper is twofold: (i) to introduce the framework of update semantics and to explain what kind of semantic phenomena may successfully be analysed in it: (ii) to give a detailed analysis of one such phenomenon: default reasoning.

This is a discussion of the problem of extending the basic AGM belief revision theory to iterated belief revision: the problem of formulating rules, not only for revising a basic belief state in response to potential new information, but also for revising one’s revision rules in response to potential new information. The emphasis in the paper is on foundational questions about the nature of and motivation for various constraints, and about the methodology of the evaluation of putative counterexamples to proposed (...) constraints. Some specific constraints that have been proposed are criticized. The paper emphasizes the importance of meta-information—information about one’s sources of information—and argues that little of substance can be said about constraints on iterated belief revision at a level of abstraction that lacks the resources for explicit representation of meta-information. (shrink)

We point out a simple but hitherto ignored link between the theoryof updates, the theory of counterfactuals, and classical modal logic: update is a classicalexistential modality, counterfactual is a classical universalmodality, and the accessibility relations corresponding to these modalities are inverses. The Ramsey Rule (often thought esoteric) is simply an axiomatisation of this inverse relationship. We use this fact to translate between rules for updates andrules for counterfactuals. Thus, Katsuno and Mendelzons postulatesU1--U8 are translated into counterfactual rules C1--C8(Table VII), and (...) many of the familiar counterfactual rulesare translated into rules for updates (Table VIII). Ourconclusions are summarised in Table V. (shrink)

The paper proposes a unified analysis of the natural language connectives 'if', 'if … might', 'even if' (all of them with indicative and subjunctive mood), 'because' and 'though'. They are all interpreted as instances of universal (pro)conditionals, unconditionals, or counterconditionals. The paper imports the notion of relevance into the meaning of conditionals, viewing conditionals as close in meaning to explanations and statements about causal relations. The antecedent of a conditional is interpreted as being relevant for its consequent, thus avoiding the (...) general inference from A and B to 'If A, B'. The analysis is based on different variants of the Ramsey test (among them the 'Strong Ramsey Test') together with a fragment of the belief revision theory of Alchourrón, Gärdenfors and Makinson. (shrink)

In this paper I discuss the foundations of a formal theory of coherent and conservative belief change that is (a) suitable to be used as a method for constructing iterated changes of belief, (b) sensitive to the history of earlier belief changes, and (c) independent of any form of dispositional coherence. I review various ways to conceive the relationship between the beliefs actually held by an agent and her belief change strategies (that also deal with potential belief sets), show the (...) problems they suffer from, and suggest that belief states should be represented by unary revision functions that take sequences of inputs. Three concepts of coherence implicit in current theories of belief change are distinguished: synchronic, diachronic and dispositional coherence. Diachronic coherence is essentially identified with what is known as conservatism in epistemology. The present paper elaborates on the philosophical motivation of the general framework; formal details and results are provided in a companion paper. (shrink)

In this paper it is argued that, in order to solve the problem of iterated belief change, both the belief state and its input should be represented as epistemic entrenchment (EE) relations. A belief revision operation is constructed that updates a given EE relation to a new one in light of an evidential EE relation. It is shown that the operation in question satisfies generalized versions of the Gärdenfors revision postulates. The account offered is motivated by Spohn's ordinal conditionalization functions, (...) and can be seen as the Jeffrization of a proposal considered by Rott. (shrink)

Gärdenfors' impossibility theorem draws attention to certain formal difficulties in defining a conditional connective from a notion of theory revision, via the Ramsey test. We show that these difficulties are not avoided by taking the background inference operation to be non-monotonic.

Counterfactuals is David Lewis' forceful presentation of and sustained argument for a particular view about propositions which express contrary to fact conditionals, including his famous defense of realism about possible worlds and his theory of laws of nature.

We present a way of classifying the logically possible ways out of Gärdenfors' inconsistency or triviality result on belief revision with conditionals. For one of these ways—conditionals which are not descriptive but which only have an inferential role as being given by the Ramsey test—we determine which of the assumptions in three different versions of Gärdenfors' theorem turn out to be false. This is done by constructing ranked models in which such Ramsey-test conditionals are evaluated and which are subject to (...) natural postulates on belief revision and acceptability sets for conditionals. Along the way we show that in contrast with what Gärdenfors himself proposed, there is no dichotomy of the form: either the Ramsey test has to be given up or the Preservation condition. Instead, both of them follow from our postulates. (shrink)

In this paper we present a new modeling for belief revision that is what we term irrevocable. This modeling is of philosophical interest since it captures some features of suppositional reasoning, and of formal interest since it is closely connected with AGM, yet provides for iterated belief revision. The analysis is couched in terms of dynamic doxastic logic.

ABSTRACT We consider in this work the problem of iterated belief revision. We propose a family of belief revision operators called revision with memory operators and we give a logical (both syntactical and semantical) characterization of these operators. They obey what we call the principle of strong primacy of update: when one revises his beliefs by a new evidence, then all possible worlds that satisfy this new evidence become more reliable than those that do not. We show that those operators (...) have a satisfying behaviour concerning the iteration of the revision process. Then we provide four particular operators of this family. (shrink)

The purpose of this note is to formulate some weaker versions of the so called Ramsey test that do not entail the following unacceptable consequenceIf A and C are already accepted in K, then if A, then C is also accepted in K. and to show that these versions still lead to the same triviality result when combined with a preservation criterion.

We show in this paper that the AGM postulates are too weak to ensure the rational preservation of conditional beliefs during belief revision, thus permitting improper responses to sequences of observations. We remedy this weakness by proposing four additional postulates, which are sound relative to a qualitative version of probabilistic conditioning. Contrary to the AGM framework, the proposed postulates characterize belief revision as a process which may depend on elements of an epistemic state that are not necessarily captured by a (...) belief set. We also show that a simple modification to the AGM framework can allow belief revision to be a function of epistemic states. We establish a model-based representation theorem which characterizes the proposed postulates and constrains, in turn, the way in which entrenchment orderings may be transformed under iterated belief revision. (shrink)

According to the Ramsey Test hypothesis the conditional claim that if A then B is credible just in case it is credible that B, on the supposition that A. If true the hypothesis helps explain the way in which we evaluate and use ordinary language conditionals. But impossibility results for the Ramsey Test hypothesis in its various forms suggest that it is untenable. In this paper, I argue that these results do not in fact have this implication, on the grounds (...) that similar results can be proved without recourse to the Ramsey test hypothesis. Instead they show that a number of well entrenched principles of rational belief and belief revision do not apply to conditionals. (shrink)

We describe a model of iterated belief revision that extends the AGM theory of revision to account for the effect of a revision on the conditional beliefs of an agent. In particular, this model ensures that an agent makes as few changes as possible to the conditional component of its belief set. Adopting the Ramsey test, minimal conditional revision provides acceptance conditions for arbitrary right-nested conditionals. We show that problem of determining acceptance of any such nested conditional can be reduced (...) to acceptance tests for unnested conditionals. Thus, iterated revision can be accomplished in a "virtual" manner, using uniterated revision. (shrink)

A study in the logic of theory change, examining the properties of maxichoice contraction and revision operations.

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)

Change, Choice and Inference develops logical theories that are necessary both for the understanding of adaptable human reasoning and for the design of intelligent systems. The book shows that reasoning processes - the drawing on inferences and changing one's beliefs - can be viewed as belonging to the realm of practical reason by embedding logical theories into the broader context of the theory of rational choice. The book unifies lively and significant strands of research in logic, philosophy, economics and artificial (...) intelligence. It elaborates on the relevant theories and provides a mathematically precise foundation for the thesis that large parts of theoretical reason can be subsumed under practical reason. (shrink)

SUGGESTED COURSES Introductory level A (Requires very little background in logic .): 4: -9 - - -7 -2 Introductory level B: -9,:+-+ -,2:+,2: -,3:20+-22+ -7 -2 ...

This book by one of the world's foremost philosophers in the fields of epistemology and logic offers an account of suppositional reasoning relevant to practical deliberation, explanation, prediction and hypothesis testing. Suppositions made 'for the sake of argument' sometimes conflict with our beliefs, and when they do, some beliefs are rejected and others retained. Thanks to such belief contravention, adding content to a supposition can undermine conclusions reached without it. Subversion can also arise because suppositional reasoning is ampliative. These two (...) types of nonmonotonic logic are the focus of this book. A detailed comparison of nonmonotonicity appropriate to both belief contravening and ampliative suppositional reasoning reveals important differences that have been overlooked. (shrink)

This article rebuts Ramsey's earlier theory, in 'Universals of Law and of Fact', of how laws of nature differ from other true generalisations. It argues that our laws are rules we use in judging 'if I meet an F I shall regard it as a G'. This temporal asymmetry is derived from that of cause and effect and used to distinguish what's past as what we can know about without knowing our present intentions.

Using Gärdenfors's notion of epistemic entrenchment, we develop the semantics of a logic which accounts for the following points. It explains why we may generally infer `If ~A then B´ if all we know is AvB while must not generally infer `If ~A then B´ if all we know is {AvB, A}. More generally, it explains the nonmonotonic nature of the consequence relation governing languages which contain conditionals, and it explains how we can deduce conditionals from premise sets without conditionals. (...) Depending on the language at hand, our logic provides different ways of keeping the Ramsey test and getting round the Gärdenfors triviality theorem. I argue that consistent additions of new items of belief are not to be performed by transitions to logical expansions. (shrink)