探索性因素分析因子抽取方法的比较

探索性因素分析决定因子抽取的方法主要有Bartlett法、K1原则、碎石检验法、Aaker原则、PA、MAP等六种,通过对样本1的395名大学生的学习过程问卷调查获得真实数据,运用这六种方法进行因素分析分别抽取7、4、2、4、3、2个因子;应用样本2的383名大学生的问卷调查数据进行验证性因素分析,结果显示,碎石检验方法与MAP方法抽取的二因素模型更理想。研究表明,因子抽取需兼顾“简约性原则”与“完备性原则”,同时要根据一定的理论建构、专业知识和经验来决定因子数。     

On Categorical Equivalences of Commutative BCK-algebras

A commutative BCK-algebra with the relative cancellation property is a commutative BCK-algebra (X;*,0) which satisfies the condition: if a ≤ x, a ≤ y and x * a = y * a, then x = y. Such BCK-algebras form a variety, and the category of these BCK-algebras is categorically equivalent to the category of Abelian ℓ-groups whose objects are pairs (G, G ₀), where G is an Abelian ℓ-group, G ₀ is a subset of the positive cone generating G ⁺ such that if u, v ∈ G ₀, then 0 ∨ (u - v) ∈ G ₀, and morphisms are ℓ-group homomorphisms h: (G, G ₀) → (G′,G′₀) with f(G ₀) ⫅ G′₀. Our methods in particular cases give known categorical equivalences of Cornish for conical BCK-algebras and of Mundici for bounded commutative BCK-algebras (= MV-algebras). This revised version was published online in June 2006 with corrections to the Cover Date.     

Partial Monotonic Protothetics

This paper has four parts. In the first part, I present Leniewski's protothetics and the complete system provided for that logic by Henkin. The second part presents a generalized notion of partial functions in propositional type theory. In the third part, these partial functions are used to define partial interpretations for protothetics. Finally, I present in the fourth part a complete system for partial protothetics. Completeness is proved by Henkin's method [4] using saturated sets instead of maximally saturated sets. This technique provides a canonical representation of a partial semantic space and it is suggested that this space can be interpreted as an epistemic state of a non-omniscient agent.     

Essential unifiers

A substitution δ is less general than a substitution σ if there exists λ such that δ=σλ, which induces a notion of generality in the algebra of substitutions. We propose to look at this well known concept of generality again, and to impose a new quasi ordering on substitutions as a natural result of a stronger notion of the composition of substitutions. This new generality ordering has important consequences for the theory of E-unification (unification in equational theories) and changes the basic notion of the most general unifiers, now called essential unifiers, as well as the unification hierarchy. In particular we show that for idempotent Semigroups (associativity and idempotency), also known as Bands, the set of essential unifiers always exists and is finite.     

A non-finitely based quasi-variety of De Morgan algebras

In this paper we exhibit a non-finitely based, finitely generated quasi-variety of De Morgan algebras and determine the bottom of the lattices of sub-quasi-varieties of Kleene and De Morgan algebras.Supported by Vicerrectoría Académica de la Facultad de Ciencias and by División de Investigación, Sede Bogotá of the Universidad Nacional de Colombia.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko     

Grading distractor-identification tests

On distractor-identification tests students mark as many distractors as possible on each test item. A grading scale is developed for this type testing. The scale is optimal in that it is the unique scale giving an unbiased estimate of the student's true score, i.e., the score that would result if no guessing occurred. If the test is administered as a usual multiple choice test and graded using the usual correction for guessing scale, the expected item score is the same as for the distractor-identification testing using the optimal grading scale. However, the variance of the item score is shown to be less for distractor-identification testing than for usual multiple choice testing under certain conditions.     

A Set Theory with Support for Partial Functions

Partial functions can be easily represented in set theory as certain sets of ordered pairs. However, classical set theory provides no special machinery for reasoning about partial functions. For instance, there is no direct way of handling the application of a function to an argument outside its domain as in partial logic. There is also no utilization of lambda-notation and sorts or types as in type theory. This paper introduces a version of von-Neumann-Bernays-Gödel set theory for reasoning about sets, proper classes, and partial functions represented as classes of ordered pairs. The underlying logic of the system is a partial first-order logic, so class-valued terms may be nondenoting. Functions can be specified using lambda-notation, and reasoning about the application of functions to arguments is facilitated using sorts similar to those employed in the logic of the IMPS Interactive Mathematical Proof System. The set theory is intended to serve as a foundation for mechanized mathematics systems.