Die von Tomasello vertretene naturwissenschaftliche Theorie der durch Kultur vermittelten Entwicklung des Menschen zum sprechenden Wesen scheint positives Wissen da bereitzustellen, wo bisher die begriffliche Arbeit philosophischer Reflexion ihren Ort hatte – etwa bei der Klärung des Verstehens. Die Autoren rekonstruieren die argumentative Grundstruktur dieses Forschungsprogramms und seine Leitmetaphern methodologisch, um seine Erklärungsmächtigkeit und Grenzen zu ermitteln.

Inleiding, gebaseerd op een collegedictaat en een syllabus voor studenten aan de Economische hogeschool te Rotterdam.

Preparing words in speech production is normally a fast and accurate process. We generate them two or three per second in fluent conversation; and overtly naming a clear picture of an object can easily be initiated within 600 msec after picture onset. The underlying process, however, is exceedingly complex. The theory reviewed in this target article analyzes this process as staged and feedforward. After a first stage of conceptual preparation, word generation proceeds through lexical selection, morphological and phonological encoding, phonetic (...) encoding, and articulation itself. In addition, the speaker exerts some degree of output control, by monitoring of self-produced internal and overt speech. The core of the theory, ranging from lexical selection to the initiation of phonetic encoding, is captured in a computational model, called WEAVER++. Both the theory and the computational model have been developed in interaction with reaction time experiments, particularly in picture naming or related word production paradigms, with the aim of accounting for the real-time processing in normal word production. A comprehensive review of theory, model, and experiments is presented. The model can handle some of the main observations in the domain of speech errors (the major empirical domain for most other theories of lexical access), and the theory opens new ways of approaching the cerebral organization of speech production by way of high-temporal-resolution imaging. (shrink)

A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical (...) logic as well as practical applications through the easy to understand and use deductive systems of Semantic Tableaux and Resolution. The chapters on set theory, number theory, combinatorics and graph theory combine the necessary minimum of theory with numerous examples and selected applications. Written in a clear and reader-friendly style, each section ends with an extensive set of exercises, most of them provided with complete solutions which are available in the accompanying solutions manual. Key Features: Suitable for a variety of courses for students in both Mathematics and Computer Science. Extensive, in-depth coverage of classical logic, combined with a solid exposition of a selection of the most important fields of discrete mathematics Concise, clear and uncluttered presentation with numerous examples. Covers some applications including cryptographic systems, discrete probability and network algorithms. Logic and Discrete Mathematics: A Concise Introduction is aimed mainly at undergraduate courses for students in mathematics and computer science, but the book will also be a valuable resource for graduate modules and for self-study. (shrink)

The previously introduced algorithm \sqema\ computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend \sqema\ with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents of modal formulae in the extension of first-order logic with monadic least fixed-points \mffo. This computation operates by transforming input formulae into locally frame equivalent ones in the pure fragment of the hybrid mu-calculus. In particular, we prove that (...) the recursive extension of \sqema\ succeeds on the class of `recursive formulae'. We also show that a certain version of this algorithm guarantees the canonicity of the formulae on which it succeeds. (shrink)

Twaalf inheemse en religieuze leiders uit verschillende werelddelen spreken zich in dit boek uit over de heiligheid van de natuur. Hun eeuwenoude wijsheden inspireren ons om anders te gaan denken over onze omgang met alles wat leeft. Aan het woord komen de Groenlandse sjamaan Angakkorsuaq, de Amerikaanse indianenleider Chief Lane Jr., masaileider Mwarabu, de boeddhistische geestelijke Shih, de dichtende islamgeleerde Ur Rehman Chishti, orthodox rabbijn Slifkin, Maya-priester Sac Coyoy, hindoe-prins Jhala, Aztekenleider Sanchez, leider van de Canadese Bear Clan Wawatie, bisschop (...) Smeets van Roermond en theoloog Valerio van Rochester Cathedral. 0Oeroude natuurwijsheden uit alle streken! (shrink)

Evolutionary psychologists tend to view the mind as a large collection of evolved, functionally specialized mechanisms, or modules. Cosmides and Tooby (1994) have presented four arguments in favor of this model of the mind: the engineering argument, the error argument, the poverty of the stimulus argument, and combinatorial explosion. Fodor (2000) has discussed each of these four arguments and rejected them all. In the present paper, we present and discuss the arguments for and against the massive modularity hypothesis. We conclude (...) that Cosmides and Tooby's arguments have considerable force and are too easily dismissed by Fodor. (shrink)

Zuidema et al. illustrate how empirical AGL studies can benefit from computational models and techniques. Computational models can help clarifying theories, and thus in delineating research questions, but also in facilitating experimental design, stimulus generation, and data analysis. The authors show, with a series of examples, how computational modeling can be integrated with empirical AGL approaches, and how model selection techniques can indicate the most likely model to explain experimental outcomes.

A brief "book note" on James O'Shea's "Wilfrid Sellars".

A review of Lycan's Book "Consciousness".

We provide syntactic necessary and sufficient conditions on the formulae reducible by the second-order quantifier elimination algorithm DLS. It is shown that DLS is compete for all modal Sahlqvist and Inductive formulae, and that all modal formulae in a single propositional variable on which DLS succeeds are canonical.

Universities are occupied by management, a regime obsessed with ‘accountability’ through measurement, increased competition, efficiency, ‘excellence’, and misconceived economic salvation. Given the occupation’s absurd side-effects, we ask ourselves how management has succeeded in taking over our precious universities. An alternative vision for the academic future consists of a public university, more akin to a socially engaged knowledge commons than to a corporation. We suggest some provocative measures to bring about such a university. However, as management seems impervious to cogent arguments, (...) such changes can only happen if academics take action. Hence, we explore several strategies for a renewed university politics. (shrink)

In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions of (...) \SQEMA\ where that syntactic condition is replaced by a semantic one, viz. downward monotonicity. For the first, and most general, extension \SSQEMA\ we prove correctness for a large class of modal formulae containing an extension of the Sahlqvist formulae, defined by replacing polarity with monotonicity. By employing a special modal version of Lyndon's monotonicity theorem and imposing additional requirements on the Ackermann rule we obtain restricted versions of \SSQEMA\ which guarantee canonicity, too. (shrink)

In pluralistic Western societies, schools have a specific task in moral education. This task is to be understood neither as the transmission of specific values, nor as the development of moral reasoning skills or universal values, but as teaching pupils to handle plurality in an autonomous way. The concept of autonomy is interpreted from a Vygotskian and Deweyan position, where learning in school means learning to participate in cultural activities in a reflective and critical way. Participation has both intellectual and (...) moral aspects, and thus moral education can never be separated from cognitive education. (shrink)

In the history of Jewish, Christian and Muslim culture, religious identity was not only formed by historical claims, but also by the usage of certain images: “images of God”, “images of the others”, “images of the self.”This book includes a discussion of the role of these images in society and politics, in theology and liturgy, yesterday and today.

The positive functions of psychosis are examined. It is concluded that psychosis might have following positive and compensating functions: satisfaction of urgent needs that otherwise would remain unsatisfied; avoidance of and coping with unbearable reality, harmful influences and stress, and/or trauma; realization of urgent but otherwise unattainable goal settings; and upgrading of social-emotional and cognitive incapacities into more adequate social-emotional and cognitive awareness and functioning. The therapeutic implications of these findings are also discussed.

Negotiating proves a precarious ability. The development of the arts of compromise and negotiating is not self-evident. Confrontation, flight and direct physical attack prove much more tempting in human history. How did these skills develop? The typical power and dependency network that evolved in western Europe in particular, is a significant factor. Different patterns of emotion management emerged in interaction with changing power balances. These patterns bred the skills of negotiating and compromise.

Two different concepts of distinguishability are often mixed up in attempts to derive in quantum mechanics the (anti)symmetry of the wave function from indistinguishability of identical particles. Some of these attempts are analyzed and shown to be defective. It is argued that, although identical particles should be considered as observationally indistinguishable in (anti)symmetric states, they may be considered to be conceptually distinguishable. These two notions of (in)distinguishability have quite different physical origins, the former one being related to observations while the (...) latter has to do with the preparation of the system. (shrink)

Levelt, reviewing the AGL field from a psycholinguistic perspective, identifies various gaps and makes a number of concrete suggestions for improving several currently used experimental designs. He raises the question whether artificial (and natural) grammar learning is about detecting ‘rules’, as is commonly assumed, or rather the detection of a set of ‘constraints’. He cautions the community to not ignore ‘semantics’, and recommends to consider less artificial tasks, that may be needed for learning more complex rules by human or nonhuman (...) animals. (shrink)

A marxist view on the priority of the function of the stimulation of creativity as compared to the other functions of art 59 2.3.1. ...

Graph-based frames have been introduced as a logical framework which internalises an inherent boundary to knowability (referred to as ‘informational entropy’), due, e.g. to perceptual, evidential or linguistic limits. They also support the interpretation of lattice-based (modal) logics as hyper-constructive logics of evidential reasoning. Conceptually, the present paper proposes graph-based frames as a formal framework suitable for generalising Pawlak's rough set theory to a setting in which inherent limits to knowability exist and need to be considered. Technically, the present paper (...) establishes systematic connections between the first-order correspondents of Sahlqvist modal reduction principles on Kripke frames, and on the more general relational environments of graph-based and polarity-based frames. This work is part of a research line aiming at: (a) comparing and inter-relating the various (first-order) conditions corresponding to a given (modal) axiom in different relational semantics; (b) recognising when first-order sentences in the frame-correspondence languages of different relational structures encode the same ‘modal content’; (c) meaningfully transferring relational properties across different semantic contexts. The present paper develops these results for the graph-based semantics, polarity-based semantics, and all Sahlqvist modal reduction principles. As an application, we study well known modal axioms in rough set theory (such as those corresponding to seriality, reflexivity, and transitivity) on graph-based frames and show that, although these axioms correspond to different first-order conditions on graph-based frames, their intuitive meaning is retained. This allows us to introduce the notion of hyperconstructivist approximation spaces as the subclass of graph-based frames defined by the first-order conditions corresponding to the same modal axioms defining classical generalised approximation spaces, and to transfer the properties and the intuitive understanding of different approximation spaces to the more general framework of graph-based frames. The approach presented in this paper provides a base for systematically comparing and connecting various formal frameworks in rough set theory, and for the transfer of insights across different frameworks. (shrink)