Isaac Levi's new book is concerned with how one can justify changing one's beliefs. The discussion is deeply informed by the belief-doubt model advocated by C. S. Peirce and John Dewey, of which the book provides a substantial analysis. Professor Levi then addresses the conceptual framework of potential changes available to an inquirer. A structural approach to propositional attitudes is proposed, which rejects the conventional view that a propositional attitude involves a relation between an agent and either a linguistic entity (...) or some other intentional object such as a proposition or set of possible worlds. The last two chapters offer an account of change in states of full belief understood as changes in commitments rather than changes in performance; one chapter deals with adding new information to a belief state, the other with giving up information. The book builds upon topics discussed in some of Levi's earlier work. It will be of particular interest to discussion theorists, epistemologists, philosophers of science, computer scientists, and cognitive psychologists. (shrink)

Examines the link between nonmonotonic inference relations and theory revision operations, focusing on the correspondence between abstract properties which each may satisfy.

I LAW AND NATURE i. The "Pure" Theory The Pure Theory of Law is a theory of positive law. It is a theory of positive law in general, not of a specific legal ...

Moral Realism is a systematic defence of the idea that there are objective moral standards. Russ Shafer-Landau argues that there are moral principles that are true independently of what anyone, anywhere, happens to think of them. His central thesis, as well as the many novel supporting arguments used to defend it, will spark much controversy among those concerned with the foundations of ethics.

Hans Kelsen is considered by many to be the foremost legal thinker of the twentieth century. During the last decade of his life he was working on what he called a general theory of norms. Published posthumously in 1979 as Allgemeine Theorie der Normen, the book is here translated for the first time into English. Kelsen develops his "pure theory of law" into a "general theory of norms", and analyzes the applicability of logic to norms to offer an original and (...) extreme position which some have called "normative irrationalism". Examining the views of over 200 philosophers and legal theorists on law, morality, and logic, and revising several of his own earlier positions, Kelsen's final work is a mandatory resource for legal and moral philosophers. (shrink)

Imperatives cannot be true or false, so they are shunned by logicians. And yet imperatives can be combined by logical connectives: "kiss me and hug me" is the conjunction of "kiss me" with "hug me". This example may suggest that declarative and imperative logic are isomorphic: just as the conjunction of two declaratives is true exactly if both conjuncts are true, the conjunction of two imperatives is satisfied exactly if both conjuncts are satisfied—what more is there to say? Much more, (...) I argue. "If you love me, kiss me", a conditional imperative, mixes a declarative antecedent ("you love me") with an imperative consequent ("kiss me"); it is satisfied if you love and kiss me, violated if you love but don't kiss me, and avoided if you don't love me. So we need a logic of three -valued imperatives which mixes declaratives with imperatives. I develop such a logic. (shrink)

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)

Deontic logic is an area of logic which investigates normative concepts, systems of norms, and normative reasoning. The word ‘deontic’ is derived from the Greek expression ‘déon’, which means ‘what is binding’ or ‘proper’. Thus, Jeremy Bentham used the word ‘deontology’ for “the science of morality,” and the Austrian philosopher Ernst Mally, who developed in the 1920s a system of the “fundamental principles the logic of ought,” called his theory ‘Deontik’. Normative concepts include the concepts of obligation (ought), permission (may), (...) prohibition (may not), and related notions, such as the concept of right. Systems of deontic logic contain, in addition to the usual sentential connectives and quantifiers, logical constants which represent some of these normative concepts. (shrink)

An graduate level introduction to nonmonotonic reasoning, emphasizing structures and spirit common to different formulations, with exercises.

In this paper we investigate how to represent and reason about legal abrogations and annulments in Defeasible Logic. We examine some options that embed in this setting, and in similar rule-based systems, ideas from belief and base revision. In both cases, our conclusion is negative, which suggests to adopt a different logical model. This model expresses temporal aspects of legal rules, and distinguishes between two main timelines, one internal to a given temporal version of the legal system, and another relative (...) to how the legal system evolves over time. Accordingly, we propose a temporal extension of Defeasible Logic suitable to express this model and to capture abrogation and annulment. We show that the proposed framework overcomes the difficulties discussed in regard to belief and base revision, and is sufficiently flexible to represent many of the subtleties characterizing legal abrogations and annulments. (shrink)

The book generalises earlier theories of belief change to cover all kinds of changes of sets by sets. The principal focus is still on changes of belief sets in response to new evidence, but the formal theory extends to all domains with a closure operation and a preference structure including, for example, systems of action. Contraction is the key notion; all other changes can be defined. Various new applications of the theory are outlined. A sentential version of contraction, subtraction, is (...) proposed as a formal counterpart to 'except'-locutions in natural language. Connections are emphasised with other areas at the interface between philosophical logic and artificial intelligence such as reasoning from default assumptions or from inconsistent premises. A relation of merge inference is proposed as a means of retrieving maximal but nontrivial information from inconsistent premises. Merge inference respects certain anti-Boolean intuitions while avoiding a revision of classical logic. (shrink)

ABSTRACT Inspired by legal reasoning, this paper presents a semantics and proof theory of a system for defeasible argumentation. Arguments are expressed in a logic-programming language with both weak and strong negation, conflicts between arguments are decided with the help of priorities on the rules. An important feature of the system is that these priorities are not fixed, but are themselves defeasibly derived as conclusions within the system. Thus debates on the choice between conflicting arguments can also be modelled. The (...) semantics of the system is given with a fixpoint definition, while its proof theory is stated in dialectical style, where a proof takes the form of a dialogue between a proponent and an opponent of an argument: an argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks. (shrink)

This new edition of Introduction to Lattices and Order presents a radical reorganization and updating, though its primary aim is unchanged. The explosive development of theoretical computer science in recent years has, in particular, influenced the book's evolution: a fresh treatment of fixpoints testifies to this and Galois connections now feature prominently. An early presentation of concept analysis gives both a concrete foundation for the subsequent theory of complete lattices and a glimpse of a methodology for data analysis that is (...) of commercial value in social science. Classroom experience has led to numerous pedagogical improvements and many new exercises have been added. As before, exposure to elementary abstract algebra and the notation of set theory are the only prerequisites, making the book suitable for advanced undergraduates and beginning graduate students. It will also be a valuable resource for anyone who meets ordered structures. (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 is the first book that integrates nonmonotonic reasoning and belief change into a single framework from an artificial intelligence logic point-of-view.

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

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

In a previous paper we developed a general theory of input/output logics. These are operations resembling inference, but where inputs need not be included among outputs, and outputs need not be reusable as inputs. In the present paper we study what happens when they are constrained to render output consistent with input. This is of interest for deontic logic, where it provides a manner of handling contrary-to-duty obligations. Our procedure is to constrain the set of generators of the input/output system, (...) considering only the maximal subsets that do not yield output conflicting with a given input. When inputs are authorised to reappear as outputs, both maxichoice revision in the sense of Alchourr6n/Makinson and the default logic of Poole emerge as special cases, and there is a close relation with Reiter default logic. However, our focus is on the general case where inputs need not be outputs. We show in what contexts the consistency of input with output may be reduced to its consistency with a truth-functional combination of components of generators, and under what conditions constrained output may be obtained by a derivation that is constrained at every step. (shrink)

This is a survey paper. Contents: 1 Introduction -- 2 The representation of belief -- 3 Kinds of belief change -- 4 Coherence constraints for belief revision -- 5 Different modes of belief change -- 6 Two strategies for characterizing rational changes of belief - 6.1 The postulates strategy - 6.2 The constructive strategy -- 7 An abstract view of the elements of belief change -- 8 Iterated changes of belief -- 9 Further developments - 9.1 Variants and extensions of (...) belief revision - 9.2 Updates - 9.3 Default inferences as expectation revision - 9.4 Belief merging -- 10 Concluding remarks. (shrink)

Input/output logics are abstract structures designed to represent conditional obligations and goals. In this paper we use them to study conditional permission. This perspective provides a clear separation of the familiar notion of negative permission from the more elusive one of positive permission. Moreover, it reveals that there are at least two kinds of positive permission. Although indistinguishable in the unconditional case, they are quite different in conditional contexts. One of them, which we call static positive permission, guides the citizen (...) and law enforcement authorities in the assessment of specific actions under current norms, and it behaves like a weakened obligation. Another, which we call dynamic positive permission, guides the legislator. It describes the limits on the prohibitions that may be introduced into a code, and under suitable conditions behaves like a strengthened negative permission. (shrink)

Ross, Alf Loar, Brian, Editor.Directives and Norms. New York: Humanities Press, [1967]. ix, 188 pp. Reprint available April 2009 by The Lawbook Exchange, Ltd. ISBN-13: 978-1-58477-961-2. ISBN-10: 1-58477-961-6. Cloth with dust jacket. $65.00 * Reprint of the first American edition. One of the most interesting jurists of the post-World War II era, Ross [1899-1979] was a legal and moral philosopher, scholar of international law and the leading representative of Scandinavian Legal Realism. This book and On Law and Justice (1958) are (...) his principal works. In Directives and Norms Ross asks whether imperatives (or, to use his term, 'directives') are subject to logic in the same way as indicatives. He shows the difference between indicative and directive discourse and explains the concepts 'directive' and 'norm' as they function in the social sciences, especially in the study of law. A contemporary essay in the Modern Law Review (32:544), though critical of this work, was still impressed by its "clear and convincing account" of these processes. (shrink)

A sentence A is epistemically less entrenched in a belief state K than a sentence B if and only if a person in belief state K who is forced to give up either A or B will give up A and hold on to B. This is the fundamental idea of epistemic entrenchment as introduced by Gärdenfors (1988) and elaborated by Gärdenfors and Makinson (1988). Another distinguishing feature of relations of epistemic entrenchment is that they permit particularly simple and elegant (...) construction recipes for minimal changes of belief states. These relations, however, are required to satisfy rather demanding conditions. In the present paper we liberalize the concept of epistemic entrenchment by removing connectivity, minimality and maximality conditions. Correspondingly, we achieve a liberalization of the concept of rational belief change that does no longer presuppose the postulates of success and rational monotony. We show that the central results of Gärdenfors and Makinson are preserved in our more flexible setting. Moreover, the generalized concept of epistemic entrenchment turns out to be applicable also to relational and iterated belief changes. (shrink)

Describes and discusses the rather special behaviour of one of the postulates in the AGM account of theory change.

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)

The postulate of recovery is commonly regarded to be the intuitively least compelling of the six basic Gärdenfors postulates for belief contraction. We replace recovery by the seemingly much weaker postulate of core-retainment, which ensures that if x is excluded from K when p is contracted, then x plays some role for the fact that K implies p. Surprisingly enough, core-retainment together with four of the other Gärdenfors postulates implies recovery for logically closed belief sets. Reasonable contraction operators without recovery (...) do not seem to be possible for such sets. Instead, however, they can be obtained for non-closed belief bases. Some results on partial meet contractions on belief bases are given, including an axiomatic characterization and a non-vacuous extension of the AGM closure condition. (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)

In a range of contexts, one comes across processes resembling inference, but where input propositions are not in general included among outputs, and the operation is not in any way reversible. Examples arise in contexts of conditional obligations, goals, ideals, preferences, actions, and beliefs. Our purpose is to develop a theory of such input/output operations. Four are singled out: simple-minded, basic (making intelligent use of disjunctive inputs), simple-minded reusable (in which outputs may be recycled as inputs), and basic reusable. They (...) are defined semantically and characterised by derivation rules, as well as in terms of relabeling procedures and modal operators. Their behaviour is studied on both semantic and syntactic levels. (shrink)

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.