A Predicate Logical Extension of a Subintuitionistic Propositional Logic

We develop a predicate logical extension of a subintuitionistic propositional logic. Therefore a Hilbert type calculus and a Kripke type model are given. The propositional logic is formulated to axiomatize the idea of strategic weakening of Kripke's semantic for intuitionistic logic: dropping the semantical condition of heredity or persistence leads to a nonmonotonic model. On the syntactic side this leads to a certain restriction imposed on the deduction theorem. By means of a Henkin argument strong completeness is proved making use of predicate logical principles, which are only classically acceptable.     

教师情绪智力和工作绩效的关系：工作家庭促进和主动行为的中介作用

采用整群抽样法对630名中小学教师进行调查,考察教师情绪智力与工作绩效之间的关系,以及工作家庭促进和主动行为在其中的中介作用。结果发现：（1）教师情绪智力、工作促进家庭、家庭促进工作和主动行为与工作绩效呈显著正相关;（2）教师情绪智力对工作绩效具有直接的正向预测作用,同时还通过家庭促进工作和主动行为的多重中介作用对工作绩效产生影响;（3）高低情绪智力对工作绩效的影响机制不同,低情绪智力通过家庭促进工作的部分中介作用影响教师工作绩效,高情绪智力通过家庭促进工作和主动行为的完全多重中介作用影响教师工作绩效;（4）工作家庭促进中工作促进家庭维度在教师情绪智力影响工作绩效中没有显著中介作用。     

抑郁症的影像遗传学研究:探索基因与环境的交互作用

抑郁症具有中等的遗传度。通过影像遗传学方法探讨抑郁相关基因的多态性对神经活动的影响,发现编码五羟色胺、促肾上腺素释放激素受体、多巴胺等神经递质或受体的基因多态性会影响杏仁核、前扣带等情绪加工脑区的功能或结构,且多数基因与压力生活经历发生交互作用。表明基因与环境的交互作用在抑郁症发病机理中扮演重要角色。未来的研究应拓展遗传和神经影像分析方法,重视环境因素的测量,通过整合遗传、神经影像及环境变量构建抑郁病理模型。     

空间-时间关联的中介共同表征结构:来自反转STEARC效应的证据

通过3个双任务实验(诱导任务和特征任务)探讨空间-时间联合编码(STEARC)效应的加工机制。实验1采用时间信息作为诱导任务材料,实验2采用空间信息作为诱导任务材料,在特征任务中都发现映射不一致组被试(看到过去/左侧刺激时按右键反应,看到未来/右侧刺激时按左键反应)出现反转STEARC效应,映射一致组被试表现出常规的STEARC效应,表明从时间信息加工到空间反应过程符合中介共同表征结构。实验3分离两种任务的反应方式(手动和眼动),发现不一致映射规则下,被试仍然表现出常规的STEARC效应,表明这种中介共同表征结构存在特定联结效应,即在不同反应器中出现时间和空间相互独立的表征结构。总体而言,研究支持空间-时间关联符合中介共同表征结构,并且这种关联中存在反应器特定联结效应。     

SUPERVALUATION FIXED-POINT LOGICS OF TRUTH

Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point semantics for languages expressing their own truth concepts. Kremer axiomatizes the strong Kleene fixed-point logic of truth and the weak Kleene fixed-point logic of truth, but leaves the axiomatizability question open for the supervaluation fixed-point logic of truth and its variants. We show that the principal supervaluation fixed point logic of truth, when thought of as consequence relation, is highly complex: it is not even analytic. We also consider variants, engendered by a stronger notion of ‘fixed point’, and by variant supervaluation schemes. A ‘logic’ is often thought of, not as a consequence relation, but as a set of sentences – the sentences true on each interpretation. We axiomatize the supervaluation fixed-point logics so conceived.     

Frame Based Formulas for Intermediate Logics

In this paper we define the notion of frame based formulas. We show that the well-known examples of formulas arising from a finite frame, such as the Jankov-de Jongh formulas, subframe formulas and cofinal subframe formulas, are all particular cases of the frame based formulas. We give a criterion for an intermediate logic to be axiomatizable by frame based formulas and use this criterion to obtain a simple proof that every locally tabular intermediate logic is axiomatizable by Jankov-de Jongh formulas. We also show that not every intermediate logic is axiomatizable by frame based formulas. Presented by Johan van Benthem     

The Method of Socratic Proofs for Modal Propositional Logics: K5, S4.2, S4.3, S4F,S4R,S4M and G

The aim of this paper is to present the method of Socratic proofs for seven modal propositional logics: K5, S4.2, S4.3, S4M, S4F, S4R and G. This work is an extension of [10] where the method was presented for the most common modal propositional logics: K, D, T, KB, K4, S4 and S5. Presented by Jacek Malinowski     

Definability and Interpolation in Non-Classical Logics

Algebraic approach to study of classical and non-classical logical calculi was developed and systematically presented by Helena Rasiowa in [48], [47]. It is very fruitful in investigation of non-classical logics because it makes possible to study large families of logics in an uniform way. In such research one can replace logics with suitable classes of algebras and apply powerful machinery of universal algebra. In this paper we present an overview of results on interpolation and definability in modal and positive logics,and also in extensions of Johansson's minimal logic. All these logics are strongly complete under algebraic semantics. It allows to combine syntactic methods with studying varieties of algebras and to flnd algebraic equivalents for interpolation and related properties. Moreover, we give exhaustive solution to interpolation and some related problems for many families of propositional logics and calculi. This paper is a version of the invited talk given by the author at the conference Trends in Logic III, dedicated to the memory of A. MOSTOWSKI, H. RASIOWA and C. RAUSZER, and held in Warsaw and Ruciane-Nida from 23rd to 25th September 2005. Presented by Jacek Malinowski     

Beyond Rasiowa's Algebraic Approach to Non-classical Logics

This paper reviews the impact of Rasiowa's well-known book on the evolution of algebraic logic during the last thirty or forty years. It starts with some comments on the importance and influence of this book, highlighting some of the reasons for this influence, and some of its key points, mathematically speaking, concerning the general theory of algebraic logic, a theory nowadays called Abstract Algebraic Logic. Then, a consideration of the diverse ways in which these key points can be generalized allows us to survey some issues in the development of the field in the last twenty to thirty years. The last part of the paper reviews some recent lines of research that in some way transcend Rasiowa's approach. I hope in this way to give the reader a general view of Rasiowa's key position in the evolution of Algebraic Logic during the twentieth century. This paper is an extended version of the invited talk given by the author at the conference Trends in Logic III, dedicated to the memory of A. MOSTOWSKI, H. RASIOWA and C. RAUSZER, and held in Warsaw and Ruciane-Nida from 23rd to 25th September 2005. Presented by Jacek Malinowski     

A family of Gödel hybrid logics

In this paper, we define a family of fuzzy hybrid logics that are based on Gödel logic. It is composed of two infinite-valued versions called ${\mathsf{GH}}_{\infty }$ and ${\mathsf{WGH}}_{\infty }$, and a sequence of finitary valued versions ${({\mathsf{GH}}_n)}_{0<n<\infty }$. We define decision procedures for both ${\mathsf{WGH}}_{\infty }$ and ${({\mathsf{GH}}_n)}_{0<n<\infty }$ that are based on particular sequents and on a set of proof rules dealing with such sequents. As these rules are strongly invertible the procedures naturally allow one to generate countermodels. Therefore we prove the decidability and the finite model property for these logics. Finally, from the decision procedure of ${\mathsf{WGH}}_{\infty }$, we design a sound and complete sequent calculus for this logic.