Sven Ove Hansson

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.

In a decision making context, an agent’s uncertainty can be either epistemic, i.e. due to her lack of knowledge, or agentive, i.e. due to her not having made use of her decision-making power. In cases when it is unclear whether or not a decision maker presently has control over her own future actions, it is difficult to determine whether her uncertainty is epistemic or agentive. Such situations are often difficult for the agent to deal with, but from an outsider’s perspective, they can have sensible pragmatic solutions.

The relatively new discipline of risk analysis promises to provide objective guidance in some of the most controversial issues in modern high‐technology societies. Four conditions are discussed that must be satisfied for this promise to be fulfilled. Since none of these conditions is satisfied, risk analysis does not keep its promise. In its attempts to reduce genuinely political issues to technocratic calculations, it neglects many of the factors that should influence decisions on risk acceptance. A list of tentative guidelines is given for numerical decision support that encourages democratic decision‐making instead of trying to evade it.

In order to explore the quantifiability and formalizability of uncertainty a wide range of uncertainties are investigated. They are summarized under eight main categories: factual, possibilistic, metadoxastic, agential, interactive, value, structural, and linguistic uncertainty. This includes both classical uncertainty and the uncertainties commonly called great, deep, or radical. For five of the eight types of uncertainty, both quantitative and non-quantitative formalizations are meaningful and available. For one of them (interactive uncertainty), only non-quantitative formalizations seem to be meaningful, and for two (agential and structural uncertainty) neither quantitative nor non-quantitative formalization seems to be a useful approach.

The technological sciences have at least six defining characteristics that distinguish them from the other sciences. They have human-made rather than natural objects as their study objects, include the practice of engineering design, define their study objects in functional terms, evaluate these study objects with category-specified value statements, employ less far-reaching idealizations than the natural sciences, and do not need an exact mathematical solution when a sufficiently close approximation is available. In combination, the six characteristics are sufficient to show that the technological sciences are neither branches nor applications of the natural sciences, but form a different group of sciences with specific characteristics of their own.Keywords: Technological sciences; Technology; Functional concepts; Idealization; Design.

A descriptor is a set of sentences that are truth-functional combinations of expressions of the form \ , where \ is a metalinguistic belief predicate and p a sentence in the object language in which beliefs are expressed. Descriptor revision ) is an operation of belief change that takes us from a belief set K to a new belief set \ where \ is a descriptor representing the success condition. Previously studied operations of belief change are special cases of descriptor revision, hence sentential revision can be represented as \ , contraction as \ , multiple contraction as \ , replacement as \ , etc. General models of descriptor revision are constructed and axiomatically characterized. The common selection mechanisms of AGM style belief change cannot be used, but they can be replaced by choice functions operating directly on the set of potential outcomes . The restrictions of this construction to sentential revision ) and sentential contraction give rise to operations with plausible properties that are also studied in some some detail

Although it has often been claimed that all the information contained in second-order probabilities can be contained in first-order probabilities, no practical recipe for the elimination of second-order probabilities without loss of information seems to have been presented. Here, such an elimination method is introduced for repeatable events. However, its application comes at the price of losses in cognitive realism. In spite of their technical eliminability, second-order probabilities are useful because they can provide models of important features of the world that are cognitively more plausible than those that can be obtained with single-level probabilities.

Moral theory has mostly focused on idealized situations in which the morally relevant properties of human actions can be known beforehand. Here, a framework is proposed that is intended to sharpen moral intuitions and improve moral argumentation in problems involving risk and uncertainty. Guidelines are proposed for a systematic search of suitable future viewpoints for hypothetical retrospection. In hypothetical retrospection, a decision is evaluated under the assumption that one of the branches of possible future developments has materialized. This evaluation is based on the deliberator’s present values, and each decision is judged in relation to the information available when it was taken. The basic decision rule is to choose an alternative that comes out as morally acceptable (permissible) from all hypothetical retrospections.

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

A new possible world semantics for deontic logic is proposed. Its intuitive basis is that prohibitive predicates (such as "wrong" and "prohibited") have the property of negativity, i.e. that what is worse than something wrong is itself wrong. The logic of prohibitive predicates is built on this property and on preference logic. Prescriptive predicates are defined in terms of prohibitive predicates, according to the wellknown formula "ought" = "wrong that not". In this preference-based deontic logic (PDL), those theorems that give rise to the paradoxes of standard deontic logic (SDL) are not obtained. (E.g., O(p & q) → Op & Oq and Op → O(p v q)) are theorems of SDL but not of PDL.) The more plausible theorems of SDL, however, can be derived in PDL