国外有关学习时间分配决策能力的研究概述

学习时间分配决策是记忆监控的核心内容之一。文章围绕学习时间分配决策能力的新近研究,重点介绍了如下问题：（1）儿童学习时间分配决策能力的发展;（2）学习时间分配决策机制的探讨,特别对最新的理论模型——学习层次模型和最近学习区假设进行了比较详细的介绍;（3）对今后研究发展的趋势进行了展望。     

Choice and Logic

There is a little known paradox the solution to which is a guide to a much more thoroughgoing solution to a whole range of classic paradoxes. This is shown in this paper with respect to Berrys Paradox, Heterologicality, Russells Paradox, and the Paradox of Predication, also the Liar and the Strengthened Liar, using primarily the epsilon calculus. The solutions, however, show not only that the first-order predicate calculus derived from Frege is inadequate as a basis for a clear science, and should be replaced with Hilbert and Bernays conservative extension. Standard second-order logic, and quantified propositional logic also must be substantially modified, to incorporate, in the first place, nominalizations of predicates, and whole sentences. And further modifications must be made, so as to insist that predicates are parts of sentences rather than forms of them, and that truth is a property of propositions rather than their sentential expressions. In all, a thorough reworking of what has been called logic in recent years must be undertaken, to make it more fit for use.Portions of this paper have previously been published in Logical Studies, vol. 9, http://www.logic.ru/LogStud/09/No9-06.html, and the Australasian Journal of Logic, vol. 2, http://www.philosophy.unimelb.edu.au/ajl/2004/2004_4.pdf.     

5～7岁儿童类比系统性效应的实验研究

本研究利用Gentner的理论,参考Robins的研究方法自己编制材料,以故事呈现的方式研究了5岁、6岁和7岁三个年龄组儿童的类比系统性效应。结果表明,5岁年龄组的儿童不容易进行结构映射,而6岁和7岁两个年龄组的儿童表现出比较明显的类比系统性效应。这表明在合适的年龄阶段,儿童可以理解故事中的因果关系。     

改变因症就诊的医疗模式搞好慢性呼吸疾病的防控

本文简单介绍了各种慢性呼吸疾病的特点、重要性、病因和发病机理,重点阐述认真搞好三级预防是有效防控慢性呼吸疾病的基础,而目前我国慢性呼吸疾病医疗服务模式是因症就诊,这种医疗服务模式不利于慢性呼吸疾病的管理和控制,必须尽快改变。     

健康行动过程取向模型的发展与前景

健康行动过程取向(HAPA)模型的提出源于健康行为社会认知模型的发展和Bandura社会认知理论的应用。在HAPA中, 健康行为变化被视为一个包括行为产生、保持和恢复在内的连续过程; 结果预期、危险感知、三种自我效能感和两类计划被用来解释意图的形成及其向行动的转化; 两个阶段的划分有助于区分三类干预对象, 建议实施菜单式干预。HAPA模型具有明显的理论优势, 也引发了有关模型实质的争论。当前和未来的研究旨在考察更多的自我调节变量、检验因果模型, 在健康行为的多个领域开展应用和干预研究。     

Varieties of Monadic Heyting Algebras. Part III

This paper is the concluding part of [1] and [2], and it investigates the inner structure of the lattice (MHA) of all varieties of monadic Heyting algebras. For every n , we introduce and investigate varieties of depth n and cluster n, and present two partitions of (MHA), into varieties of depth n, and into varieties of cluster n. We pay a special attention to the lower part of (MHA) and investigate finite and critical varieties of monadic Heyting algebras in detail. In particular, we prove that there exist exactly thirteen critical varieties in (MHA) and that it is decidable whether a given variety of monadic Heyting algebras is finite or not. The representation of (MHA) is also given. All these provide us with a satisfactory insight into (MHA). Since (MHA) is dual to the lattice NExtMIPC of all normal extensions of the intuitionistic modal logic MIPC, we also obtain a clearer picture of the lattice structure of intuitionistic modal logics over MIPC.     

Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤ω

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers p, p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (Kremer, 1997). It is shown that if the Kripke structures are restricted to trees of at height and width at most , the resulting logics are decidable. This provides a partial answer to a question by Kremer. The result also transfers to modal S4 and some Gödel–Dummett logics with quantifiers over propositions.     

On Intermediate Predicate Logics of some Finite Kripke Frames,I. Levelwise Uniform Trees

An intermediate predicate logic L is called finite iff it is characterized by a finite partially ordered set M, i.e., iff L is the logic of the class of all predicate Kripke frames based on M. In this paper we study axiomatizability of logics of this kind. Namely, we consider logics characterized by finite trees M of a certain type (levelwise uniform trees) and establish the finite axiomatizability criterion for this case.