A 2-categorial Generalization of the Concept of Institution

After defining, for each many-sorted signature Σ = (S, Σ), the category Ter(Σ), of generalized terms for Σ (which is the dual of the Kleisli category for \mathbb T_S{\mathbb {T}_{\bf \Sigma}}, the monad in Set ^S determined by the adjunction T_S \dashv G_S{{\bf T}_{\bf \Sigma} \dashv {\rm G}_{\bf \Sigma}} from Set ^S to Alg(Σ), the category of Σ-algebras), we assign, to a signature morphism d from Σ to Λ, the functor d_à{{\bf d}_\diamond} from Ter(Σ) to Ter(Λ). Once defined the mappings that assign, respectively, to a many-sorted signature the corresponding category of generalized terms and to a signature morphism the functor between the associated categories of generalized terms, we state that both mappings are actually the components of a pseudo-functor Ter from Sig to the 2-category Cat. Next we prove that there is a functor Tr^Σ, of realization of generalized terms as term operations, from Alg(Σ) × Ter(Σ) to Set, that simultaneously formalizes the procedure of realization of generalized terms and its naturalness (by taking into account the variation of the algebras through the homomorphisms between them). We remark that from this fact we will get the invariance of the relation of satisfaction under signature change. Moreover, we prove that, for each signature morphism d from Σ to Λ, there exists a natural isomorphism θ ^d from the functor Tr^L °(Id ×d_à){{{\rm Tr}^{\bf {\bf \Lambda}} \circ ({\rm Id} \times {\bf d}_\diamond)}} to the functor Tr^S °(d^* ×Id){{\rm Tr}^{\bf \Sigma} \circ ({\bf d}^* \times {\rm Id})}, both from the category Alg(Λ) × Ter(Σ) to the category Set, where d* is the value at d of the arrow mapping of a contravariant functor Alg from Sig to Cat, that shows the invariant character of the procedure of realization of generalized terms under signature change. Finally, we construct the many-sorted term institution by combining adequately the above components (and, in a derived way, the many-sorted specification institution), but for a strict generalization of the standard notion of institution.     

An Adaptive Logic Based on Jaśkowskiˈs Approach to Paraconsistency

In this paper, I present the modal adaptive logic AJ ^r (based on S5) as well as the discussive logic D ^r ₂ that is defined from it. D ^r ₂ is a (non-monotonic) alternative for Jaśkowski’s paraconsistent system D ₂ . Like D ₂ , D ^r ₂ validates all single-premise rules of Classical Logic. However, for formulas that behave consistently, D ^r ₂ moreover validates all multiple-premise rules of Classical Logic. Importantly, and unlike in the case of D ₂ , this does not require the introduction of discussive connectives. It is argued that this has clear advantages with respect to one of the main application contexts of discussive logics, namely the interpretation of discussions.*Research for this paper was indirectly supported by the Flemish Minister responsible for Science and Technology (contract BIL1/8). The author is indebted to Leon Horsten, Jo?o Marcos, Jerzy Perzanowski, Liza Verhoeven, and especially to the referee and to Diderik Batens for comments and suggestions.     

Activities of the member societies

Abstract

The impact and legacy of Karen Horney 1885-1952

The William Alanson White Institute of Psychiatry, Psychoanalysis and Psychology White Institute Elects New Editor

News from the Association for the Advancement of Psychoanalysis, New York, USA

News from Brazil:

Conferences

The Karen Horney Psychoanalytic Institute and Center

The William Alanson White Institute

The VII Scientific Conference of IFPS was held in Munich, August 26-29th 1992. Theme: Psychoanalysis between conformity and opposition.

The V Nordic Conference for members from IFPS Societies in Finland, Norway and Sweden will be held near Stockholm, January 23-24, 1993.     

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     

Proof theory and mathematical meaning of paraconsistent C-systems

A proof-theoretic analysis and new arithmetical semantics are proposed for some paraconsistent C-systems, which are a relevant sub-class of Logics of Formal Inconsistency (LFIs) introduced by W.A. Carnielli et al. (2002, 2005) [8] and [9]. The sequent versions BC, CI, CIL of the systems bC, Ci, Cil presented in Carnielli et al. (2002, 2005) [8] and [9] are introduced and examined. BC, CI, CIL admit the cut-elimination property and, in general, a weakened sub-formula property. Moreover, a formal notion of constructive paraconsistent system is given, and the constructivity of CI is proven. Further possible developments of proof theory and provability logic of CI-based arithmetical systems are sketched, and a possible weakened Hilbert?s program is discussed. As to the semantical aspects, arithmetical semantics interprets C-system formulas into Provability Logic sentences of classical Arithmetic PA (Artemov and Beklemishev (2004) [2], Japaridze and de Jongh (1998) [19], Gentilini (1999) [15], Smorynski (1991) [22]): thus, it links the notion of truth to the notion of provability inside a classical environment. It makes true infinitely many contradictions B∧¬B and falsifies many arbitrarily complex instances of non-contradiction principle ¬(A∧¬A). Moreover, arithmetical models falsify both classical logic LK and intuitionistic logic LJ, so that a kind of metalogical completeness property of LFI-paraconsistent logic w.r.t. arithmetical semantics is proven. As a work in progress, the possibility to interpret CI-based paraconsistent Arithmetic PACI into Provability Logic of classical Arithmetic PA is discussed, showing the role that PACIarithmetical models could have in establishing new meta-mathematical properties, e.g. in breaking classical equivalences between consistency statements and reflection principles.     

Algebraic logic for classical conjunction and disjunction

In this paper we study the relations between the fragment L of classical logic having just conjunction and disjunction and the variety D of distributive lattices, within the context of Algebraic Logic. We prove that these relations cannot be fully expressed either with the tools of Blok and Pigozzi's theory of algebraizable logics or with the use of reduced matrices for L. However, these relations can be naturally formulated when we introduce a new notion of model of a sequent calculus. When applied to a certain natural calculus for L, the resulting models are equivalent to a class of abstract logics (in the sense of Brown and Suszko) which we call distributive. Among other results, we prove that D is exactly the class of the algebraic reducts of the reduced models of L, that there is an embedding of the theories of L into the theories of the equational consequence (in the sense of Blok and Pigozzi) relative to D, and that for any algebra A of type (2,2) there is an isomorphism between the D-congruences of A and the models of L over A. In the second part of this paper (which will be published separately) we will also apply some results to give proofs with a logical flavour for several new or well-known lattice-theoretical properties.Dedicated to our master, Francesc d'A. Sales, on his 75th birthday     

A Negationless Interpretation of Intuitionistic Theories. I

The present work contains an axiomatic treatment of some parts of the restricted version of intuitionistic mathematics advocated by G. F. C. Griss, also known as negationless intuitionistic mathematics. Formal systems NPC, NA, and FIM ^N for negationless predicate logic, arithmetic, and analysis are proposed. Our Theorem 4 in Section 2 asserts the translatability of Heyting's arithmetic HAinto NA. The result can in fact be extended to a large class of intuitionistic theories based on HAand their negationless counterparts. For instance, in Section 3 this is shown for Kleene's system of intuitionistic analysis FIMand our FIM ^N . This revised version was published online in June 2006 with corrections to the Cover Date.     

Internal approach to external sets and universes

A problem which enthusiasts ofIST, Nelson's internal set theory, usually face is how to treat external sets in the internal universe which does not contain them directly. To solve this problem, we considerBST,bounded set theory, a modification ofIST which is, briefly, a theory for the family of thoseIST sets which are members of standard sets.We show thatBST is strong enough to incorporate external sets in the internal universe in a way sufficient to develop the most advanced applications of nonstandard methods. In particular, we define inBST an enlargement of theBST universe which satisfies the axioms ofHST, an external theory close to a theory introduced by Hrbaek. HST includes Replacement and Saturation for all formulas but contradicts the Power Set and Choice axioms (either of them is incompatible with Replacement plus Saturation), therefore to get an external universe which satisfies all ofZFC minus Regularity one has to pay by a restriction of Saturation. We prove thatHST admits a system of subuniverses which modelZFC (minus Regularity but with Power Set and Choice) and Saturation in a form restricted by a fixed but arbitrary standard cardinal.Thus the proposed system of set theoretic foundations for nonstandard mathematics, based on the simple and natural axioms of the internal theoryBST, provides the treatment of external sets sufficient to carry out elaborate external constructions.Partially supported by AMS grants in 1993 and 1994 and DFG grant in 1994.Presented byRobert Goldblatt     

An Incomplete Relevant Modal Logic

The relevant modal logic G is a simple extension of the logic RT, the relevant counterpart of the familiar classically based system T. Using the Routley–Meyer semantics for relevant modal logics, this paper proves three main results regarding G: (i) G is semantically complete, but only with a non-standard interpretation of necessity. From this, however, other nice properties follow. (ii) With a standard interpretation of necessity, G is semantically incomplete; there is no class of frames that characterizes G. (iii) The class of frames for G characterizes the classically based logic T.     

The Incompleteness of RGL

RGLis a version of the modal logic GLbased on the relevant logic R. It is shown that the class of RKframes that verify all theorems of RGLalso verify a scheme that we call (!). If RGLhas (!) as a theorem, however, it is not a relevant logic. I go on to show that not all instances of (!) are theorems of RGL, hence this logic is not complete over any class of RKframes.     

On the Representation of N4-Lattices

N4-lattices provide algebraic semantics for the logic N4, the paraconsistent variant of Nelson's logic with strong negation. We obtain the representation of N4-lattices showing that the structure of an arbitrary N4-lattice is completely determined by a suitable implicative lattice with distinguished filter and ideal. We introduce also special filters on N4-lattices and prove that special filters are exactly kernels of homomorphisms. Criteria of embeddability and to be a homomorphic image are obtained for N4-lattices in terms of the above mentioned representation. Finally, subdirectly irreducible N4-lattices are described.     

The Tarasoff Warning and the Duty to Protect

Summary

Since the case of Tarasoff v. Regents of the University of California, mental health professionals have had an explicit legal duty to warn potential adult victims of violence. Subsequent case law expanded this standard to a broader duty-to-protect. Primary health care providers are increasingly treating psychiatric patients for whom the duty to protect is applicable. However, these providers are often unaware of the legal, ethical, and clinical issues involved. Assessment of violence risk should include demographic, psychiatric, and social dimensions. Interventions include notifying law enforcement authorities, potential victims, and possible use of psychiatric hospitalization to prevent aggressive behavior. The duty-to-protect as a standard-of-care has been applied to several other clinical situations, including impaired driving capacity, high-risk HIV behavior, and child sexual abuse. The article includes a step-by-step clinical protocol for evaluation and intervention in dangerous situations.     

Internal approach to external sets and universes

In this article we show how the universe ofBST,bounded set theory (a modification ofIST which is, briefly, a theory for the family of those sets inIST which are members of standard sets) can be enlarged by definable subclasses of sets (which are not necessarily sest in internal theories likeBST orIST) so that Separation and Replacement are true in the enlargement for all formulas, including those in which the standardness predicate may occur.ThusBST is strong enough to incorporate external sets in the internal universe in a way sufficient to develop topics in nonstandard analysis inaccessible in the framework of a purely internal approach, such as Loeb measures.Presented byRobert Goldblatt     

Minimally Abnormal Models In Some Adaptive Logics

In an adaptive logic APL, based on a (monotonic) non-standardlogic PL the consequences of can be defined in terms ofa selection of the PL-models of . An important property ofthe adaptive logics ACLuN1, ACLuN2, ACLuNs1, andACLuNs2 logics is proved: whenever a model is not selected, this isjustified in terms of a selected model (Strong Reassurance). Theproperty fails for Priest's LP ^m because its way of measuring thedegree of abnormality of a model is incoherent – correcting thisdelivers the property.     

Varieties of Three-Valued Heyting Algebras with a Quantifier

This paper is devoted to the study of some subvarieties of the variety Qof Q-Heyting algebras, that is, Heyting algebras with a quantifier. In particular, a deeper investigation is carried out in the variety Q ₃ of three-valued Q-Heyting algebras to show that the structure of the lattice of subvarieties of Qis far more complicated that the lattice of subvarieties of Heyting algebras. We determine the simple and subdirectly irreducible algebras in Q ₃ and we construct the lattice of subvarieties (Q ₃ ) of the variety Q ₃ .     

There is no clam with coats in the calm coast: Delimiting the transposed-letter priming effect

In this article, we explore the transposed-letter priming effect (e.g., jugde–JUDGE vs. jupte–JUDGE), a phenomenon that taps into some key issues on how the brain encodes letter positions and has favoured the creation of new input coding schemes. However, almost all the empirical evidence from transposed-letter priming experiments comes from nonword primes (e.g., jugde–JUDGE). Indeed, previous evidence when using word–word pairs (e.g., causal–CASUAL) is not conclusive. Here, we conducted five masked priming lexical decision experiments that examined the relationship between pairs of real words that differed only in the transposition of two of their letters (e.g., CASUAL vs. CAUSAL). Results showed that, unlike transposed-letter nonwords, transposed-letter words do not seem to affect the identification time of their transposed-letter mates. Thus, prime lexicality is a key factor that modulates the magnitude of transposed-letter priming effects. These results are interpreted under the assumption of the existence of lateral inhibition processes occurring within the lexical level—which cancels out any orthographic facilitation due to the overlapping letters. We examine the implications of these findings for models of visual-word recognition.     

A Rule-Extension of the Non-Associative Lambek Calculus

An extension L ⁺ of the non-associative Lambek calculus Lis defined. In L ⁺ the restriction to formula-conclusion sequents is given up, and additional left introduction rules for the directional implications are introduced. The system L ⁺ is sound and complete with respect to a modification of the ternary frame semantics for L.     

Axiomatization and completeness of uncountably valued approximation logic

A first order uncountably valued logicL _Q(0,1) for management of uncertainty is considered. It is obtained from approximation logicsL _T of any poset type (T, ) (see Rasiowa [17], [18], [19]) by assuming (T, )=(Q(0, 1), ) — whereQ(0, 1) is the set of all rational numbersq such that 0<q<1 and is the arithmetic ordering — by eliminating modal connectives and adopting a semantics based onLT-fuzzy sets (see Rasiowa and Cat Ho [20], [21]). LogicL _Q(0,1) can be treated as an important case ofLT-fuzzy logics (introduced in Rasiowa and Cat Ho [21]) for (T, )=(Q(0, 1), ), i.e. asLQ(0, 1)-fuzzy logic announced in [21] but first examined in this paper.L _Q(0,1) deals with vague concepts represented by predicate formulas and applies approximate truth-values being certain subsets ofQ(0, 1). The set of all approximate truth-values consists of the empty set ø and all non-empty subsetss ofQ(0, 1) such that ifqs andqq, thenqs. The setLQ(0, 1) of all approximate truth-values is uncountable and covers up to monomorphism the closed interval [0, 1] of the real line.LQ(0, 1) is a complete set lattice and therefore a pseudo-Boolean (Heyting) algebra. Equipped with some additional operations it is a basic plain semi-Post algebra of typeQ(0, 1) (see Rasiowa and Cat Ho [20]) and is taken as a truth-table forL _Q(0,1) logic.L _Q(0,1) can be considered as a modification of Zadeh's fuzzy logic (see Bellman and Zadeh [2] and Zadeh and Kacprzyk, eds. [29]). The aim of this paper is an axiomatization of logicL _Q(0,1) and proofs of the completeness theorem and of the theorem on the existence ofLQ(0, 1)-models (i.e. models under the semantics introduced) for consistent theories based on any denumerable set of specific axioms. Proofs apply the theory of plain semi-Post algebras investigated in Cat Ho and Rasiowa [4].Presented byCecylia Rauszer     

Stillness into Storm

Edward Edinger's Seminars: Transformation of Libido, 1994, C.G. Jung Institute of Los Angeles

Mystery of the Coniunctio, 1994, Inner City Books

The Mysterium Lectures, 1995, Inner City Books

The Eternal Drama: The Inner Meaning of Greek Mythology. 1994. By Edward F. Edinger. Edited by Deborah Wesley. Boston and London: Shambala.

Melville's Moby-Dick: An American Nekyia. 1995. By Edward F. Edinger. Toronto: Inner City Books.

Under Saturn's Shadow: The Wounding and Healing of Men. By James Hollis. Toronto: Inner City Books, 1994.

Dreaming the End of the World: Apocalypse as Rite of Passage. By Michael Ortiz Hill. Dallas: Spring Publications, 1994.

Incest Fastasies and Self-Destructive Acts: Jungian and Post-Jungian Psychotherapy in Adolescence. 1995. Edited by Mara Sidoli and Gustav Bovensiepen. New Brunswick, MD: Transaction Publishers.

If Someone Speaks It Gets Lighter. Year. By Lynda Share. New Jersey: The Analytic Press, Inc., 1994.     

Statement of Removal

The Journal, Publisher and Author have agreed to remove this article having received expressions of concern regarding the representation of certain clinical data.

For more information, please contact the Publisher or Editor of this Journal.

Article title: Thinking Developmentally: A Contemporary Psychoanalytic Perspective

Authors: Sally Bloom-Feshbach

Journal: Journal of Infant, Child, and Adolescent Psychotherapy

Citation information: Volume 17, Number 2, pages 91–95

Version of Record Published Online: 31 May 2018

DOI: http://dx.doi.org/10.1080/15289168.2018.1456122