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)

Presenting the first comprehensive, in-depth study of hyperintensionality, this book equips readers with the basic tools needed to appreciate some of current and future debates in the philosophy of language, semantics, and metaphysics. After introducing and explaining the major approaches to hyperintensionality found in the literature, the book tackles its systematic connections to normativity and offers some contributions to the current debates. The book offers undergraduate and graduate students an essential introduction to the topic, while also helping professionals in related (...) fields get up to speed on open research-level problems. (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)

We introduce a new operator, called rational evaluation, in belief change. The operator evaluates new information according to the agent’s core beliefs, and then exports the plausible part of the new information. It belongs to the decision module in belief change. We characterize rational evaluation by axiomatic postulates and propose two functional constructions for it, based on the well-known constructions of kernel sets and remainder sets, respectively. The main results of the paper are two representation theorems with respect to the (...) two functional constructions. We also compare and connect the evaluation operator with some related operators in belief revision, including contraction, set contraction, and prioritized multiple revision. (shrink)

The author criticizes Kelsen's distinction between static and dynamic systems of norms and his theory of legal dynamics. The author moreover presents the institutionalist conception of legal dynamics. Kelsen's concept of static systems is incompatible with normological scepticism: The deduction of rules from a basic principle depends on additional premises; even in static systems there is a kind of dynamics produced by actual facts. Kelsen's conception of legal dynamics is also incompatible with normological scepticism and with Kelsen's demand of purity (...) of jurisprudence. In the institutionalist conception Iegal dynamics is rather conceived as an interplay of legal norms and facts. Empowering relations, the principle of co‐validity, temporal limits of norms, derogation, legal validity and the basic norm are analysed accordingly. Appendices deal with Paulson's empowering theory of legal norm and Lippold's double‐faced reconstruction of the legal order. (shrink)

This paper presents a belief revision operator that considers time intervals for modelling norm change in the law. This approach relates techniques from belief revision formalisms and time intervals with temporalised rules for legal systems. Our goal is to formalise a temporalised belief base and corresponding timed derivation, together with a proper revision operator. This operator may remove rules when needed or adapt intervals of time when contradictory norms are added in the system. For the operator, both constructive definition and (...) an axiomatic characterisation by representation theorems are given. (shrink)

Philosophers like G.H. von Wright and D. Makinson have pointed to serious challenges regarding the foundations of deontic logic. In this paper, I suggest that to deal successfully with these challenges a reconsideration of the research program of the discipline is useful. Some problems that have troubled this particular field of logical study for decades may disappear or appear more tractable if we view them from the perspective of a language game introduced by D. Lewis involving three characters: the Master, (...) the Slave and the Kibitzer. The adoption of this perspective opens a natural approach to a new layout of the domain of deontic studies. I propose dividing deontic logic into six sub-areas which are distinguished by their focus on the different idioms typical of the individual players, by conceiving the language game as either being static or as dynamic and by the aims of the logical inquiry. What kind of insights the proposed perspective provides is illustrated by an analysis of the so-called Ross paradox—a problem that has troubled deontic logic since its origins and, though it was many times pronounced solved, still keeps coming back ‘alive and kicking’. (shrink)

This paper generalises classical revision theory of the AGM brand to sets of norms. This is achieved substituting input/output logic for classical logic and tracking the changes. Operations of derogation and amendment—analogues of contraction and revision—are defined and characterised, and the precise relationship between contraction and derogation, on the one hand, and derogation and amendment on the other, is established. It is argued that the notion of derogation, in particular, is a very important analytical tool, and that even core deontic (...) concepts such as that of permission resists a satisfactory analysis without it. By way of illustration the last section of the paper analyses the much debated concept of positive permission, of which there turns out to be more than one kind. (shrink)

The paper is motivated by the need of accounting for the practical syllogism as a piece of defeasible reasoning. To meet the need, the paper first refers to ranking theory as an account of defeasible descriptive reasoning. It then argues that two kinds of ought need to be distinguished, purely normative and fact-regarding obligations. It continues arguing that both kinds of ought can be iteratively revised and should hence be represented by ranking functions, too, just as iteratively revisable beliefs. Its (...) central proposal will then be that the fact-regarding normative ranking function must be conceived as the sum of a purely normative ranking function and an epistemic ranking function. The distinctions defends this proposal with a comparative discussion of some critical examples and some other distinctions made in the literature. It gives a more rigorous justification of this proposal. Finally, it starts developing the logic of purely normative and of fact-regarding normative defeasible reasoning, points to the difficulties of completing the logic of the fact-regarding side, but reaches the initial aim of accounting for the defeasible nature of the practical syllogism. (shrink)

The paper is motivated by the need of accounting for the practical syllogism as a piece of defeasible reasoning. To meet the need, the paper first refers to ranking theory as an account of defeasible descriptive reasoning. It then argues that two kinds of ought need to be distinguished, purely normative and fact-regarding obligations (in analogy to intrinsic and extrinsic utilities). It continues arguing that both kinds of ought can be iteratively revised and should hence be represented by ranking functions, (...) too, just as iteratively revisable beliefs. Its central proposal will then be that the fact-regarding normative ranking function must be conceived as the sum of a purely normative ranking function and an epistemic ranking function (as suggested in qualitative decision theory). The distinctions defends this proposal with a comparative discussion of some critical examples and some other distinctions made in the literature. It gives a more rigorous justification of this proposal. Finally, it starts developing the logic of purely normative and of fact-regarding normative defeasible reasoning, points to the difficulties of completing the logic of the fact-regarding side, but reaches the initial aim of accounting for the defeasible nature of the practical syllogism. (shrink)

I come to grips with the deontological critique of constitutional proportionality that asserts that this doctrine ignores rights and slips into the utilitarian maximisation of societal interests. I...

According to the Ramsey Test, conditionals reflect changes of beliefs: α > β is accepted in a belief state iff β is accepted in the minimal revision of it that is necessary to accommodate α. Since Gärdenfors’s seminal paper of 1986, a series of impossibility theorems (“triviality theorems”) has seemed to show that the Ramsey test is not a viable analysis of conditionals if it is combined with AGM-type belief revision models. I argue that it is possible to endorse that (...) Ramsey test for conditionals while staying true to the spirit of AGM. A main focus lies on AGM’s condition of Preservation according to which the original belief set should be fully retained after a revision by information that is consistent with it. I use concrete representations of belief states and (iterated) revisions of belief states as semantic models for (nested) conditionals. Among the four most natural qualitative models for iterated belief change, two are identified that indeed allow us to combine the Ramsey test with Preservation in the language containing only flat conditionals of the form α > β. It is shown, however, that Preservation for this simple language enforces a violation of Preservation for nested conditionals of the form α > (β > γ). In such languages, no two belief sets are ordered by strict subset inclusion. I argue that it has been wrong right from the start to expect that Preservation holds in languages containing nested conditionals. (shrink)

In the logic of theory change, the standard model is AGM, proposed by Alchourrón et al. (J Symb Log 50:510–530, 1985 ). This paper focuses on the extension of AGM that accounts for contractions of a theory by a set of sentences instead of only by a single sentence. Hansson (Theoria 55:114–132, 1989 ), Fuhrmann and Hansson (J Logic Lang Inf 3:39–74, 1994 ) generalized Partial Meet Contraction to the case of contractions by (possibly non-singleton) sets of sentences. In this (...) paper we present the possible worlds semantics for partial meet multiple contractions. (shrink)

The paper surveys some recent work on formal aspects of the logic of theory change. It begins with a general discussion of the intuitive processes of contraction and revision of a theory, and of differing strategies for their formal study. Specific work is then described, notably Gärdenfors'' postulates for contraction and revision, maxichoice contraction and revision functions and the condition of orderliness, partial meet contraction and revision functions and the condition of relationality, and finally the operations of safe contraction and (...) revision. Verifications and proofs are omitted, with references given to the literature, but definitions and principal results are presented with rigour, along with discussion of their significance. (shrink)

The paper surveys some recent work on formal aspects of the logic of theory change. It begins with a general discussion of the intuitive processes of contraction and revision of a theory, and of differing strategies for their formal study. Specific work is then described, notably Gärdenfors' postulates for contraction and revision, maxichoice contraction and revision functions and the condition of orderliness, partial meet contraction and revision functions and the condition of relationality, and finally the operations of safe contraction and (...) revision. Verifications and proofs are omitted, with references given to the literature but definitions and principal results are presented with rigour along with discussion of their significance. (shrink)

The remainder equations were introduced by S. O. Hansson. In this paper, we will give an exhaustive characterization of the set of solutions for remainder equations. Moreover, solutions to some unsolved problems proposed by Hansson are reported.

It was shown that finite P-recovery holds for partial meet package contraction in Furhmann and Hansson (1994). However, it is not known if recovery holds for partial meet package contraction in the infinite case. In this paper, I show that recovery does not hold for partial meet package contraction in the infinite case.

The remainder set A⟂B of a set of sentences A modulo a set of sentences B is the set of all maximal subsets of A not implying any element of B. A remainder equation is an expression containing remainder sets, such as {A} = B⟂X, in which at least one set is unknown. Solutions to some classes of remainder equations are reported, and some unsolved problems are listed.

Specified meet contraction is the operation defined by the identity where ∼ is full meet contraction and f is a sentential selector, a function from sentences to sentences. With suitable conditions on the sentential selector, specified meet contraction coincides with the partial meet contractions that yield a finite-based contraction outcome if the original belief set is finite-based. In terms of cognitive realism, specified meet contraction has an advantage over partial meet contraction in that the selection mechanism operates on sentences rather (...) than on temporary infinite structures (remainders) that are cognitively inaccessible. Specified meet contraction provides a versatile framework in which other types of contraction, such as severe withdrawal and base-generated contraction, can be expressed with suitably chosen properties of the sentential selector. (shrink)

By replacement is meant an operation that replaces one sentence by another in a belief set. Replacement can be used as a kind of Sheffer stroke for belief change, since contraction, revision, and expansion can all be defined in terms of it. Replacement can also be defined either in terms of contraction or in terms of revision. Close connections are shown to hold between axioms for replacement and axioms for contraction and revision. Partial meet replacement is axiomatically characterized. It is (...) shown that this operation can have outcomes that are not obtainable through either partial meet contraction or partial meet revision. (shrink)

The AGM (Alchourrón-Gärdenfors-Makinson) model of belief change is extended to cover changes on sets of beliefs that are not closed under logical consequence (belief bases). Three major types of change operations, namely contraction, internal revision, and external revision are axiomatically characterized, and their interrelations are studied. In external revision, the Levi identity is reversed in the sense that one first adds the new belief to the belief base, and afterwards contracts its negation. It is argued that external revision represents an (...) intuitively plausible way of revising one's beliefs. Since it typically involves the temporary acceptance of an inconsistent set of beliefs, it can only be used in belief representations that distinguish between different inconsistent sets of belief. (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)

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)

Kernel contraction is a natural nonrelational generalization of safe contraction. All partial meet contractions are kernel contractions, but the converse relationship does not hold. Kernel contraction is axiomatically characterized. It is shown to be better suited than partial meet contraction for formal treatments of iterated belief change.

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)

A model of coherentist belief contraction is constructed. The outcome of belief contraction is required to be one of the coherent subsets of the original belief set, and a set of plausible properties is proposed for this set of coherent subsets. The contraction operators obtained in this way are shown to coincide with well-known belief base operations. This connection between coherentist and "foundationalist" approaches to belief change has important implications for the philosophical interpretation of models of belief change.

A model of coherentist belief contraction is constructed. The outcome of belief contraction is required to be one of the coherent subsets of the original belief set, and a set of plausible properties is proposed for this set of coherent subsets. The contraction operators obtained in this way are shown to coincide with well-known belief base operations. This connection between coherentist and foundationalist approaches to belief change has important implications for the philosophical interpretation of models of belief change.

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)

A possible world semantics for preference is developed. The remainder operator () is used to give precision to the notion that two states of the world are as similar as possible, given a specified difference between them. A general structure is introduced for preference relations between states of affairs, and three types of such preference relations are defined. It is argued that one of them, actual preference, corresponds closely to the concept of preference in informal discourse. Its logical properties are (...) studied and shown to be plausible. (shrink)

Belief Revision addresses the problem of rationally incorporating pieces of new information into an agent’s belief state. In the AGM paradigm, the most used framework in Belief Revision, primacy is given to the new information, which is fully incorporated into the agent’s belief state. However, in real situations, one may want to reject the new information or only accept a part of it. A constructive model called Selective Revision was proposed to meet this need but, as in the AGM framework, (...) focused on belief sets. In this paper we adapt the selective revision operators, that were proposed for belief sets, to the belief base context, obtaining a model in which an agent’s epistemic state is represented by a belief base and that allows the acceptance of only part of the new information. We present several representation theorems for selective base revision operators based on different base revision operators. (shrink)

In this paper, we propose and axiomatically characterize residual contractions, a new kind of contraction operators for belief bases. We establish that the class of partial meet contractions is a strict subclass of the class of residual contractions. We identify an extra condition that may be added to the definition of residual contractions, which is such that the class of residual contractions that satisfy it coincides with the class of partial meet contractions. We investigate the interrelations in the sense of (...) inclusion among the class of residual contractions and other classes of well known contraction operators for belief bases. (shrink)

The AGM theory of belief contraction is extended tomultiple contraction, i.e. to contraction by a set of sentences rather than by a single sentence. There are two major variants: Inpackage contraction all the sentences must be removed from the belief set, whereas inchoice contraction it is sufficient that at least one of them is removed. Constructions of both types of multiple contraction are offered and axiomatically characterized. Neither package nor choice contraction can in general be reduced to contractions by single (...) sentences; in the finite case choice contraction allows for reduction. (shrink)

This paper makes a contribution to the further development of the game-theoretic analysis of rights. The model presented here differs in several respects from the existing models. First of all, a distinction is made between outcome-oriented and action-oriented rights, a distinction which is closely related to the distinction between active and passive rights. Second, the legal-theoretic notions of negative and positive rights are formally defined. Third, we not only discuss the definition of rights, but also the way rights can be (...) violated. Using the distinction between negative and positive rights on the one hand, and between active and passive rights on the other, four different types of basic rights are distinguished. For each of these rights, the situations in which they can be said to be respected are examined. We thereby distinguish two possible sources of obstruction: by (groups of) individuals, and by law. Finally, the question of the possible realization of rights is examined. Depending on how the problem of the possible mutual incompatibility of rights is addressed, two distinct approaches are examined. It turns out that in both approaches the possible realization of rights crucially depends on characteristics of the 'state of nature'. (shrink)

We propose a new class of multiple contraction operations — the system of spheres-based multiple contractions — which are a generalization of Grove’s system of spheres-based (singleton) contractions to the case of contractions by (possibly non-singleton) sets of sentences. Furthermore, we show that this new class of functions is a subclass of the class of the partial meet multiple contractions.

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)

Suppositions can be introduced in either the indicative or subjunctive mood. The introduction of either type of supposition initiates judgments that may be either qualitative, binary judgments about whether a given proposition is acceptable or quantitative, numerical ones about how acceptable it is. As such, accounts of qualitative/quantitative judgment under indicative/subjunctive supposition have been developed in the literature. We explore these four different types of theories by systematically explicating the relationships canonical representatives of each. Our representative qualitative accounts of indicative (...) and subjunctive supposition are based on the belief change operations provided by AGM revision and KM update respectively; our representative quantitative ones are offered by conditionalization and imaging. This choice is motivated by the familiar approach of understanding supposition as `provisional belief revision' wherein one temporarily treats the supposition as true and forms judgments by making appropriate changes to their other opinions. To compare the numerical judgments recommended by the quantitative theories with the binary ones recommended by the qualitative accounts, we rely on a suitably adapted version of the Lockean thesis. Ultimately, we establish a number of new results that we interpret as vindicating the often-repeated claim that conditionalization is a probabilistic version of revision, while imaging is a probabilistic version of update. (shrink)

We provide a logical analysis of private international law, a rather esoteric, but increasingly important, domain of the law. Private international law addresses overlaps and conflicts between legal systems by distributing cases between the authorities of such systems (jurisdiction) and establishing what rules these authorities have to apply to each case (choice of law). A formal model of the resulting interactions between legal systems is proposed based on modular argumentation. It is argued that this model may also be useful for (...) governing the interactions between heterogeneous agents, belonging to different and differently regulated virtual societies, without recourse to a central regulatory agency. The model also provides for multiple interpretations concerning rules of private international law as well as substantive rules of the different legal systems. (shrink)

To adequately deal with unpredictable and dynamic environments, normative frameworks typically deployed in mechanisms for modifying the norms at runtime are crucial. We present the syntax and operational semantics of programming constructs to facilitate runtime norm modification, allowing a programmer to specify when and how the norms may be changed by external agents or by the normative mechanism. The norms take on the form of conditional obligations and prohibitions, instantiating obligations and prohibitions. We present rule-based constructs for runtime modification of (...) the norms and their instances, and a mechanism for automatically updating the instances when their underlying norms change. Moreover, we investigate a mechanism for avoiding norm conflicts. (shrink)

A single global authority is not sufficient to regulate heterogenous agents in multiagent systems based on distributed architectures, due to idiosyncratic local situations and to the need to regulate new issues as soon as they arise. On the one hand institutions should be structured as normative systems with a hierarchy of authorities able to cope with the dynamics of local situations, but on the other hand higher authorities should be able to delimit the autonomy of lower authorities to issue valid (...) norms. In this paper, we study the interplay of obligations and strong permissions in the context of hierarchies of authorities using input/output logic, because its explicit norm base facilitates reasoning about norm base maintenance, and it covers a variety of conditional obligations and permissions. We combine the logic with constraints, priorities and hierarchies of authorities. In this setting, we observe that Makinson and van der Torre’s notion of prohibition immunity for permissions is no longer sufficient, and we introduce a new notion of permission as exception and a new distinction between static and dynamic norms. We show how strong permissions can dynamically change an institution by adding exceptions to obligations, provide an explicit representation of what is permitted to the subjects of the normative system and allow higher level authorities to limit the power of lower level authorities to change the normative system. (shrink)

This paper aims at comparing and relating belief revision and argumentation as approaches to model reasoning processes. Referring to some prominent literature references in both fields, we will discuss their (implicit or explicit) assumptions on the modeled processes and hence commonalities and differences in the forms of reasoning they are suitable to deal with. The intended contribution is on one hand assessing the (not fully explored yet) relationships between two lively research fields in the broad area of defeasible reasoning and (...) on the other hand pointing out open issues and potential directions for future research. (shrink)