The fallacy of fallacies

Several of the so-called fallacies in Aristotle are not in fact mistaken inference-types, but mistakes or breaches of rules in the questioning games which were practiced in the Academy and in the Lyceum. Hence the entire Aristotelian theory of fallacies ought to be studied by reference to the author's interrogative model of inquiry, based on his theory of questions and answers, rather than as a part of the theory of inference. Most of the fallacies mentioned by Aristotle can in fact be diagnosed by means of the interrogative model, including petitio principii, multiple questions, babbling, etc., and so can Aristotle's alleged anticipation of the fallacy of argumentum ad hominem. The entire Aristotelian conception of inquiry is an interrogative one. Deductive conclusions caught Aristotle's attention in the form of answers that every rational interlocutor must give, assuming only his own earlier answers. Several features of Aristotle's methodology can be understood by means of the interrogative model, including the role of endoxa in it. Theoretically, there is also considerable leeway as to whether fallacies are conceived of as mistakes in questioning or as breaches of the rules that govern questioning games.     

Conceptual Factors Influence Children's Distributivity Bias

Sentences such as “The girls read a book” can lead to multiple interpretations: They could be reading the same book (collective) or they could each be reading their own book (distributive). In ambiguous contexts, adults prefer the collective interpretation, and preschool children show a slight bias for a distributive interpretation. The current research investigated whether conceptual factors (number of actors) influences interpretations of these kinds of predicates. The data with children show a stronger collective bias when there are four actors compared to two actors. This may be because children are more likely to conceptualize groups of four (vs. two) as sets rather than collections of individuals. These data are discussed with reference to research on visual and conceptual integration abilities, showing that children lag behind in their ability to combine components into a whole in comparison to parsing objects into their component parts.     

Proto-Semantics for Positive Free Logic

This paper presents a bivalent extensional semantics for positive free logic without resorting to the philosophically questionable device of using models endowed with a separate domain of non-existing objects. The models here introduced have only one (possibly empty) domain, and a partial reference function for the singular terms (that might be undefined at some arguments). Such an approach provides a solution to an open problem put forward by Lambert, and can be viewed as supplying a version of parametrized truth non unlike the notion of truth at world found in modal logic. A model theory is developed, establishing compactness, interpolation (implying a strong form of Beth definability), and completeness (with respect to a particular axiomatization).     

On Intermediate Predicate Logics of some Finite Kripke Frames,I. Levelwise Uniform Trees

An intermediate predicate logic L is called finite iff it is characterized by a finite partially ordered set M, i.e., iff L is the logic of the class of all predicate Kripke frames based on M. In this paper we study axiomatizability of logics of this kind. Namely, we consider logics characterized by finite trees M of a certain type (levelwise uniform trees) and establish the finite axiomatizability criterion for this case.     

Algebraic Kripke Sheaf Semantics for Non-Classical Predicate Logics

In so-called Kripke-type models, each sentence is assigned either to true or to false at each possible world. In this setting, every possible world has the two-valued Boolean algebra as the set of truth values. Instead, we take a collection of algebras each of which is attached to a world as the set of truth values at the world, and obtain an extended semantics based on the traditional Kripke-type semantics, which we call here the algebraic Kripke semantics. We introduce algebraic Kripke sheaf semantics for super-intuitionistic and modal predicate logics, and discuss some basic properties. We can state the Gödel-McKinsey-Tarski translation theorem within this semantics. Further, we show new results on super-intuitionistic predicate logics. We prove that there exists a continuum of super-intuitionistic predicate logics each of which has both of the disjunction and existence properties and moreover the same propositional fragment as the intuitionistic logic.     

An Incomplete Relevant Modal Logic

The relevant modal logic G is a simple extension of the logic RT, the relevant counterpart of the familiar classically based system T. Using the Routley–Meyer semantics for relevant modal logics, this paper proves three main results regarding G: (i) G is semantically complete, but only with a non-standard interpretation of necessity. From this, however, other nice properties follow. (ii) With a standard interpretation of necessity, G is semantically incomplete; there is no class of frames that characterizes G. (iii) The class of frames for G characterizes the classically based logic T.     

What's different in second-language processing? Evidence from event-related brain potentials

German sentences which were either correct, contained a selectional restriction violation, or a word category violation were presented auditorily to 16 native speakers of German (L1 group) and to 16 native speakers of Russian, who had learned German after the age of 10 (L2 group). Semantic violations elicited an N400 effect for both groups, but with a reduced amplitude and a longer peak latency in the L2 group. Compared to correct sentences, sentences with a phrase structure violation elicited an early anterior negativity followed by a broad centro-parietal positivity in native speakers. By contrast, there was no differential modulation of the early anterior negativity in the L2 group. A late positivity was also elicited in the second language learners, but it was slightly delayed compared to that shown by native speakers. This pattern is discussed in terms of different degrees of automaticity with respect to the subprocesses involved in sentence comprehension.     

Completeness and Decidability Results for Some Propositional Modal Logics Containing “Actually” Operators

The addition of actually operators to modal languages allows us to capture important inferential behaviours which cannot be adequately captured in logics formulated in simpler languages. Previous work on modal logics containing actually operators has concentrated entirely upon extensions of KT5 and has employed a particular model-theoretic treatment of them. This paper proves completeness and decidability results for a range of normal and nonnormal but quasi-normal propositional modal logics containing actually operators, the weakest of which are conservative extensions of K, using a novel generalisation of the standard semantics.