According to the usual way of understanding how true knowledge attribution works, it is not right to attribute knowledge of p to S unless p is true and S is justified in believing p. This assumption seems to hold even if we shun away from the idea that we can give an analysis of knowledge in terms of necessary and sufficient conditions. I want to raise some suspicions on the correctness of this traditional picture. I suggest that justification is not (...) always perceived as a necessary condition for true knowledge attribution, according to our pre-theoretical usage of standard epistemic terms. This is not to say that justification is never seen as an important requirement; sometimes it certainly is. Still, the full-fledged, traditional position on epistemic justification needs to be seriously qualified. Ultimately, I will contend that this result lends support to a rival epistemological standpoint — what we might dub a Moderate Peircean stance on epistemic matters. (shrink)

The paper suggests a way of modeling belief changes within the tradition of formal belief revision theories. The present model extends the scope of traditional proposals, such as AGM, so as to take care of “structural belief changes” – a type of radical shifts that is best illustrated with, but not limited to, instances of scientific discovery; we obtain AGM expansions and contractions as limiting cases. The representation strategy relies on a non-standard use of a semantic machinery. More precisely, the (...) model seeks to correlate knowledge states with interpretations of a given formal language L, in such a way that the epistemic state of an agent at a given time gives rise to a picture of how things could be, if there weren’t anything else to know. Interpretations of L proceed along supervaluational ideas; hence, the model as a whole can be seen as a particular application of supervaluational semantics to epistemic matters. (shrink)

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)

When an agent can not recognize, immediately, the implausible part of new information received, she will usually first expand her belief state by the new information, and then she may encounter some belief conflicts, and find the implausible information based on her criteria to consolidate her belief state. This process indicates a new kind of non-prioritized multiple revision, called metabolic revision. I give some axiomatic postulates for metabolic revision and propose two functional constructions for it, namely kernel metabolic revision and (...) partial meet metabolic revision, with respect to which the representation theorems are proved. I also compare metabolic revision with some related works in the literature, including semi-revision, merging with integrity constraints, evaluation, and evaluative multiple revision. (shrink)

A lightning fast summary of Yablo, Aboutness, cutting many corners in the interests of brevity. The emphasis is on “ways.” Substituting “ways for S to be true” in for “worlds in which S is true” improves a number of philosophical explanations. The subject matter of S is identified with S’s ways of holding in a world, or failing, as the case may be. S contains T iff T is implied by S, and T’s ways of being true are implied by (...) ways for S to be true ; this kind of way-implication is the same as subject matter inclusion. S’s surplus content over T is explained as that portion of the content of S that is not about whether T. Subject matter is cast throughout as a full partner in meaning. (shrink)

Peter G¨ ardenfors proved a theorem purporting to show that it is impossible to adjoin to the AGM -postulates for belief-revision a principle of monotonicity for revisions. The principle of monotonicity in question is implied by the Ramsey test for conditionals. So G¨.

There is a deep tension between logical and probabilistic norms of belief. This article illustrates the normative force that is associated with these frameworks by showing how rather unrestricted belief bases can be improved by undergoing logical and probabilistic reflection. It is argued that probabilistic reasoning accounts for the reliability of the conclusions one can draw from the beliefs. Most importantly, reliability commands us to care for the increasing uncertainty of conjunctions of beliefs. Deductive logic captures the agent's commitment towards (...) all conclusions of her beliefs. In other words, it seems that commitment forces the agent to believe conclusions, which reliability tells her to view with scepticism. This conflict is resolved by arguing that commitment merely forces the agent to find the logical conclusions of her beliefs acceptable, not necessarily to believe them. This demands consistency but no deductive closure. Furthermore, it is shown that by restoring consistency, a straightforward connection between high subjective probability and full belief is undermined. Finally, the article delineates how this approach deals with the lottery paradox and the preface paradox. (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)

I argue that the analysis most capable of systematising our intuitions about coherence as a relation is one according to which a set of beliefs, A, coheres with another set, B, if and only if the set-theoretical union of A and B is a coherent set. The second problem I consider is the role of coherence in epistemic justification. I submit that there are severe problems pertaining to the idea, defended most prominently by Keith Lehrer, that justification amounts to coherence (...) with an acceptance system. Instead I advance a more dynamic approach according to which the problem of justification is the problem of how to merge new information with old coherently, a process which is seen to be closely connected with relational coherence. (shrink)

This paper presents a theory of belief revision that allows people to come tobelieve in contradictions. The AGM theory of belief revision takes revision,in part, to be consistency maintenance. The present theory replacesconsistency with a weaker property called coherence. In addition to herbelief set, we take a set of statements that she rejects. These two sets arecoherent if they do not overlap. On this theory, belief revision maintains coherence.

Formal models of theory contraction entered the philosophicalliterature with the prototype model by Alchourrón, Gärdenfors,and Makinson (Alchourrón et al. 1985). One influential modelinvolves theory contraction with respect to a relation calledepistemic entrenchment which orders the propositions of a theoryaccording to their relative degrees of theoretical importance.Various postulates have been suggested for characterizingepistemic entrenchment formally. I argue here that threesuggested postulates produce inappropriately bizarre results whenapplied to scientific theories. I argue that the postulates callednoncovering, continuing up, and continuing down, implyrespectively that, (...) (i) no scientific law is more epistemicallyentrenched than any of its instances, (ii) two distinct instances ofthe same scientific law must have different degrees of epistemicentrenchment, and (iii) any two scientific laws must have differentdegrees of epistemic entrenchment. I also argue that continuingup and continuing down each lead to incoherency. (shrink)

Five types of constructions are introduced for non-prioritized belief revision, i.e., belief revision in which the input sentence is not always accepted. These constructions include generalizations of entrenchment-based and sphere-based revision. Axiomatic characterizations are provided, and close interconnections are shown to hold between the different constructions.

This paper summarizes and systematizes recent and ongoing work on non-prioritized belief change, i.e., belief revision in which the new information has no special priority due to its novelty.

The most controversial condition that the AGM theory of rational belief change places on belief contraction is the recovery condition. The condition is controversial because of a series of putative counterexamples due (separately) to I. Levi and S. O. Hansson. In this paper we show that the conflicts that Levi and Hansson arrange between AGM contraction and our intuitions about how to give up beliefs are merely apparent. We argue that these conflicts disappear once we attend more closely to the (...) identification of the beliefs contracted away in each counterexample case. Since, on our view, speakers" belief contraction intentions are often more complicated than they may first appear, we are led to develop apparatus for thinking about the communication and identification of those intentions. Our argument refocuses attention on the difficult question of how to apply the AGM theory to particular cases. (shrink)

With each proposition P we associate a set of proposition (a hyperproposition) which determines the order in which one may retreat from accepting P, if one cannot fully hold on to P. We first describe the structure of hyperpropositions. Then we describe two operations on propositions, subtraction and merge, which can be modelled in terms of hyperpropositions. Subtraction is an operation that takes away part of the content of a proposition. Merge is an operation that determines the maximal consistent content (...) of two propositions considered jointly. The merge operation gives rise to an inference relation which is, in a certain sense, optimally paraconsistent. (shrink)

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)

In this article we explore multiple change operators, i.e., operators in which the epistemic input is a set of sentences instead of a single sentence. We propose two types of change: prioritized change, in which the input set is fully accepted, and symmetric change, where both the epistemic state and the epistemic input are equally treated. In both kinds of operators we propose a set of postulates and we present different constructions: kernel changes and partial meet changes.

This work considers the formalisation of the merging process of stratified belief bases, where beliefs are stored in different layers or strata. Their strata are ranked, following a total order, employing the value the agent using the belief base assigns to these beliefs. The agent uses an argumentation mechanism to reason from the belief base and obtain the final inferences. We present two ways of merging stratified belief bases: the first is defined by merging two strata without belief preservation, and (...) the second by merging two strata with belief preservation. For these operators, as layers merge, it is possible that some information has to be deleted from the stratum to maintain consistency. The latter merge operator will be defined as performing their actions so that information removed from the stratum is preserved after the merging by moving it to a stratum containing information perceived as having a lower value and where those beliefs may trigger a new revision, possibly starting a cascading effect. (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)

Starting from the sixties of the past century theory change has become a main concern of philosophy of science. Two of the best known formal accounts of theory change are the post-Popperian theories of verisimilitude (PPV for short) and the AGM theory of belief change (AGM for short). In this paper, we will investigate the conceptual relations between PPV and AGM and, in particular, we will ask whether the AGM rules for theory change are effective means for approaching the truth, (...) i.e., for achieving the cognitive aim of science pointed out by PPV. First, the key ideas of PPV and AGM and their application to a particular kind of propositional theories - the so called "conjunctive propositions" - will be illustrated. Afterwards, we will prove that, as far as conjunctive propositions are concerned, AGM belief change is an effective tool for approaching the truth. (shrink)

This thesis investigates a sort of non-prioritized multiple revision, the operation of making up one's mind, and its generalization, the operation of choice revision. Making up one's mind about a sentence is a belief change that takes the agent to a belief state in which either the sentence or its negation is believed. In choice revision, the input information is represented by a set of sentences, and the agent should make a choice on which sentences to be accepted. Apart from (...) being practically important, these operations are technically interesting since the standard approach of intersecting a set of optimal outcomes is not workable. Paper I provides a construction based on descriptor revision in which the operation of making up one's mind can be modelled in a ``select-direct'' way, which is different from the traditional ``select-and-intersect'' methodology employed in the AGM model. The article shows that this construction is axiomatically characterized with a set of plausible postulates, and investigates the additional postulates that correlate with properties of the construction. Paper II investigates a new modelling for sentential belief revision operations, which is based on a set of relations on sentences named believability relations. It demonstrates that two special kinds of such relations, i.e. H-believability relations and basic believability relations, are faithful alternative models of two typical sentential revision generated from descriptor revision. It also shows that traditional AGM revision operations can be reconstructed from a strengthened variant of the basic believability relation and there exists a close connection between this strengthened believability relation and the standard epistemic entrenchment relation. Paper III studies the constructions of choice revision based on descriptor revision and multiple believability relations, which extends the domain of believability relations from sentences to sets of sentences. It is shown that each of two variants of choice revision based on descriptor revision is axiomatically characterized with a set of plausible postulates, assuming that the object language is finite. Furthermore, without assuming a finite language, it is shown that choice revision constructed from multiple believability relations is axiomatically characterized with the same sets of postulates proposed for choice revision derived from descriptor revision, whenever these relations satisfy certain rationality conditions. Paper IV explores choice revision on belief bases. A generalized version of expansion operation called partial expansion is introduced for developing models of this kind of choice revision. Based on the partial expansion as well as two multiple contraction operations from the literature, two kinds of choice revision operators on belief bases are constructed. This paper proposes several postulates for such two operators and shows that they can be axiomatically characterized by such postulates. Furthermore, it investigates two kinds of making up one's mind operators generated from these two choice revision operators and presents the axiomatic characterizations of them. (shrink)