Clinical significance and correlates of disruptive behavior in environmentally at-risk preschoolers

Examines the clinical significance and correlates of disruptive behavior disorder symptoms (DBDSX) in preschoolers. Participants were 129 predominantly minority preschoolers (2 1/2 to 5 1/2) residing in low-income environments, half of whom were clinic-referred for disruptive behavior. Children with higher levels of DBDSX were more impaired in parent-child, preschool and clinic contexts. Correlates of DBDSX included both prenatal and infancy risks (low soothability as infants, prenatal exposure to cigarettes) and concurrent parenting factors (harshness, low levels of behavioral responsiveness, and parenting stress). In general, the clinical and risk profile of DBDSX in preschoolers at environmental risk appears to be similar to that of older children. Based on the results of this study, etiologic and prevention research on disruptive behavior disorders should begin in the first few years of life.     

A Complete Axiom System for Polygonal Mereotopology of the Real Plane

This paper presents a calculus for mereotopological reasoning in which two-dimensional spatial regions are treated as primitive entities. A first order predicate language with a distinguished unary predicate c(x), function-symbols , · and – and constants 0 and 1 is defined. An interpretation for is provided in which polygonal open subsets of the real plane serve as elements of the domain. Under this interpretation the predicate c(x) is read as region x is connected and the function-symbols and constants are given their meaning in terms of a Boolean algebra of polygons. We give an alternative interpretation based on the real closed plane which turns out to be isomorphic to A set of axioms and a rule of inference are introduced. We prove the soundness and completeness of the calculus with respect to the given interpretation.     

Finite basis problems and results for quasivarieties

Let be a finite collection of finite algebras of finite signature such that SP( ) has meet semi-distributive congruence lattices. We prove that there exists a finite collection ₁ of finite algebras of the same signature, , such that SP( ₁) is finitely axiomatizable.We show also that if , then SP( ₁) is finitely axiomatizable. We offer new proofs of two important finite basis theorems of D. Pigozzi and R. Willard. Our actual results are somewhat more general than this abstract indicates.While working on this paper, the first author was partially supported by the Hungarian National Foundation for Scientific Research (OTKA) grant no. T37877 and the second author was supported by the US National Science Foundation grant no. DMS-0245622.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko     

Dominions in quasivarieties of universal algebras

The dominion of a subalgebra H in an universal algebra A (in a class ) is the set of all elements such that for all homomorphisms if f, g coincide on H, then a^f = a^g. We investigate the connection between dominions and quasivarieties. We show that if a class is closed under ultraproducts, then the dominion in is equal to the dominion in a quasivariety generated by . Also we find conditions when dominions in a universal algebra form a lattice and study this lattice.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko     

Oppositional Children Differ from Healthy Children in Frontal Brain Activation

An atypical EEG pattern of frontal brain activation, which has been found in children and adults with emotional disorders, also is hypothesized to be present in disruptive behavior disorders. One hundred nineteen children (4 $\frac{1}{2}$ and 8 years of age) were examined with regard to the following questions: (1) Do children who are diagnosed with oppositional defiant disorder (ODD) exhibit an atypical pattern of frontal brain activation? (2) Can this pattern be demonstrated in preschool children (4 $\frac{1}{2}$ years of age) as well as in school children (8 years)? (3) Are there gender differences in these patterns similar to those that have been demonstrated in adults? Spontaneous EEG activity was subjected to power spectral analysis. In oppositional preschool and elementary school girls, the well-known pattern of lower left frontal than right frontal activation emerged that has been found previously in emotionally disordered children. Healthy girls showed no frontal brain asymmetry at 4 $\frac{1}{2}$ years of age, and left frontal activation at 8 years. In contrast, healthy boys demonstrated a greater right than left frontal activation, whereas ODD boys did not display any frontal brain asymmetry. Thus, the pattern of frontal brain activation seems to be gender-specific. The atypical activation pattern in oppositional children is hypothesized to be a biological substrate of negative affective style.     

The Parents Matter! Program Interventions: Content and the Facilitation Process

The Parents Matter! Program (PMP) has developed three interventions for parents of 4th and 5th grade African-American children (9–12 years old). The overarching goal of all three interventions is to provide parents with knowledge, skills, and support for enhancing their efforts to raise healthy children. The interventions are: (1) Enhanced Communication and Parenting (five 2 -hour sessions), (2) Brief Communication and Parenting (single 2 -hour session), and (3) General Health (single 2 -hour session). This article discusses the development of these interventions, presents an overview of the content of each intervention, and discusses issues related to the facilitation/presentation of these interventions.     

Euclidean Hierarchy in Modal Logic

For a Euclidean space , let L _n denote the modal logic of chequered subsets of . For every n 1, we characterize L _n using the more familiar Kripke semantics, thus implying that each L _n is a tabular logic over the well-known modal system Grz of Grzegorczyk. We show that the logics L _n form a decreasing chain converging to the logic L of chequered subsets of . As a result, we obtain that L is also a logic over Grz, and that L has the finite model property. We conclude the paper by extending our results to the modal language enriched with the universal modality.     

An optimal property of least squares weights in prediction models

In predicting scores fromp > 1 observed scores in a sample of sizeñ, the optimal strategy (minimum expected loss), under certain assumptions, is shown to be based upon the least squares regression weights computed from a previous sample. Letting represent the correlation between and the predicted values , and letting represent the correlation between and a different set of predicted values , where w is any weighting system which is not a function of , it is shown that the probability of being less than cannot exceed .50. The relationship of this result to previous research and practical implications are discussed.     

Modal Incompleteness Revisited

In this paper, we are going to analyze the phenomenon of modal incompleteness from an algebraic point of view. The usual method of showing that a given logic L is incomplete is to show that for some L and some cannot be separated from by a suitably wide class of complete algebras — usually Kripke algebras. We are going to show that classical examples of incomplete logics, e.g., Fine logic, are not complete with respect to any class of complete BAOs. Even above Grz it is possible to find a continuum of such logics, which immediately implies the existence of a continuum of neighbourhood-incomplete Grz logics. Similar results can be proved for Löb logics. In addition, completely incomplete logics above Grz may be found uniformly as a result of failures of some admissible rule of a special kind.     

A theorem in 3-valued model theory with connections to number theory,type theory,and relevant logic

Given classical (2 valued) structures and and a homomorphism h of onto , it is shown how to construct a (non-degenerate) 3-valued counterpart of . Classical sentences that are true in are non-false in . Applications to number theory and type theory (with axiom of infinity) produce finite 3-valued models in which all classically true sentences of these theories are non-false. Connections to relevant logic give absolute consistency proofs for versions of these theories formulated in relevant logic (the proof for number theory was obtained earlier by R. K. Meyer and suggested the present abstract development).     

Local dependence latent structure models

A local independence latent structure model, which assumesm latent classes, requires a minimum of 2m-1 items for the solution of the 2m ² latent parameters. If one adds 3 items to the test and if one assumes local dependence between pairs of items, thereby adding additional latent parameters, _ij , representing the association between itemsi andj, then it is possible to obtain estimates for all of the latent parameters: latent class frequencies latent probabilities, and measures of association between pairs of items. The solution consists of (1) forming (m + 1) × (m + 1) matrices of manifest data, which are singular, (2) solving for the _ij in equations that result from the singularity of the data matrices, (3) correcting the manifest data by removing the contamination due to local dependence, and (4) estimating the remaining latent parameters from the corrected data, using methods outlined in earlier literature.     

Isomorphism and Equational Equivalence of Continuous λ-Models

We will present several results on two types of continuous models of -calculus, namely graph models and extensional models. By introducing a variant of Engeler's model construction, we are able to generalize the results of [7] and to give invariants that determine a large family of graph models up to applicative isomorphism. This covers all graph models considered in the litterature so far. We indicate briefly how these invariants may be modified in order to determine extensional models as well.Furthermore, we use our construction to exhibit graph models that are not equationally equivalent. We indicate once again how the construction passes on to extensional models.     

Empirical bayes estimates of domain scores under binomial and hypergeometric distributions for test scores

We introduce two simple empirical approximate Bayes estimators (EABEs)— and —for estimating domain scores under binomial and hypergeometric distributions, respectively. Both EABEs (derived from corresponding marginal distributions of observed test scorex without relying on knowledge of prior domain score distributions) have been proven to hold -asymptotic optimality in Robbins' sense of convergence in mean. We found that, where and are the monotonized versions of and under Van Houwelingen's monotonization method, respectively, the convergence rate of the overall expected loss of Bayes risk in either or depends on test length, sample size, and ratio of test length to size of domain items. In terms of conditional Bayes risk, and outperform their maximum likelihood counterparts over the middle range of domain scales. In terms of mean-squared error, we also found that: (a) given a unimodal prior distribution of domain scores, performs better than both and a linear EBE of the beta-binomial model when domain item size is small or when test items reflect a high degree of heterogeneity; (b) performs as well as when prior distribution is bimodal and test items are homogeneous; and (c) the linear EBE is extremely robust when a large pool of homogeneous items plus a unimodal prior distribution exists.The authors are indebted to both anonymous reviewers, especially Reviewer 2, and the Editor for their invaluable comments and suggestions. Thanks are also due to Yuan-Chin Chang and Chin-Fu Hsiao for their help with our simulation and programming work.     

An algebraic study of well-foundedness

A foundational algebra ( , f, ) consists of a hemimorphism f on a Boolean algebra with a greatest solution to the condition f(x). The quasi-variety of foundational algebras has a decidable equational theory, and generates the same variety as the complex algebras of structures (X, R), where f is given by R-images and is the non-wellfounded part of binary relation R.The corresponding results hold for algebras satisfying =0, with respect to complex algebras of wellfounded binary relations. These algebras, however, generate the variety of all ( ,f) with f a hemimorphism on ).Admitting a second hemimorphism corresponding to the transitive closure of R allows foundational algebras to be equationally defined, in a way that gives a refined analysis of the notion of diagonalisable algebra.The research reported in this paper was carried out while the author was at the Department of Mathematics and Statistics, University of Auckland, under a teaching exchange with the Victoria University of Wellington.     

Quasi-varieties: A special access

Quasi-equational logic concerns with a completeness theorem, i. e. a list of general syntactical rules such that, being given a set of graded quasi-equations Q, the closure Cl Q = Qeq Fun Q can be derived from by the given rules. Those rules do exist, because our consideration could be embedded into the logic of first order language. But, we look for special (quasi-equational) rules. Suitable rules were already established for the (non-functorial) case of partial algebras in Definition 3.1.2 of [27], p. 108, and [28], p. 102. (For the case of total algebras, see [35].) So, one has to translate these rules to the (functorial) language of partial theories .Surprisingly enough, partial theories can be replaced up to isomorphisms by partial Dale monoids (cf. Section 3), which, in the total case are ordinary monoids.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko     

On a problem of P(α, δ, π) concerning generalized Alexandroff s cube

Universality of generalized Alexandroff's cube plays essential role in theory of absolute retracts for the category of , -closure spaces. Alexandroff's cube. is an , -closure space generated by the family of all complete filters. in a lattice of all subsets of a set of power .Condition P(, , ) says that is a closure space of all , -filters in the lattice ( ), .Assuming that P (, , ) holds, in the paper [2], there are given sufficient conditions saying when an , -closure space is an absolute retract for the category of , -closure spaces (see Theorems 2.1 and 3.4 in [2]).It seems that, under assumption that P (, , ) holds, it will be possible to givean uniform characterization of absolute retracts for the category of , -closure-spaces.Except Lemma 3.1 from [1], there is no information when the condition P (, , ) holds or when it does not hold.The main result of this paper says, that there are examples of cardinal numbers, , , such that P (, , ) is not satisfied.Namely it is proved, using elementary properties of Lebesgue measure on the real line, that the condition P (, ₁, 2 ) is not satisfied.Moreover it is shown that fulfillment of the condition is essential assumption in, Theorems 2.1 and 3.4 from [1] i.e. it cannot be eliminated.     

Tarski hierarchies

The general notions of object- and metalanguage are discussed and as a special case of this relation an arbitrary first order language with an infinite model is expanded by a predicate symbol T₀ which is interpreted as truth predicate for . Then the expanded language is again augmented by a new truth predicate T₁ for the whole language plus T₀. This process is iterated into the transfinite to obtain the Tarskian hierarchy of languages. It is shown that there are natural points for stopping this process. The sets which become definable in suitable hierarchies are investigated, so that the relevance of the Tarskian hierarchy to some subjects of philosophy of mathematics are clarified.It should be noticed that these terms object language and meta language have only a relative sense. If, for instance, we become interested in the notion of truth applying to sentences, not of our original object-language, but of our meta-language, the latter becomes automatically the object-language of our discussion; and in order to define truth for this language, we have to go to a new meta-language — so to speak, to a meta-language of a higher level. In this way we arrive at a whole hierarchy of languages.(Tarski, 1986, p. 674f)     

Parent and Teacher Ratings on the IOWA Conners Rating Scale

The IOWA Conners Rating Scale is a widely used brief measure of inattentive-impulsive-overactive (IO) and oppositional-defiant (OD) behavior in children. This study examined the psychometric properties of this measure when completed by mothers and teachers. Results of confirmatory factor analyses indicated that a three-factor solution, conforming to current DSM-IV formulations of the disruptive behavior disorders, provided a better fit to the observed data than the currently used two-factor model, in which no distinction is made between inattentive and hyperactive-impulsive behaviors. Both new and currently used scale scores had good internal consistency and test–retest reliability and showed that boys’ scores were significantly higher than girls’ scores. Results held for both mother and teacher ratings. Clinical cutoff scores were proposed and performed reasonably well to screen for ADHD and ODD. Results support the IOWA Conners as a screening measure for the disruptive behavior disorders or as a tool for monitoring treatment response.

Behavioral and Emotional Problems in Young Preschoolers: Cross-Cultural Testing of the Validity of the Child Behavior Checklist/2-3

The cross-cultural validity of the Child Behavior Checklist for Ages 2-3 (CBCL/2-3) was tested in three Dutch samples of children referred to mental health services, from the general population, and from a twin study. Six scales were derived from factor analyses and labeled Oppositional, Aggressive, and Overactive, which constituted a broadband Externalizing grouping; Withdrawn/Depressed and Anxious, which constituted a broadband Internalizing grouping; and Sleep Problems. Internal consistencies of the scales, their test-retest reliabilities, interparent agreement, discriminative power, predictive relations with problem ratings 2 years later, and relations to other instruments designed to measure general development and behavior problems were adequate, and highly comparable to psychometric properties in American samples. It was concluded that across languages and cultures behavioral/emotional problems of young preschoolers may be adequately assessed with the CBCL/2-3.     

Dimensional Latent Structure of Early Disruptive Behavior Disorders: A Taxometric Analysis in Preschoolers

Although disruptive behavior disorders (DBDs) are used as a distinct categorical diagnosis in clinical practice, they have repeatedly been described as having a dimensional structure in taxometric analyses. In the current study the authors analyzed the latent status of disruptive behaviors (DB) in a large sample (N?=?2,808) of German preschool children (2–6 years old, mean age 53.7 months, SD?=?13.5, 48.4% girls). The Eyberg Child Behavior Inventory (ECBI) as well as the Strengths and Difficulties Questionnaire (SDQ) were used to compile indicators of the DB core dimensions (Temper Loss, Aggression, Noncompliance, and Low Concern for others). Three widely used taxometric methods (a) MAXEIG, (b) MAMBAC, and (c) L-Mode were applied. Simulation data were created to evaluate the Comparison Curve Fit Index values (CCFIs), which were below 0.45, supporting a dimensional solution. Hence, in the current study the latent structure of DB in preschoolers encompassed differences in degree rather than kind. Researchers and practitioners should be mindful of the dimensional latent status of DB in theory building, assessment, classification, and labeling.