DESIRE AND RESPONSIBILITY: THE ETHICS OF COUNTERTRANSFERENCE EXPERIENCE

The analyst's desire expressed in impactful wishes and intentions is foundational to countertransference experience, yet undertheorized in the literature. The “wider” countertransference view, associated with neo‐Kleinian theory, obscures the nature of countertransference and the analyst's contribution to it. A systematic analysis of the logic of desire as an intentional mental state is presented. Racker's (1957) talion law and Lacan's (1992) theory of the dual relation illustrate the problems that obtain with a wholesale embrace of the wider countertransference perspective. The ethical burden placed on the analyst in light of the role played by desire in countertransference is substantial. Lacan's ethics of desire and Benjamin's (2004) concept of the moral third are discussed.     

On the Standard and Rational Completeness of some Axiomatic Extensions of the Monoidal T-norm Logic

The monoidal t-norm based logic MTL is obtained from Hájek's Basic Fuzzy logic BL by dropping the divisibility condition for the strong (or monoidal) conjunction. Recently, Jenei and Montgana have shown MTL to be standard complete, i.e. complete with respect to the class of residuated lattices in the real unit interval [0,1] defined by left-continuous t-norms and their residua. Its corresponding algebraic semantics is given by pre-linear residuated lattices. In this paper we address the issue of standard and rational completeness (rational completeness meaning completeness with respect to a class of algebras in the rational unit interval [0,1]) of some important axiomatic extensions of MTL corresponding to well-known parallel extensions of BL. Moreover, we investigate varieties of MTL algebras whose linearly ordered countable algebras embed into algebras whose lattice reduct is the real and/or the rational interval [0,1]. These embedding properties are used to investigate finite strong standard and/or rational completeness of the corresponding logics.     

婚姻关系、亲子关系对3～6岁幼儿心理行为问题的影响

采用CBCL量表、自编的婚姻关系和亲子关系问卷调查了6所城市幼儿园的457名3～6岁幼儿,结果发现：(1)本研究中3～6岁幼儿心理行为问题的检出率为15．10％;(2)3-6岁幼儿的心理行为问题主要表现为交往不良、攻击性等外部行为问题;(3)没有心理行为问题的幼儿家庭其婚姻关系在性格相容、问题解决和性生活方面显著优于有心理行为问题的幼儿家庭,但在经济条件方面则相反;(4)婚姻关系和亲子关系则呈显著的正相关,并共同影响幼儿的心理行为问题。     

Embedding Logics into Product Logic

We construct a faithful interpretation of ukasiewicz's logic in product logic (both propositional and predicate). Using known facts it follows that the product predicate logic is not recursively axiomatizable.We prove a completeness theorem for product logic extended by a unary connective of Baaz [1]. We show that Gödel's logic is a sublogic of this extended product logic.We also prove NP-completeness of the set of propositional formulas satisfiable in product logic (resp. in Gödel's logic).     

Arrow Logic and Infinite Counting

We consider arrow logics (i.e., propositional multi-modal logics having three -- a dyadic, a monadic, and a constant -- modal operators) augmented with various kinds of infinite counting modalities, such as 'much more', 'of good quantity', 'many times'. It is shown that the addition of these modal operators to weakly associative arrow logic results in finitely axiomatizable and decidable logics, which fail to have the finite base property.     

基于遗传算法的模糊综合评价在心理测量中的应用

提出了运用模糊数学对利克特量表数据进行分析的方法, 探讨了人们在进行模糊综合评价时, 所采用的算子和对各个自变量的权重分配, 并且运用遗传算法(GA)来确定相关的权重。以大学生对康师傅红烧牛肉面的评价数据为例, 运用基于遗传算法的模糊综合评价方法, 发现男生采用了“最大最小”合成算子, 女生采用了“有界和、取小”合成算子。研究结果表明, 基于遗传算法的模糊综合评价方法可以对利克特量表的心理测量数据进行有效的分析。     

On Fork Arrow Logic and its Expressive Power

We compare fork arrow logic, an extension of arrow logic, and its natural first-order counterpart (the correspondence language) and show that both have the same expressive power. Arrow logic is a modal logic for reasoning about arrow structures, its expressive power is limited to a bounded fragment of first-order logic. Fork arrow logic is obtained by adding to arrow logic the fork modality (related to parallelism and synchronization). As a result, fork arrow logic attains the expressive power of its first-order correspondence language, so both can express the same input–output behavior of processes.     

Autoshaping and automaintenance: a neural-network approach

This article presents an interpretation of autoshaping, and positive and negative automaintenance, based on a neural-network model. The model makes no distinction between operant and respondent learning mechanisms, and takes into account knowledge of hippocampal and dopaminergic systems. Four simulations were run, each one using an A-B-A design and four instances of feedfoward architectures. In A, networks received a positive contingency between inputs that simulated a conditioned stimulus (CS) and an input that simulated an unconditioned stimulus (US). Responding was simulated as an output activation that was neither elicited by nor required for the US. B was an omission-training procedure. Response directedness was defined as sensory feedback from responding, simulated as a dependence of other inputs on responding. In Simulation 1, the phenomena were simulated with a fully connected architecture and maximally intense response feedback. The other simulations used a partially connected architecture without competition between CS and response feedback. In Simulation 2, a maximally intense feedback resulted in substantial autoshaping and automaintenance. In Simulation 3, eliminating response feedback interfered substantially with autoshaping and automaintenance. In Simulation 4, intermediate autoshaping and automaintenance resulted from an intermediate response feedback. Implications for the operant-respondent distinction and the behavior-neuroscience relation are discussed.     

What is Classical Mereology?

Classical mereology is a formal theory of the part-whole relation, essentially involving a notion of mereological fusion, or sum. There are various different definitions of fusion in the literature, and various axiomatizations for classical mereology. Though the equivalence of the definitions of fusion is provable from axiom sets, the definitions are not logically equivalent, and, hence, are not inter-changeable when laying down the axioms. We examine the relations between the main definitions of fusion and correct some technical errors in prominent discussions of the axiomatization of mereology. We show the equivalence of four different ways to axiomatize classical mereology, using three different notions of fusion. We also clarify the connection between classical mereology and complete Boolean algebra by giving two “neutral” axiom sets which can be supplemented by one or the other of two simple axioms to yield the full theories; one of these uses a notion of “strong complement” that helps explicate the connections between the theories.     

On Vagueness,Truth Values and Fuzzy Logics

Some aspects of vagueness as presented in Shapiro’s book Vagueness in Context [23] are analyzed from the point of fuzzy logic. Presented are some generalizations of Shapiro’s formal apparatus. Presented by Daniele Mundici