TL;DR: It is easily shown that quasi-normal extensions of S 5 preserve the rules of replacement, adjunction, and detachment under strict implication and to describe a simple class of characteristic matrices for S 5.
Abstract: Dugundji has proved that none of the Lewis systems of modal logic, S1 through S5, has a finite characteristic matrix. The question arises whether there exist proper extensions of S5 which have no finite characteristic matrix. By an extension of a sentential calculus S, we usually refer to any system S′ such that every formula provable in S is provable in S′. An extension S′ of S is called proper if it is not identical with S. The answer to the question is trivially affirmative in case we make no additional restrictions on the class of extensions. Thus the extension of S5 obtained by adding to the provable formulas the additional formula p has no finite characteristic matrix (indeed, it has no characteristic matrix at all), but this extension is not closed under substitution—the formula q is not provable in it. McKinsey and Tarski have defined normal extensions of S4* by imposing three conditions. Normal extensions must be closed under substitution, must preserve the rule of detachment under material implication, and must also preserve the rule that if α is provable then ~◊~α is provable. McKinsey and Tarski also gave an example of an extension of S4 which satisfies the first two of these conditions but not the third. One of the results of this paper is that every extension of S5 which satisfies the first two of these conditions also satisfies the third, and hence the above definition of normal extension is redundant for S5. We shall therefore limit the extensions discussed in this paper to those which are closed under substitution and which preserve the rule of detachment under material implication. These extensions we shall call quasi-normal. The class of quasi-normal extensions of S5 is a very broad class and actually includes all extensions which are likely to prove interesting. It is easily shown that quasi-normal extensions of S5 preserve the rules of replacement, adjunction, and detachment under strict implication. It is the purpose of this paper to prove that every proper quasi-normal extension of S5 has a finite characteristic matrix and that every quasi-normal extension of S5 is a normal extension of S5 and to describe a simple class of characteristic matrices for S5.
TL;DR: In this article, an experiment was performed to determine whether there would be a difference in insight between an inferential problem expressed in a symbolic and in a realistic form, and the results showed that the crucial underlying variables in the realistic condition may be revealed by manipulating those variables in concrete material which affect insight.
Abstract: An experiment was performed to determine whether there would be a difference in insight between an inferential problem expressed in a symbolic and in a realistic form. The task consisted of the selection of cards which, if turned over, could violate a given rule. The logical relation which the rule expressed was that of material implication, presented in four different linguistic forms. In addition, the rule expressed either an arbitrary relation between symbols, or a realistic relation between supposed states of affairs. There was a large difference between the symbolic condition and realistic condition: only 7 out of 24 subjects made the correct response in the symbolic condition, whereas 18 of them did so in the realistic condition. There was an interaction between the linguistic form of the rule and the mode of presentation of the problem, and a different error pattern for different linguistic forms. It is argued that the crucial underlying variables in the realistic condition may be revealed by manipulating those variables in concrete material which affect insight.
TL;DR: In this paper, a comparative model fitting exercise is presented that shows that a conditional probability model can explain as much of the data on abstract indicative conditional reasoning tasks as psychological theories that supplement material implication with various rationally unjustified processing assumptions, and when people are asked to solve laboratory reasoning tasks, they can be seen as simply generalising their everyday probabilistic reasoning strategies to this novel context.
Abstract: This paper addresses the apparent mismatch between the normative and descriptive literatures in the cognitive science of conditional reasoning. Descriptive psychological theories still regard material implication as the normative theory of the conditional. However, over the last 20 years in the philosophy of language and logic the idea that material implication can account for everyday indicative conditionals has been subject to severe criticism. The majority view is now apparently in favour of a subjective conditional probability interpretation. A comparative model fitting exercise is presented that shows that a conditional probability model can explain as much of the data on abstract indicative conditional reasoning tasks as psychological theories that supplement material implication with various rationally unjustified processing assumptions. Consequently, when people are asked to solve laboratory reasoning tasks, they can be seen as simply generalising their everyday probabilistic reasoning strategies to this novel context.