A Unified Nonparametric IRT Model for <Emphasis Type="Italic">d</Emphasis>-Dimensional Psychological Test Data (<Emphasis Type="Italic">d</Emphasis>-ISOP)

The (univariate) isotonic psychometric (ISOP) model (Scheiblechner, 1995) is a nonparametric IRT model for dichotomous and polytomous (rating scale) psychological test data. A weak subject independence axiom W1 postulates that the subjects are ordered in the same way except for ties (i.e., similarly or isotonically) by all items of a psychological test. A weak item independence axiom W2 postulates that the order of the items is similar for all subjects. Local independence (LI or W3) is assumed in all models. With these axioms, sample-free unidimensional ordinal measurements of items and subjects become feasible. A cancellation axiom (Co) gives, as a result, the additive isotonic psychometric (ADISOP) model and interval scales for subjects and items, and an independence axiom (W4) gives the completely additive isotonic psychometric (CADISOP) model with an interval scale for the response variable (Scheiblechner, 1999). The d-ISOP, d-ADISOP, and d-CADISOP models are generalizations to d-dimensional dependent variables (e.g., speed and accuracy of response). The author would like to thank an Associate Editor and two anonymous referees and also Professor H.H. Schulze for their very valuable suggestions and corrections.     

An Infinitary Extension of Jankov’s Theorem

It is known that for any subdirectly irreducible finite Heyting algebra A and any Heyting algebra B, A is embeddable into a quotient algebra of B, if and only if Jankov’s formula χ _A for A is refuted in B. In this paper, we present an infinitary extension of the above theorem given by Jankov. More precisely, for any cardinal number κ, we present Jankov’s theorem for homomorphisms preserving infinite meets and joins, a class of subdirectly irreducible complete κ-Heyting algebras and κ-infinitary logic, where a κ-Heyting algebra is a Heyting algebra A with # ≥  κ and κ-infinitary logic is the infinitary logic such that for any set Θ of formulas with # Θ ≥  κ, ∨Θ and ∧Θ are well defined formulas.     

Congruence Coherent Symmetric Extended de Morgan Algebras

An algebra A is said to be congruence coherent if every subalgebra of A that contains a class of some congruence on A is a union of -classes. This property has been investigated in several varieties of lattice-based algebras. These include, for example, de Morgan algebras, p-algebras, double p-algebras, and double MS-algebras. Here we determine precisely when the property holds in the class of symmetric extended de Morgan algebras. Presented by M.E. Adams     

学习因素对语义信息加工性质的影响

本研究通过两个行为实验,采用句子核证作业,将SAD技术和范畴学习范式有机地结合起来,对语义信息加工进程以及学习因素在其中的作用进行了考察。实验一研究了熟悉性对语义信息加工的影响。结果表明,高熟悉句的部分信息积累具有离散的趋势;低熟悉句的部分信息积累是连续性的。实验二采用范畴学习。并结合SAD技术的句子核证作业．考察了在学习过程中语义加工性质的变化。结果发现：过度学习比初始学习有更多的部分信息积累,并随信号间隔的延长而逐渐增加;过度学习表现出部分信息积累的离散性变化;初始学习则表现出连续累积的趋势。说明学习确实造成了连续性加工向离散性质的过渡。     

Principal Congruences on Semi-De Morgan Algebras

In this paper we use Hobby's duality for semi-De Morgan algebras, to characterize those algebras having only principal congruences in the classes of semi-De Morgan algebras, demi-pseudocomplemented lattices and almost pseudocomplemented lattices. This work extends some of the results reached by Beazer in [3] and [4].     

Priestley duality for some subalgebra lattices

Priestley duality can be used to study subalgebras of Heyting algebras and related structures. The dual concept is that of congruence on the dual space and the congruence lattice of a Heyting space is dually isomorphic to the subalgebra lattice of the dual algebra. In this paper we continue our investigation of the congruence lattice of a Heyting space that was undertaken in [10], [8] and [12]. Our main result is a characterization of the modularity of this lattice (Theorem 2.12). Partial results about its complementedness are also given, and among other things a characterization of those finite Heyting algebras with a complemented subalgebra lattice (Theorem 3.5).     

Acceleration model in the heterogeneous case of the general graded response model

A new model, called acceleration model, is proposed in the framework of the heterogenous case of the graded response model, based on processing functions defined for a finite or enumerable number of steps. The model is expected to be useful in cognitive assessment, as well as in more traditional areas of application of latent trait models. Criteria for evaluating models are proposed, and soundness and robustness of the acceleration model are discussed. Graded response models based on individual choice behavior are also discussed, and criticisms on model selection in terms of fitnesses of models to the data are also given.This research was supported by the Office of Naval Research (N00014-90-J-1456).