How Hume’s Philosophy Informed Radical Behaviorism

The present paper analyzes consistencies between the philosophical systems of David Hume and B. F. Skinner, focusing on their conceptualization of causality and attitudes about scientific behavior. The ideas that Hume initially advanced were further developed in Skinner’s writings and shaped the behavior-analytic approach to scientific behavior. Tracing Skinner’s logical antecedents allows for additional historical and philosophical clarity when examining the development of radical behaviorism.     

The Idea of an Exact Number: Children's Understanding of Cardinality and Equinumerosity

Understanding what numbers are means knowing several things. It means knowing how counting relates to numbers (called the cardinal principle or cardinality); it means knowing that each number is generated by adding one to the previous number (called the successor function or succession), and it means knowing that all and only sets whose members can be placed in one‐to‐one correspondence have the same number of items (called exact equality or equinumerosity). A previous study (Sarnecka & Carey, 2008) linked children's understanding of cardinality to their understanding of succession for the numbers five and six. This study investigates the link between cardinality and equinumerosity for these numbers, finding that children either understand both cardinality and equinumerosity or they understand neither. This suggests that cardinality and equinumerosity (along with succession) are interrelated facets of the concepts five and six, the acquisition of which is an important conceptual achievement of early childhood.     

An observation on Carnapʼs Continuum and stochastic independencies

We characterize those identities and independencies which hold for all probability functions on a unary language satisfying the Principle of Atom Exchangeability. We then show that if this is strengthen to the requirement that Johnson?s Sufficientness Principle holds, thus giving Carnap?s Continuum of inductive methods for languages with at least two predicates, then new and somewhat inexplicable identities and independencies emerge, the latter even in the case of Carnap?s Continuum for the language with just a single predicate.     

How preview space/time translates into preview cost/benefit for fixation durations during reading

Eye-movement control during reading depends on foveal and parafoveal information. If the parafoveal preview of the next word is suppressed, reading is less efficient. A linear mixed model (LMM) reanalysis of McDonald (2006) confirmed his observation that preview benefit may be limited to parafoveal words that have been selected as the saccade target. Going beyond the original analyses, in the same LMM, we examined how the preview effect (i.e., the difference in single-fixation duration, SFD, between random-letter and identical preview) depends on the gaze duration on the pretarget word and on the amplitude of the saccade moving the eye onto the target word. There were two key results: (a) The shorter the saccade amplitude (i.e., the larger preview space), the shorter a subsequent SFD with an identical preview; this association was not observed with a random-letter preview. (b) However, the longer the gaze duration on the pretarget word, the longer the subsequent SFD on the target, with the difference between random-letter string and identical previews increasing with preview time. A third pattern—increasing cost of a random-letter string in the parafovea associated with shorter saccade amplitudes—was observed for target gaze durations. Thus, LMMs revealed that preview effects, which are typically summarized under “preview benefit”, are a complex mixture of preview cost and preview benefit and vary with preview space and preview time. The consequence for reading is that parafoveal preview may not only facilitate, but also interfere with lexical access.     

纵向数据分析方法

纵向研究方法是心理学研究领域的一种重要方法。近年来,国外在纵向研究数据分析方法上取得了一系列理论和应用上的进展。章对此方法进行了简要的回顾,并重点阐述了最近发展起来的纵向研究的方法：多层线性模型和潜变量增长曲线模型,并在此基础上对几种常用的方法进行了比较。     

Behaviorism and Society

A probable list of causes for the limited acceptance of behaviorism in our society is identified. This is followed by a summary review of the proposed solutions identified in other papers in this special issue of The Behavior Analyst, most of which relate to either better marketing of either the behavior analytic process or the results achieved as a consequence. One paper proposes a more broad conception of behavior analysis. This paper endorses the solutions identified in previous papers and then goes on to propose an even more broad conception of behavior analysis and makes the point that behavior analysis is unlikely to flourish unless behavior analysts understand a good deal more about the cultural and other contextual features of the environments in which they work.     

Rule-based schema matching for ontology-based mediators

Mediating heterogeneous data sources heavily relies on explicit domain knowledge expressed, for example, as ontologies and mapping rules. We discuss the use of logic representations for mapping schema elements onto concepts expressed in a simplified ontology for cultural assets. Starting with a logic representation of the ontology, criteria for a rule-based schema matching are exemplified. Special requirements are the handling of uncertain information and the processing of hierarchical XML structures representing instances.     

Epistemology and artificial intelligence

In this essay we advance the view that analytical epistemology and artificial intelligence are complementary disciplines. Both fields study epistemic relations, but whereas artificial intelligence approaches this subject from the perspective of understanding formal and computational properties of frameworks purporting to model some epistemic relation or other, traditional epistemology approaches the subject from the perspective of understanding the properties of epistemic relations in terms of their conceptual properties. We argue that these two practices should not be conducted in isolation. We illustrate this point by discussing how to represent a class of inference forms found in standard inferential statistics. This class of inference forms is interesting because its members share two properties that are common to epistemic relations, namely defeasibility and paraconsistency. Our modeling of standard inferential statistical arguments exploits results from both logical artificial intelligence and analytical epistemology. We remark how our approach to this modeling problem may be generalized to an interdisciplinary approach to the study of epistemic relations.     

Logic programs and connectionist networks

One facet of the question of integration of Logic and Connectionist Systems, and how these can complement each other, concerns the points of contact, in terms of semantics, between neural networks and logic programs. In this paper, we show that certain semantic operators for propositional logic programs can be computed by feedforward connectionist networks, and that the same semantic operators for first-order normal logic programs can be approximated by feedforward connectionist networks. Turning the networks into recurrent ones allows one also to approximate the models associated with the semantic operators. Our methods depend on a well-known theorem of Funahashi, and necessitate the study of when Funahashi's theorem can be applied, and also the study of what means of approximation are appropriate and significant.     

Proof theory and mathematical meaning of paraconsistent C-systems

A proof-theoretic analysis and new arithmetical semantics are proposed for some paraconsistent C-systems, which are a relevant sub-class of Logics of Formal Inconsistency (LFIs) introduced by W.A. Carnielli et al. (2002, 2005) [8] and [9]. The sequent versions BC, CI, CIL of the systems bC, Ci, Cil presented in Carnielli et al. (2002, 2005) [8] and [9] are introduced and examined. BC, CI, CIL admit the cut-elimination property and, in general, a weakened sub-formula property. Moreover, a formal notion of constructive paraconsistent system is given, and the constructivity of CI is proven. Further possible developments of proof theory and provability logic of CI-based arithmetical systems are sketched, and a possible weakened Hilbert?s program is discussed. As to the semantical aspects, arithmetical semantics interprets C-system formulas into Provability Logic sentences of classical Arithmetic PA (Artemov and Beklemishev (2004) [2], Japaridze and de Jongh (1998) [19], Gentilini (1999) [15], Smorynski (1991) [22]): thus, it links the notion of truth to the notion of provability inside a classical environment. It makes true infinitely many contradictions B∧¬B and falsifies many arbitrarily complex instances of non-contradiction principle ¬(A∧¬A). Moreover, arithmetical models falsify both classical logic LK and intuitionistic logic LJ, so that a kind of metalogical completeness property of LFI-paraconsistent logic w.r.t. arithmetical semantics is proven. As a work in progress, the possibility to interpret CI-based paraconsistent Arithmetic PACI into Provability Logic of classical Arithmetic PA is discussed, showing the role that PACIarithmetical models could have in establishing new meta-mathematical properties, e.g. in breaking classical equivalences between consistency statements and reflection principles.