态度测量的新进展:二值概率展开模型及一般形式

态度测量主要应用两种模型:累进型与展开型。目前国内的相关研究主要针对累进型模型。文章在回顾累进型模型的基础上,介绍了当前国际研究最为前沿的一种新的态度测量模型———二值概率展开模型,并详细阐述了该模型的一般数学表达式。     

Sequent Calculi for Some Strict Implication Logics

We introduce various sequent systems for propositional logicshaving strict implication, and prove the completeness theoremsand the finite model properties of these systems.The cut-eliminationtheorems or the (modified) subformula properties are provedsemantically.     

线索呈现位置对概率类别学习的影响

当前概率类别学习中主要存在多系统和单系统两种观点之争, 而持不同观点的研究者在其实验中分别采用了不同的线索位置呈现方式, 因此本研究采用经典的天气预测任务通过操纵线索位置的呈现方式来进一步探讨其对概率类别学习的影响。本研究包括2个实验：实验1考察所有线索位置固定和随机对概率类别学习系统的影响; 实验2通过单线索模式下线索位置固定考察概率类别学习的策略。结果发现, 当所有线索的呈现位置固定时, 概率类别学习是外显学习; 而当所有线索的呈现位置随机时, 概率类别学习是内隐学习; 而当只在线索单独出现时固定其位置, 概率类别学习仍是内隐学习。结果表明, 线索位置的不同呈现方式会影响概率类别学习中外显和内隐学习系统的竞争, 研究支持了多系统观点, 且概率类别学习的主要策略可能是多线索策略而不是单模式策略。     

小学数学真实性问题解决的调查研究

在常规课堂上对来自北京市两所小学148位10-12岁的小学生进行真实性问题的测验,研究结果表明:1)被试中对真实数学问题作出真实性解答的人数比例约为四分之一,高于国外同类研究中比例.2)作出常规解答的人数比例约为一半,显著高于作出真实解答的人数比例.3)六年级被试作出真实解答的人数比例普遍高于四年级,但是在某些问题上,六年级被试中作出常规解答的人数比例反而高于四年级.4)被试对不同真实问题的反应存在一定的差异,这可能与真实问题的特点有关.     

Three Models of Sequential Belief Updating on Uncertain Evidence

Jeffrey updating is a natural extension of Bayesian updating to cases where the evidence is uncertain. But, the resulting degrees of belief appear to be sensitive to the order in which the uncertain evidence is acquired, a rather un-Bayesian looking effect. This order dependence results from the way in which basic Jeffrey updating is usually extended to sequences of updates. The usual extension seems very natural, but there are other plausible ways to extend Bayesian updating that maintain order-independence. I will explore three models of sequential updating, the usual extension and two alternatives. I will show that the alternative updating schemes derive from extensions of the usual rigidity requirement, which is at the heart of Jeffrey updating. Finally, I will establish necessary and sufficient conditions for order-independent updating, and show that extended rigidity is closely related to these conditions.     

A Logic for Information Systems

A conception of an information system has been introduced by Pawlak. The study has been continued in works of Pawlak and Orlowska and in works of Vakarelov. They had proposed some basic relations and had constructed a formal system of a modal logic that describes the relations and some of their Boolean combinations. Our work is devoted to a generalization of this approach. A class of relation systems and a complete calculus construction method for these systems are proposed. As a corollary of our main result, our paper contains a solution of a Vakarelov's problem: how to construct a formal system that describes all the Boolean combinations of the basic relations.     

An Elementary Proof of Chang's Completeness Theorem for the Infinite-valued Calculus of Lukasiewicz

The interpretation of propositions in Lukasiewicz's infinite-valued calculus as answers in Ulam's game with lies--the Boolean case corresponding to the traditional Twenty Questions game--gives added interest to the completeness theorem. The literature contains several different proofs, but they invariably require technical prerequisites from such areas as model-theory, algebraic geometry, or the theory of ordered groups. The aim of this paper is to provide a self-contained proof, only requiring the rudiments of algebra and convexity in finite-dimensional vector spaces.     

Estimation of the hypothesis hierarchy in probabilistic inference tasks*

Is there a hierarchical order among the hypotheses about functional rules in probabilistic inference tasks, i.e. what is the construction and the procedure of the “hypothesis sampling mechanism” employed by the subjects in this kind of task? According to the hypothesis sampling model initially proposed by Brehmer (1974) there should be a hierarchical order among the hypotheses in the subject's hypothesis pools. The procedures of hypothesis sampling and testing ought to follow this strict data independent order (see e.g. Sniezek, 1986; Brehmer, 1987). Knez (1991a, b) showed, however, that this assumption may be incorrect. As a follow up to these results the question regarding the construction of the subject's hypothesis pools was reapproached in the present study. The results indicated a consistency with the hierarchical assumption (Brehmer, 1974) only regarding the relation between the linear and nonlinear rules but not within these types of rules.     

Marginalia on Sequent Calculi

The paper discusses the relationship between normal natural deductions and cutfree proofs in Gentzen (sequent) calculi in the absence of term labeling. For Gentzen calculi this is the usual version; for natural deduction this is the version under the complete discharge convention, where open assumptions are always discharged as soon as possible. The paper supplements work by Mints, Pinto, Dyckhoff, and Schwichtenberg on the labeled calculi.     

A probabilistic model of intensive designs

Without internal validity, experimental data are uninterpretable. With intensive designs, most methods presented to quantify a design's internal validity have been subject to criticism. A probabilistic model of intensive designs is presented that demonstrates the high degree of internal validity of these designs without relying on adaptations from traditional inferential statistics. Where the experimenter is able to conform to the restrictions of the model, the equations provide an estimation of internal validity for either reversal or multiple-baseline designs. More importantly, the model provides mathematical bases for some of the common recommendations and design considerations in intensive research (such as the desirability of within-subject replications and of four or more multiple baselines).