Learned irrelevance and associative learning is attenuated in individuals at risk for psychosis but not in asymptomatic first-degree relatives of schizophrenia patients: translational state markers of psychosis?

Learned irrelevance (LIrr) refers to a form of selective learning that develops as a result of prior noncorrelated exposures of the predicted and predictor stimuli. In learning situations that depend on the associative link between the predicted and predictor stimuli, LIrr is expressed as a retardation of learning. It represents a form of modulation of learning by selective attention. Given the relevance of selective attention impairment to both positive and cognitive schizophrenia symptoms, the question remains whether LIrr impairment represents a state (relating to symptom manifestation) or trait (relating to schizophrenia endophenotypes) marker of human psychosis. We examined this by evaluating the expression of LIrr in an associative learning paradigm in (1) asymptomatic first-degree relatives of schizophrenia patients (SZ-relatives) and in (2) individuals exhibiting prodromal signs of psychosis ("ultrahigh risk" [UHR] patients) in each case relative to demographically matched healthy control subjects. There was no evidence for aberrant LIrr in SZ-relatives, but LIrr as well as associative learning were attenuated in UHR patients. It is concluded that LIrr deficiency in conjunction with a learning impairment might be a useful state marker predictive of psychotic state but a relatively weak link to a potential schizophrenia endophenotype.

Computer algebra for x-ray spectral reconstruction between 6 and 25 MV

A previously presented algorithm for the reconstruction of bremsstrahlung spectra from transmission data has been implemented into MATHEMATICA. Spectra vectorial algebra has been used to solve the matrix system A * F = T. The new implementation has been tested by reconstructing photon spectra from transmission data acquired in narrow beam conditions, for nominal energies of 6, 15, and 25 MV. The results were in excellent agreement with the original calculations. Our implementation has the advantage to be based on a well-tested mathematical kernel. Furthermore it offers a comfortable user interface.

Associative processing and paranormal belief

In the present study we introduce a novel task for the quantitative assessment of both originality and speed of individual associations. This 'BAG' (Bridge-the-Associative-Gap) task was used to investigate the relationships between creativity and paranormal belief. Twelve strong 'believers' and 12 strong 'skeptics' in paranormal phenomena were selected from a large student population (n > 350). Subjects were asked to produce single-word associations to word pairs. In 40 trials the two stimulus words were semantically indirectly related and in 40 other trials the words were semantically unrelated. Separately for these two stimulus types, response commonalities and association latencies were calculated. The main finding was that for unrelated stimuli, believers produced associations that were more original (had a lower frequency of occurrence in the group as a whole) than those of the skeptics. For the interpretation of the result we propose a model of association behavior that captures both 'positive' psychological aspects (i.e., verbal creativity) and 'negative' aspects (susceptibility to unfounded inferences), and outline its relevance for psychiatry. This model suggests that believers adopt a looser response criterion than skeptics when confronted with 'semantic noise'. Such a signal detection view of the presence/absence of judgments for loose semantic relations may help to elucidate the commonalities between creative thinking, paranormal belief and delusional ideation.

A feasible theory of truth over combinatory algebra

We define an applicative theory of truth TPT which proves totality exactly for the polynomial time computable functions. TPT has natural and simple axioms since nearly all its truth axioms are standard for truth theories over an applicative framework. The only exception is the axiom dealing with the word predicate. The truth predicate can only reflect elementhood in the words for terms that have smaller length than a given word. This makes it possible to achieve the very low proof-theoretic strength. Truth induction can be allowed without any constraints. For these reasons the system TPT has the high expressive power one expects from truth theories. It allows embeddings of feasible systems of explicit mathematics and bounded arithmetic. The proof that the theory TPT is feasible is not easy. It is not possible to apply a standard realisation approach. For this reason we develop a new realisation approach whose realisation functions work on directed acyclic graphs. In this way, we can express and manipulate realisation information more efficiently.

Algebra of Classical Theoretical Term Reductions in the Sciences

An elementary algebra identifies conceptual and corresponding applicational limitations in John Kemeny and Paul Oppenheim’s (K-O) 1956 model of theoretical reduction in the sciences. The K-O model was once widely accepted, at least in spirit, but seems afterward to have been discredited, or in any event superceeded. Today, the K-O reduction model is seldom mentioned, except to clarify when a reduction in the Kemeny-Oppenheim sense is not intended. The present essay takes a fresh look at the basic mathematics of K-O comparative vocabulary theoretical term reductions, from historical and philosophical standpoints, as a contribution to the history of the philosophy of science. The K-O theoretical reduction model qualifies a theory replacement as a successful reduction when preconditions of explanatory adequacy and comparable systematicization are met, and there occur fewer numbers of theoretical terms identified as replicable syntax types in the most economical statement of a theory’s putative propositional truths, as compared with the theoretical term count for the theory it replaces. The challenge to the historical model developed here, to help explain its scope and limitations, involves the potential for equivocal theoretical meanings of multiple theoretical term tokens of the same syntactical type.

Enhanced associative memory for colour (but not shape or location) in synaesthesia

People with grapheme-colour synaesthesia have been shown to have enhanced memory on a range of tasks using both stimuli that induce synaesthesia (e.g. words) and, more surprisingly, stimuli that do not (e.g. certain abstract visual stimuli). This study examines the latter by using multi-featured stimuli consisting of shape, colour and location conjunctions (e.g. shape A + colour A + location A; shape B + colour B + location B) presented in a recognition memory paradigm. This enables distractor items to be created in which one of these features is ‘unbound’ with respect to the others (e.g. shape A + colour B + location A; shape A + colour A + location C). Synaesthetes had higher recognition rates suggesting an enhanced ability to bind certain visual features together into memory. Importantly, synaesthetes’ false alarm rates were lower only when colour was the unbound feature, not shape or location. We suggest that synaesthetes are “colour experts” and that enhanced perception can lead to enhanced memory in very specific ways; but, not for instance, an enhanced ability to form associations per se. The results support contemporary models that propose a continuum between perception and memory.