Naming speed as a predictive diagnostic measure in reading and attentional problems

This study aimed to describe and compare naming speed abilities in children diagnosed with either Reading Learning Difficulties (RLD) or Attention Deficit/Hyperactivity Disorder (ADHD), or comorbidity for both (ADHD+RLD). To examine the explanatory power of naming speed and ADHD symptomatology in predicting group associations (while controlling for gender and age), the “Rapid Automatized Naming and Rapid Alternating Stimulus Tests” (RAN/RAS) were utilized. A sample of 101 children (age range = 5–16 years) was divided into four groups: RLD (n = 14), ADHD (n = 28), comorbid (n = 19), and control (n = 40). There were statistically significant differences in RAN/RAS results among the diagnostic groups. Moreover, discriminant analysis revealed that naming speed tasks significantly predicted reading and attentional problems, especially at earlier ages. These results demonstrate the potential usefulness of RAN/RAS in the diagnosis of reading and attentional problems, particularly if the children are aged from 5 to 9.     

Comparison between two continuous performance tests for identifying ADHD: Traditional vs. virtual realityEjecución continua para la detección del TDAH: pruebas tradicionales frente a la realidad virtual

Background/Objective: Continuous Performance Tests (CPTs) have demonstrated validity when differentiating children with ADHD from healthy controls. However, these CPTs have limitations such as low ecological validity. New CPTs based on the use of Virtual Reality (VR) have appeared as supposedly improved methods for assessing ADHD. This study aims to compare the discriminant value of attentional variables produced by a VR CPT (Aula Nesplora) with that of variables from a traditional CPT (Test of Variables of Attention; TOVA) for identifying ADHD. Method: A total of 338 children aged between 6 and 16 years old (M = 10.84, SD = 3.01) participated in the study: 31.95% correspond to the inattentive presentation, 15.38% to the impulsive-hyperactive presentation, 22.78% to the combined presentation, and the remaining 29.88% correspond to children without ADHD. Results: Results indicated that Aula Nesplora predicts ADHD presentations better than TOVA. It also differentiates better between ADHD and non-ADHD students. Conclusions: These findings show the potential advantages of using virtual reality in ADHD assessment, as it facilitates the diagnosis of ADHD and the differentiation of its presentations in a realistic environment.     

Completeness in Hybrid Type Theory

We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret \(@_i\) in propositional and first-order hybrid logic. This means: interpret \(@_i\alpha _a\) , where \(\alpha _a\) is an expression of any type \(a\) , as an expression of type \(a\) that rigidly returns the value that \(\alpha_a\) receives at the i-world. The axiomatization and completeness proofs are generalizations of those found in propositional and first-order hybrid logic, and (as is usual inhybrid logic) we automatically obtain a wide range of completeness results for stronger logics and languages. Our approach is deliberately low-tech. We don’t, for example, make use of Montague’s intensional type s, or Fitting-style intensional models; we build, as simply as we can, hybrid logicover Henkin’s logic.     

Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)

We present a coinductive definition of models for modal logics and show that it provides a homogeneous framework in which it is possible to include different modal languages ranging from classical modalities to operators from hybrid and memory logics. Moreover, results that had to be proved separately for each different language—but whose proofs were known to be mere routine—now can be proved in a general way. We show, for example, that we can have a unique definition of bisimulation for all these languages, and prove a single invariance-under-bisimulation theorem.We then use the new framework to investigate normal forms for modal logics. The normal form we introduce may have a smaller modal depth than the original formula, and it is inspired by global modalities like the universal modality and the satisfiability operator from hybrid logics. These modalities can be extracted from under the scope of other operators. We provide a general definition of extractable modalities and show how to compute extracted normal forms. As it is the case with other classical normal forms—e.g., the conjunctive normal form of propositional logic—the extracted normal form of a formula can be exponentially bigger than the original formula, if we require the two formulas to be equivalent. If we only require equi-satisfiability, then every modal formula has an extracted normal form which is only polynomially bigger than the original formula, and it can be computed in polynomial time.