Free-Variable Tableaux for Propositional Modal Logics

Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariables used during proof search. We present the theoretical foundations to extend this technique to propositional modal logics, including non-trivial rigorous proofs of soundness and completeness, and also present various techniques that improve the efficiency of the basic naive method for such tableaux.     

Three Complexity Problems in Quantified Fuzzy Logic

We prove that the sets of standard tautologies of predicate Product Logic and of predicate Basic Logic, as well as the set of standard-satisfiable formulas of predicate Basic Logic are not arithmetical, thus finding a rather satisfactory solution to three problems proposed by Hájek in [H01].     

The Idea of a Proof-Theoretic Semantics and the Meaning of the Logical Operations

This is a purely conceptual paper. It aims at presenting and putting into perspective the idea of a proof-theoretic semantics of the logical operations. The first section briefly surveys various semantic paradigms, and Section 2 focuses on one particular paradigm, namely the proof-theoretic semantics of the logical operations. This revised version was published online in June 2006 with corrections to the Cover Date.     

Completeness Theorems via the Double Dual Functor

The aim of this paper is to apply properties of the double dual endofunctor on the category of bounded distributive lattices and some extensions thereof to obtain completeness of certain non-classical propositional logics in a unified way. In particular, we obtain completeness theorems for Moisil calculus, n-valued Łukasiewicz calculus and Nelson calculus. Furthermore we show some conservativeness results by these methods. This revised version was published online in June 2006 with corrections to the Cover Date.     

Adaptive logics using the minimal abnormality strategy are $$\Pi^1_1$$ -complex

In this article complexity results for adaptive logics using the minimal abnormality strategy are presented. It is proven here that the consequence set of some recursive premise sets is -complete. So, the complexity results in (Horsten and Welch, Synthese 158:41–60, 2007) are mistaken for adaptive logics using the minimal abnormality strategy.     

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

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

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

采用整群抽样法对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.