条件推理:“演绎”与“概率”两种实验研究范式之比较

本研究通过推理心理学研究中的“演绎”和“概率”两种实验范式设计对同一个班级的大学生参与者(实验一中N=57,实验二中N=43)进行先后两次有关条件推理的实验研究后,得出如下主要结果:(1)推理者在对不同的“纯形式条件命题本身的认可度”以及对由它们各自建构的同类型推理题的推理结果之间的作答反应模式之间的差异都很小且具有较高的一致性;(2)对由不同的“含具体内容的假言命题”本身的认可度之间以及由它们建构的同类型条件推理题的推理结果之间具有较大的差异性;(3)推理者对“演绎”和“概率”两种不同实验范式分别建构的内容近似的推进题进行推理时具有大致相同的作答反应趋势。由此可以推论推理者在“概率推理实验范式”中的作答或推理结果可以被视为只是对“演绎推理实验范式”的相应推理题给出“概率解”的心理加工过程。     

Developmental and content effects in reasoning with causal conditionals

Two predictions derived from Markovits and Barrouillet's (2001) developmental model of conditional reasoning were tested in a study in which 72 twelve-year-olds, 80 fifteen-year-olds, and 104 adults received a paper-and-pencil test of conditional reasoning with causal premises ("if cause P then effect Q"). First, we predicted that conditional premises would induce more correct uncertainty responses to the Affirmation of the consequent and Denial of the antecedent forms when the antecedent term is weakly associated to the consequent than when the two are strongly associated and that this effect would decrease with age. Second, uncertainty responding to the Denial of the antecedent form ("P is not true") should be easier when the formulation of the minor premise invites retrieval of alternate antecedents ("if something other than P is true"). The results were consistent with the hypotheses and indicate the importance of retrieval processes in understanding developmental patterns in conditional reasoning with familiar premises.     

Categorical Abstract Algebraic Logic Metalogical Properties

Metalogical properties that have traditionally been studied in the deductive system context (see, e.g., [21]) and transferred later to the institution context [33], are here formulated in the -institution context. Preservation under deductive equivalence of -institutions is investigated. If a property is known to hold in all algebraic -institutions and is preserved under deductive equivalence, then it follows that it holds in all algebraizable -institutions in the sense of [36].     

Integrating different types of knowledge in supervision

The present article examines ways to integrate two, often contradictory, types of knowledge in supervision, which are sometimes represented either by supervisors or supervisees, and sometimes by different parts in the supervisee. These types of knowledge are in a dialectic relationship: they may define each other and at the same time influence and shape each other, yet remain two separate sources for understanding the therapeutic experience. One type is the primary, vague, and intuitive knowledge about patients and therapist–patient interactions, derived from actual participation in the therapeutic relationship. The other type is knowledge derived from theory, experience acquired mainly outside of the specific therapy, and dialog with colleagues.     

双陈述任务下演绎推理的错觉

研究了双陈述任务下的复合命题推理和三段论推理的错觉。被试为暨南大学本科生60名。使用冠有“只有一个陈述是正确的”作为限制条件的双陈述推理任务。实验1为纯命题任务,实验2为角色化任务。t检验的结果表明被试只考虑了正确的陈述,却忽略了错误的陈述而出现推理的错觉。结果支持了心理模型理论中的正面表征原则,初步提出正反信息转换机制的观点。     

Algorithmic Proof Methods and Cut Elimination for Implicational Logics Part I: Modal Implication

In this work we develop goal-directed deduction methods for the implicational fragment of several modal logics. We give sound and complete procedures for strict implication of K, T, K4, S4, K5, K45, KB, KTB, S5, G and for some intuitionistic variants. In order to achieve a uniform and concise presentation, we first develop our methods in the framework of Labelled Deductive Systems [Gabbay 96]. The proof systems we present are strongly analytical and satisfy a basic property of cut admissibility. We then show that for most of the systems under consideration the labelling mechanism can be avoided by choosing an appropriate way of structuring theories. One peculiar feature of our proof systems is the use of restart rules which allow to re-ask the original goal of a deduction. In case of K, K4, S4 and G, we can eliminate such a rule, without loosing completeness. In all the other cases, by dropping such a rule, we get an intuitionistic variant of each system. The present results are part of a larger project of a goal directed proof theory for non-classical logics; the purpose of this project is to show that most implicational logics stem from slight variations of a unique deduction method, and from different ways of structuring theories. Moreover, the proof systems we present follow the logic programming style of deduction and seem promising for proof search [Gabbay and Reyle 84, Miller et al. 91].     

Proper Semantics for Substructural Logics,from a Stalker Theoretic Point of View

We study filters in residuated structures that are associated with congruence relations (which we call -filters), and develop a semantical theory for general substructural logics based on the notion of primeness for those filters. We first generalize Stone’s sheaf representation theorem to general substructural logics and then define the primeness of -filters as being “points” (or stalkers) of the space, the spectrum, on which the representing sheaf is defined. Prime FL-filters will turn out to coincide with truth sets under various well known semantics for certain substructural logics. We also investigate which structural rules are needed to interpret each connective in terms of prime -filters in the same way as in Kripke or Routley-Meyer semantics. We may consider that the set of the structural rules that each connective needs in this sense reflects the difficulty of giving the meaning of the connective. A surprising discovery is that connectives , ⅋ of linear logic are linearly ordered in terms of the difficulty in this sense. Presented by Wojciech Buszkowski     

应用项目反应理论创建图形推理测验题库

自编235个图形推理测验题目。采用铆测验等值设计,以72个联合型瑞文测验题目为铆题,对初中到大学各能力层次的1733名男性进行了测验。使用BILOG MG3.0（边际极大似然估计）对实测数据进行了分析,采用Logsitic 3参数模型。剔除数据与模型拟合不好的题目以及信息函数最大值小于0.3的题目,最终建立一个包含181道题目的题库。该题库可以用于淘汰智力较低的应征青年     

Categorical Abstract Algebraic Logic: Prealgebraicity and Protoalgebraicity

Two classes of π are studied whose properties are similar to those of the protoalgebraic deductive systems of Blok and Pigozzi. The first is the class of N-protoalgebraic π-institutions and the second is the wider class of N-prealgebraic π-institutions. Several characterizations are provided. For instance, N-prealgebraic π-institutions are exactly those π-institutions that satisfy monotonicity of the N-Leibniz operator on theory systems and N-protoalgebraic π-institutions those that satisfy monotonicity of the N-Leibniz operator on theory families. Analogs of the correspondence property of Blok and Pigozzi for π-institutions are also introduced and their connections with preand protoalgebraicity are explored. Finally, relations of these two classes with the (, N)-algebraic systems, introduced previously by the author as an analog of the -algebras of Font and Jansana, and with an analog of the Suszko operator of Czelakowski for π-institutions are also investigated. Presented by Josep Maria Font