Normative theories can be useful in developing descriptive theories, as when normative subjective expected utility theory is used to develop descriptive rational choice theory and behavioral game theory. “Ought” questions are also the essence of theories of moral reasoning, a domain of higher mental processing that could not survive without normative considerations.

We investigate a lattice of conditional logics described by a Kripke type semantics, which was suggested by Chellas and Segerberg – Chellas–Segerberg (CS) semantics – plus 30 further principles. We (i) present a non-trivial frame-based completeness result, (ii) a translation procedure which gives one corresponding trivial frame conditions for arbitrary formula schemata, and (iii) non-trivial frame conditions in CS semantics which correspond to the 30 principles.

Normic laws have the form "if A, then normally B." They are omnipresent in everyday life and non-physical 'life' sciences such as biology, psychology, social sciences, and humanities. They differ significantly from ceteris-paribus laws in physics. While several authors have doubted that normic laws are genuine laws at all, others have argued that normic laws express a certain kind of prototypical normality which is independent of statistical majority. This paper presents a foundation for normic laws which is based on generalized (...) evolution theory and explains their omnipresence, lawlikeness, and reliability. It is argued that the fact that normic laws are a product of evolution must establish a systematic connection between prototypical and statistical normality. (shrink)

An assertion of high conditional probability or, more briefly, an HCP assertion is a statement of the type: The conditional probability of B given A is close to one. The goal of this paper is to construct logics of HCP assertions whose conclusions are highly likely to be correct rather than certain to be correct. Such logics would allow useful conclusions to be drawn when the premises are not strong enough to allow conclusions to be reached with certainty. This goal (...) is achieved by taking Adams' (1966) logic, changing its intended application from conditionals to HCP assertions, and then weakening its criterion for entailment. According to the weakened entailment criterion, called the Criterion of Near Surety and which may be loosely interpreted as a Bayesian criterion, a conclusion is entailed if and only if nearly every model of the premises is a model of the conclusion. The resulting logic, called NSL, is nonmonotonic. Entailment in this logic, although not as strict as entailment in Adams' logic, is more strict than entailment in the propositional logic of material conditionals. Next, NSL was modified by requiring that each HCP assertion be scaled; this means that to each HCP assertion was associated a bound on the deviation from 1 of the conditional probability that is the subject of the assertion. Scaling of HCP assertions is useful for breaking entailment deadlocks. For example, it it is known that the conditional probabilities of C given A and of - C given B are both close to one but the bound on the former's deviation from 1 is much smaller than the latter's, then it may be concluded that in all likelihood the conditional probability of C given A ∧ B is close to one. The resulting logic, called NSL-S, is also nonmonotonic. Despite great differences in their definitions of entailment, entailment in NSL is equivalent to Lehmann and Magidor's rational closure and, disregarding minor differences concerning which premise sets are considered consistent, entailment in NSL-S is equivalent to entailment in Goldszmidt and Pearl's System-Z⁺. Bacchus, Grove, Halpern, and Koller proposed two methods of developing a predicate calculus based on the Criterion of Near Surety. In their randomstructures method, which assumed a prior distribution similar to that of NSL, it appears possible to define an entailment relation equivalent to that of NSL. In their random-worlds method, which assumed a prior distribution dramatically different from that of NSL, it is known that the entailment relation is different from that of NSL. (shrink)

Systems of logico-probabilistic reasoning characterize inference from conditional assertions that express high conditional probabilities. In this paper we investigate four prominent LP systems, the systems _O, P_, _Z_, and _QC_. These systems differ in the number of inferences they licence _. LP systems that license more inferences enjoy the possible reward of deriving more true and informative conclusions, but with this possible reward comes the risk of drawing more false or uninformative conclusions. In the first part of the paper, we (...) present the four systems and extend each of them by theorems that allow one to compute almost-tight lower-probability-bounds for the conclusion of an inference, given lower-probability-bounds for its premises. In the second part of the paper, we investigate by means of computer simulations which of the four systems provides the best balance of reward versus risk. Our results suggest that system _Z_ offers the best balance. (shrink)

We discuss O&C's probabilistic approach from a probability logical point of view. Specifically, we comment on subjective probability, the indispensability of logic, the Ramsey test, the consequence relation, human nonmonotonic reasoning, intervals, generalized quantifiers, and rational analysis.

This article presents results from a simulation‐based study of inheritance inference, that is, inference from the typicality of a property among a “base” class to its typicality among a subclass of the class. The study aims to ascertain which kinds of inheritance inferences are reliable, with attention to the dependence of their reliability upon the type of environment in which inferences are made. For example, the study addresses whether inheritance inference is reliable in the case of “exceptional subclasses” (i.e., subclasses (...) that are known to be atypical in some respect) and attends to variations in reliability that result from variations in the entropy level of the environment. A further goal of the study is to show that the reliability of inheritance inference depends crucially on which sorts of base classes are used in making inferences. One approach to inheritance inference treats the extension of any atomic predicate as a suitable base class. A second approach identifies suitable base classes with the cells of a partition (of a preselected size k) of the domain of objects that satisfies the condition of maximizing the similarity of objects that are assigned to the same class. In addition to permitting more inferences, our study shows that the second approach results in inheritance inferences that are far more reliable, particularly in the case of exceptional subclasses. (shrink)

In the first part I argue that normic laws are the phenomenological laws of evolutionary systems. If this is true, then intuitive human reasoning should be fit in reasoning from normic laws. In the second part I show that system P is a tool for reasoning with normic laws which satisfies two important evolutionary standards: it is probabilistically reliable, and it has rules of low complexity. In the third part I finally report results of an experimental study which demonstrate that (...) intuitive human reasoning is in well accord with basic argument patterns of system P. (shrink)

It has not been sufficiently considered in philosophical discussions of ceteris paribus (CP) laws that distinct kinds of CP-laws exist in science with rather different meanings. I distinguish between (1.) comparative CP-laws and (2.) exclusive CP-laws. There exist also mixed CP-laws, which contain a comparative and an exclusive CP-clause. Exclusive CP-laws may be either (2.1) definite, (2.2) indefinite or (2.3) normic. While CP-laws of kind (2.1) and (2.2) exhibit deductivistic behaviour, CP-laws of kind (2.3) require a probabilistic or non-monotonic reconstruction. (...) CP-laws of kind (1) may be both deductivistic or probabilistic. All these kinds of CP-laws have empirical content by which they are testable, except CP-laws of kind (2.2) which are almost vacuous. Typically, CP-laws of kind (1) express invariant correlations, CP-laws of kind (2.1) express closed system laws of physical sciences, and CP-laws of kind (2.3) express normic laws of non-physical sciences based on evolution-theoretic stability properties. (shrink)

We study a probabilistic logic based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence). We examine probabilistic conditional knowledge bases associated with imprecise probability assessments defined on arbitrary families of conditional events. We introduce a notion of conditional interpretation defined directly in terms of precise probability assessments. We also examine a property of strong satisfiability which is related to the notion of toleration well known in default reasoning. In our framework we give more (...) general definitions of the notions of probabilistic consistency and probabilistic entailment of Adams. We also recall a notion of strict p-consistency and some related results. Moreover, we give new proofs of some results obtained in probabilistic default reasoning. Finally, we examine the relationships between conditional probability rankings and the notions of g-coherence and g-coherent entailment. (shrink)

The modifier effect refers to the fact that the perceived likelihood of a property in a noun category is diminished if the noun is modified. For example, “Pigs live on farms” is rated as more likely than “Dirty pigs live on farms.” The modifier effect has been demonstrated in many studies, but the underlying cognitive mechanisms are still unclear. This paper reports two series of experiments that jointly point to the conclusion that the modifier effect is the result of a (...) superposition of three cognitive mechanisms: (a) probabilistically softened default inheritance, (b) pragmatic implicatures due to Gricean relevance assumptions, and (c) inference based on world knowledge. We present evidence that the pragmatic effects operate largely on an unconscious level and that their influence can be reduced by changing the presentation format of the cognitive task. (shrink)

Although I agree with Elqayam & Evans' (E&E's) criticisms of is-ought and ought-is fallacies, I criticize their rejection of normativism on two grounds: (1) Contrary to E&E's assumption, not every normative system of reasoning consists of formal rules. (2) E&E assume that norms of reasoning are grounded on intuition or authority, whereas in contemporary epistemology they have to be justified, primarily by their truth-conduciveness.