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.

Recently, Bengt Hansson presented a paper about dyadic deontic logic,2 criticizing some purely axiomatic systems of dyadic deontic logic and proposing three purely semantical systems of dyadic deontic logic which he confidently called dyadic standard systems of deontic logic (DSDL1–3). Here I shall discuss the third by far most interesting system DSDL3 which is operating with preference relations. First, I shall describe this semantical system (Sections 1.1–1.3). Then I shall give an axiomatic system (Section 1.4) which is proved to be (...) correct (Section 2) and complete (Section 3) with respect to Hansson's semantics. Finally, in face of these results Hansson's semantics will be discussed from a more intuitive standpoint. After emphasizing its intuitive attractiveness (Section 4.1) I will show that two objections often discussed in connection with preference relations do not apply to it (Section 4.2 and 4.3); more precisely, I will show that the connectedness condition for preference relations can be dropped and that, in a sense, it is not necessary to compare two possible worlds differing in infinitely many respects. (What exactly is meant by this, will become clear later on.) Yet there is a third objection to Hansson's semantics which points to a real intuitive inadequacy of DSDL3. A way of removing this inadequacy, which corresponds to Hansson's own intuitions as well as to familiar metaethical views, is suggested, but not technically realized (Section 4.4). In the last section (section 4.5) I shall briefly show that DSDL3 is decidable, as expected. (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)

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)

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)

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)

Hans Kamp; IV*—Free Choice Permission, Proceedings of the Aristotelian Society, Volume 74, Issue 1, 1 June 1974, Pages 57–74, https://doi.org/10.1093/aristoteli.

We extend the monotonic and regular modal logics to the multi-modal cue, and give semantical characterization w.r.t. a semantics of minimal frames. For this we introduce a calculus over neighbourhoods and we obtain simpler conditions than those from the literature.

When a conflict of duties arises, a resolution is often sought by use of an ordering of priority or importance. This paper examines how such a conflict resolution works, compares mechanisms that have been proposed in the literature, and gives preference to one developed by Brewka and Nebel. I distinguish between two cases – that some conflicts may remain unresolved, and that a priority ordering can be determined that resolves all – and provide semantics and axiomatic systems for accordingly defined (...) dyadic deontic operators. (shrink)

This paper provides algorithmic options for belief revision of a database receiving an infinite stream of inputs. At stage , the database is ¡£¢ , receiving the input ¤ ¢ . The revision algorithms for moving to the new database ¡ ¢¦¥¨§© ¡ ¢ ¤ ¢ take into account the history of previous revisions actually executed as well as possible revision options which were discarded at the time but may now be pursued. The appropriate methodology for carrying this out is (...) Labelled Deductive Systems. (shrink)