Should metacognition be measured by logistic regression?

Are logistic regression slopes suitable to quantify metacognitive sensitivity, i.e. the efficiency with which subjective reports differentiate between correct and incorrect task responses? We analytically show that logistic regression slopes are independent from rating criteria in one specific model of metacognition, which assumes (i) that rating decisions are based on sensory evidence generated independently of the sensory evidence used for primary task responses and (ii) that the distributions of evidence are logistic. Given a hierarchical model of metacognition, logistic regression slopes depend on rating criteria. According to all considered models, regression slopes depend on the primary task criterion. A reanalysis of previous data revealed that massive numbers of trials are required to distinguish between hierarchical and independent models with tolerable accuracy. It is argued that researchers who wish to use logistic regression as measure of metacognitive sensitivity need to control the primary task criterion and rating criteria.     

Definability and Invariance

In his thesis Para uma Teoria Geral dos Homomorfismos (1944), the Portuguese mathematician José Sebastião e Silva constructed an abstract or generalized Galois theory, that is intimately linked to F. Klein’s Erlangen Program and that foreshadows some notions and results of today’s model theory; an analogous theory was independently worked out by M. Krasner in 1938. In this paper, we present a version of the theory making use of tools which were not at Silva’s disposal. At the same time, we tried to keep in mind, so much as possible, the gist of his standpoint.     

Uniform Interpolation and Propositional Quantifiers in Modal Logics

We investigate uniform interpolants in propositional modal logics from the proof-theoretical point of view. Our approach is adopted from Pitts’ proof of uniform interpolationin intuitionistic propositional logic [15]. The method is based on a simulation of certain quantifiers ranging over propositional variables and uses a terminating sequent calculus for which structural rules are admissible. We shall present such a proof of the uniform interpolation theorem for normal modal logics K and T. It provides an explicit algorithm constructing the interpolants. Presented by Heinrich Wansing     

The defeasible nature of coherentist justification

The impossibility results of Bovens and Hartmann (2003, Bayesian epistemology. Oxford: Clarendon Press) and Olsson (2005, Against coherence: Truth, probability and justification. Oxford: Oxford University Press.) show that the link between coherence and probability is not as strong as some have supposed. This paper is an attempt to bring out a way in which coherence reasoning nevertheless can be justified, based on the idea that, even if it does not provide an infallible guide to probability, it can give us an indication thereof. It is further shown that this actually is the case, for several of the coherence measures discussed in the literature so far. We also discuss how this affects the possibility to use coherence as a means of epistemic justification.     

Nonparametric item response theory axioms and properties under nonlinearity and their exemplification with knowledge space theory

This paper investigates the dichotomous Mokken nonparametric item response theory (IRT) axioms and properties under incomparabilities among latent trait values and items. Generalized equivalents of the unidimensional nonparametric IRT axioms and properties are formulated for nonlinear (quasi-ordered) person and indicator spaces. It is shown that monotone likelihood ratio (MLR) for the total score variable and nonlinear latent trait implies stochastic ordering (SO) of the total score variable, but may fail to imply SO of the nonlinear latent trait. The reason for this and conditions under which the implication holds are specified, based on a new, simpler proof of the fact that in the unidimensional case MLR implies SO. The approach is applied in knowledge space theory (KST), a combinatorial test theory. This leads to a (tentative) Mokken-type nonparametric axiomatization in the currently parametric theory of knowledge spaces. The nonparametric axiomatization is compared with the assumptions of the parametric basic local independence model which is fundamental in KST. It is concluded that this paper may provide a first step toward a basis for a possible fusion of the two split directions of psychological test theories IRT and KST.     

Does your trust in strangers or close acquaintances promote better health? Societal residential mobility matters

ABSTRACT

Some studies indicated that different types of trust are qualitatively different psychological experiences, which may lead to different health outcomes. The present study examined the effect of two types of trust, i.e., generalized trust and interpersonal trust, on promoting physical health and subjective well-being in regions varying in societal residential mobility. The data from a nationally representative sample, including 10,968 participants from 28 provinces/municipalities in China, were analyzed. The results showed that the negative relationship between generalized trust and depressed mood was stronger in the regions with higher societal residential mobility whereas the positive relationship between interpersonal trust and physical health and the negative relationship between interpersonal trust and depressed mood were stronger in the regions with lower societal residential mobility. These results highlight the importance of socio-ecological characteristics in understanding the adaptive functions of different types of social capital on health outcomes. (143 words; max: 150 words)     

Comprehension of simple quantifiers: empirical evaluation of a computational model

We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same problem and suggest extending their experimental setting. Moreover, we give some direct empirical evidence linking computational complexity predictions with cognitive reality. In the empirical study we compare time needed for understanding different types of quantifiers. We show that the computational distinction between quantifiers recognized by finite-automata and push-down automata is psychologically relevant. Our research improves upon, the hypotheses and explanatory power of recent neuroimaging studies as well as provides evidence for the claim that human linguistic abilities are constrained by computational complexity.     

Changes in proposed mechanisms of action during an acceptance-based behavior therapy for generalized anxiety disorder

Based on the theory that generalized anxiety disorder (GAD) is maintained through a reactive and fused relationship with one's internal experiences and a tendency towards experiential avoidance and behavioral restriction, an acceptance-based behavior therapy (ABBT) was developed to specifically target these elements. Since ABBT has been shown to be an efficacious treatment in previous studies, the current study focuses on proposed mechanisms of change over the course of therapy. Specifically, the current study focuses on session-by-session changes in two proposed mechanisms of change: acceptance of internal experiences and engagement in meaningful activities. Overall, clients receiving ABBT reported an increase in the amount of time spent accepting internal experiences and engaging in valued activities. Change in both acceptance and engagement in meaningful activities was related to responder status at post-treatment and change in these two proposed mechanisms predicted outcome above and beyond change in worry. In addition, change in acceptance was related to reported quality of life at post-treatment.     

Functional Dependencies between Variables

We consider a predicate logic L_fd where not all assignments of values to individual variables are possible. Some variables are functionally dependent on other variables. This makes sense if the models of logic are assumed to correspond to databases or states. We show that L_fd is undecidable but has a complete and sound sequent calculus formalisation.     

Henkin Quantifiers and the Definability of Truth

Henkin quantifiers have been introduced in Henkin (1961). Walkoe (1970) studied basic model-theoretical properties of an extension L _* ¹(H) of ordinary first-order languages in which every sentence is a first-order sentence prefixed with a Henkin quantifier. In this paper we consider a generalization of Walkoe's languages: we close L _* ¹(H) with respect to Boolean operations, and obtain the language L ¹(H). At the next level, we consider an extension L _* ²(H) of L ¹(H) in which every sentence is an L ¹(H)-sentence prefixed with a Henkin quantifier. We repeat this construction to infinity. Using the (un)-definability of truth – in – N for these languages, we show that this hierarchy does not collapse. In addition, we compare some of the present results to the ones obtained by Kripke (1975), McGee (1991), and Hintikka (1996).