代数应用题项目生成中的认知过程与任务特征分析

认知项目设计起源于理论驱动的测量模式,要求在详尽阐述测量建构理论的基础上,鉴别测验项目类型的任务特征,建立和标定与测量建构认知变量之间的对应关系,从而通过系统变换任务特征生成项目.本文以Greeno (1994)提出的代理者-情境交互作用(agent-situation interaction)的问题解决观为基础,对代数应用题解决的认知过程和任务蕴含性(affordance)进行了系统分析.具体而言,代数应用题被视为以文本形式呈现的,嵌套在现实情境中的某种量化结构.在代数应用题解决的转译、整合、计划、执行的认知过程中需要形成三种不同的表征,即文本基、情境模型和问题模型.其形成及解决过程受到个体问题图式知识的深刻影响.对应于不同表征方式,对代数应用题语法/语义结构、量化元素及结构、问题情境特征进行了系统分析和综合.该分析表明,为了保证代数应用题项目生成的科学性,当前研究的关键在于建立任务特征与问题解决认知变量之间的经验关系,并在问题领域整体水平上检验这种关系的可推广性.     

Squares in Fork Arrow Logic

In this paper we show that the class of fork squares has a complete orthodox axiomatization in fork arrow logic (FAL). This result may be seen as an orthodox counterpart of Venema's non-orthodox axiomatization for the class of squares in arrow logic. FAL is the modal logic of fork algebras (FAs) just as arrow logic is the modal logic of relation algebras (RAs). FAs extend RAs by a binary fork operator and are axiomatized by adding three equations to RAs equational axiomatization. A proper FA is an algebra of relations where the fork is induced by an injective operation coding pair formation. In contrast to RAs, FAs are representable by proper ones and their equational theory has the expressive power of full first-order logic. A square semantics (the set of arrows is U×U for some set U) for arrow logic was defined by Y. Venema. Due to the negative results about the finite axiomatizability of representable RAs, Venema provided a non-orthodox finite axiomatization for arrow logic by adding a new rule governing the applications of a difference operator. We address here the question of extending the type of relational structures to define orthodox axiomatizations for the class of squares. Given the connections between this problem and the finitization problem addressed by I. Németi, we suspect that this cannot be done by using only logical operations. The modal version of the FA equations provides an orthodox axiomatization for FAL which is complete in view of the representability of FAs. Here we review this result and carry it further to prove that this orthodox axiomatization for FAL also axiomatizes the class of fork squares.     

Mathematical modal logic: A view of its evolution

This is a survey of the origins of mathematical interpretations of modal logics, and their development over the last century or so. It focuses on the interconnections between algebraic semantics using Boolean algebras with operators and relational semantics using structures often called Kripke models. It reviews the ideas of a number of people who independently contributed to the emergence of relational semantics, and compares them with the work of Kripke. It concludes with an account of several applications of modal model theory to mathematics and theoretical computer science.     

Computing with Cylindric Modal Logics and Arrow Logics,Lower Bounds

The complexity of the satisfiability problems of various arrow logics and cylindric modal logics is determined. As is well known, relativising these logics makes them decidable. There are several parameters that can be set in such a relativisation. We focus on the following three: the number of variables involved, the similarity type and the kind of relativised models considered. The complexity analysis shows the importance and relevance of these parameters.     

Representations of monadic <Emphasis Type="Italic">MV</Emphasis> -algebras

Representations of monadic MV -algebra, the characterization of locally finite monadic MV -algebras, with axiomatization of them, definability of non-trivial monadic operators on finitely generated free MV -algebras are given. Moreover, it is shown that finitely generated m-relatively complete subalgebra of finitely generated free MV -algebra is projective.     

The effects of cumulative practice on mathematics problem solving

This study compared three different methods of teaching five basic algebra rules to college students. All methods used the same procedures to teach the rules and included four 50-question review sessions interspersed among the training of the individual rules. The differences among methods involved the kinds of practice provided during the four review sessions. Participants who received cumulative practice answered 50 questions covering a mix of the rules learned prior to each review session. Participants who received a simple review answered 50 questions on one previously trained rule. Participants who received extra practice answered 50 extra questions on the rule they had just learned. Tests administered after each review included new questions for applying each rule (application items) and problems that required novel combinations of the rules (problem-solving items). On the final test, the cumulative group outscored the other groups on application and problem-solving items. In addition, the cumulative group solved the problem-solving items significantly faster than the other groups. These results suggest that cumulative practice of component skills is an effective method of training problem solving.     

Quantum Logic as a Fragment of Independence-Friendly Logic

The working assumption of this paper is that noncommuting variables are irreducibly interdependent. The logic of such dependence relations is the author's independence-friendly (IF) logic, extended by adding to it sentence-initial contradictory negation ¬ over and above the dual (strong) negation . Then in a Hilbert space turns out to express orthocomplementation. This can be extended to any logical space, which makes it possible to define the dimension of a logical space. The received Birkhoff and von Neumann quantum logic can be interpreted by taking their disjunction to be ¬(A & B). Their logic can thus be mapped into a Boolean structure to which an additional operator has been added.