Flexible moral theories: Complexity,domination, and indeterminacy

In this article we identify three previously unnoticed problems with flexible moral theories, i.e., theories according to which different moral rules apply when there is full compliance and when there is partial compliance. The first problem is that flexible theories are necessarily very complex, which undermines their ability to motivate and guide action. The second problem is that flexible theories allow for a troubling kind of (moral) domination: the duties an agent has depend on other agents' willingness to comply. Finally, flexible theories introduce indeterminacy: it is sometimes impossible to determine which moral rules apply. When agents stand at the threshold—i.e., when a different rule would apply if a single additional act of noncompliance took place—it is impossible to determine which rule should apply.     

Concise formulas for the standard errors of component loading estimates

Concise formulas for the asymptotic standard errors of component loading estimates were derived. The formulas cover the cases of principal component analysis for unstandardized and standardized variables with orthogonal and oblique rotations. The formulas can be used under any distributions for observed variables as long as the asymptotic covariance matrix for sample covariances/correlations is available. The estimated standard errors in numerical examples were shown to be equivalent to those by the methods using information matrices.The author is indebted to anonymous reviewers for the corrections and suggestions on this study, which have led to improvements of earlier versions of this article.     

Partiality and Its Dual

This paper explores allowing truth value assignments to be undetermined or "partial" (no truth values) and overdetermined or "inconsistent" (both truth values), thus returning to an investigation of the four-valued semantics that I initiated in the sixties. I examine some natural consequence relations and show how they are related to existing logics, including ukasiewicz's three-valued logic, Kleene's three-valued logic, Anderson and Belnap's (first-degree) relevant entailments, Priest's "Logic of Paradox", and the first-degree fragment of the Dunn-McCall system "R-mingle". None of these systems have nested implications, and I investigate twelve natural extensions containing nested implications, all of which can be viewed as coming from natural variations on Kripke's semantics for intuitionistic logic. Many of these logics exist antecedently in the literature, in particular Nelson's "constructible falsity".     

On the existence and uniqueness of JML estimates for the partial credit model

A necessary and sufficient condition is given in this paper for the existence and uniqueness of the maximum likelihood (the so-called joint maximum likelihood) estimate of the parameters of the Partial Credit Model. This condition is stated in terms of a structural property of the pattern of the data matrix that can be easily verified on the basis of a simple iterative procedure. The result is proved by using an argument of Haberman (1977). The author wishes to thank the Editor and the anonymous reviewers for their comments that helped to substantially improve the final version of this paper. This research was supported in part by a MURST grant (ex 60%).     

On Revising Fuzzy Belief Bases

We look at the problem of revising fuzzy belief bases, i.e., belief base revision in which both formulas in the base as well as revision-input formulas can come attached with varying degrees. Working within a very general framework for fuzzy logic which is able to capture certain types of uncertainty calculi as well as truth-functional fuzzy logics, we show how the idea of rational change from “crisp” base revision, as embodied by the idea of partial meet (base) revision, can be faithfully extended to revising fuzzy belief bases. We present and axiomatise an operation of partial meet fuzzy base revision and illustrate how the operation works in several important special instances of the framework. We also axiomatise the related operation of partial meet fuzzy base contraction.This paper is an extended version of a paper presented at the Nineteenth Conference on Uncertainty in Arti.cial Intelligence (UAI’03).     

A Multitrait–Multisource Confirmatory Factor Analytic Approach to the Construct Validity of ADHD and ODD Rating Scales with Malaysian Children

Confirmatory factor analysis (CFA) was used to model a multitrait by multisource matrix to determine the convergent and discriminant validity of measures of attention-deficit hyperactivity disorder (ADHD)-inattention (IN), ADHD-hyperactivity/impulsivity (HI), and oppositional defiant disorder (ODD) in 917 Malaysian elementary school children. The three trait factors were ADHD-IN, ADHD-HI, and ODD. The two source factors were parents and teachers. Similar to earlier studies with Australian and Brazilian children, the parent and teacher measures failed to show convergent and discriminant validity with Malaysian children. The study outlines the implications of such strong source effects in ADHD-IN, ADHD-HI, and ODD measures for the use of such parent and teacher scales to study the symptom dimensions.     

Equivalents of Mingle and Positive Paradox

Relevant logic is a proper subset of classical logic. It does not include among its theorems any ofpositive paradox A (B A)mingle A (A A)linear order (A B) (B A)unrelated extremes (A ) (B B¯)This article shows that those four formulas have different effects when added to relevant logic, and then lists many formulas that have the same effect as positive paradox or mingle.     

Seeing the Fisher<Emphasis Type="Italic">Z</Emphasis>-transformation

Since 1915, statisticians have been applying Fisher'sZ-transformation to Pearson product-moment correlation coefficients. We offer new geometric interpretations of this transformation.     

A factor simplicity index

We propose an index for assessing the degree of factor simplicity in the context of principal components and exploratory factor analysis. The new index, which is called Loading Simplicity, is based on the idea that the communality of each variable should be related to few components, or factors, so that the loadings in each variable are either zero or as far from zero as possible. This index does not depend on the scale of the factors, and its maximum and minimum are only related to the degree of simplicity in the loading matrix. The aim of the index is to enable the degree of simplicity in loading matrices to be compared.The author would like to thank the review team for their insights and recommendations. This work was supported by a grant SEC2001-3821-C05-C02 from the Spanish Ministry of Science and Technology.