Some modifications of Scott's theorem on injective spaces

D. Scott in his paper [5] on the mathematical models for the Church-Curry -calculus proved the following theorem.A topological space X. is an absolute extensor for the category of all topological spaces iff a contraction of X. is a topological space of Scott's open sets in a continuous lattice.In this paper we prove a generalization of this theorem for the category of , -closure spaces. The main theorem says that, for some cardinal numbers , , absolute extensors for the category of , -closure spaces are exactly , -closure spaces of , -filters in , >-semidistributive lattices (Theorem 3.5).If = and = we obtain Scott's Theorem (Corollary 2.1). If = 0 and = we obtain a characterization of closure spaces of filters in a complete Heyting lattice (Corollary 3.4). If = 0 and = we obtain a characterization of closure space of all principial filters in a completely distributive complete lattice (Corollary 3.3).     

On a problem of P(α, δ, π) concerning generalized Alexandroff s cube

Universality of generalized Alexandroff's cube plays essential role in theory of absolute retracts for the category of , -closure spaces. Alexandroff's cube. is an , -closure space generated by the family of all complete filters. in a lattice of all subsets of a set of power .Condition P(, , ) says that is a closure space of all , -filters in the lattice ( ), .Assuming that P (, , ) holds, in the paper [2], there are given sufficient conditions saying when an , -closure space is an absolute retract for the category of , -closure spaces (see Theorems 2.1 and 3.4 in [2]).It seems that, under assumption that P (, , ) holds, it will be possible to givean uniform characterization of absolute retracts for the category of , -closure-spaces.Except Lemma 3.1 from [1], there is no information when the condition P (, , ) holds or when it does not hold.The main result of this paper says, that there are examples of cardinal numbers, , , such that P (, , ) is not satisfied.Namely it is proved, using elementary properties of Lebesgue measure on the real line, that the condition P (, ₁, 2 ) is not satisfied.Moreover it is shown that fulfillment of the condition is essential assumption in, Theorems 2.1 and 3.4 from [1] i.e. it cannot be eliminated.     

Three prepositional calculi of probability

Attempts are made to transform the basis of elementary probability theory into the logical calculus.We obtain the propositional calculus NP by a naive approach. As rules of transformation, NP has rules of the classical propositional logic (for events), rules of the ukasiewicz logic ₀ (for probabilities) and axioms of probability theory, in the form of rules of inference. We prove equivalence of NP with a fragmentary probability theory, in which one may only add and subtract probabilities.The second calculus MP is a usual modal propositional calculus. It has the modal rules x x, x y x y, x x, x y (y x), (y x), in addition to the rules of classical propositional logic. One may read x as x is probable. Imbeddings of NP and of ₀ into MP are given.The third calculus P is a modal extension of ₀. It may be obtained by adding the rule ((xy)y) xy to the modal logic of quantum mechanics Q [5]. One may read x in P as x is observed. An imbedding of NP into P is given.     

Modal logic with names

We investigate an enrichment of the propositional modal language with a universal modality having semanticsx iff y(y ), and a countable set of names — a special kind of propositional variables ranging over singleton sets of worlds. The obtained language _c proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment () of, where is an additional modality with the semanticsx iff y(y x y ). Model-theoretic characterizations of modal definability in these languages are obtained. Further we consider deductive systems in _c. Strong completeness of the normal _c-logics is proved with respect to models in which all worlds are named. Every _c-logic axiomatized by formulae containing only names (but not propositional variables) is proved to be strongly frame-complete. Problems concerning transfer of properties ([in]completeness, filtration, finite model property etc.) from to _c are discussed. Finally, further perspectives for names in multimodal environment are briefly sketched.     

The Self Psychology of Heinz Kohut: What's It All About Theologically?

As a psychoanalytic thinker who offered by means of his self psychology a new paradigm of psychological development and functioning, Heinz Kohut was also a theologian manqué. With the help of the method of interpretation devised by Paul Tillich and David Tracy, Kohut's limit-concepts of tragic man, the self-object, and empathy, all set within his theory of narcissism, are elucidated as theological constructs. These are critiqued for adequacy from a Christian perspective. The conclusion is that Kohut's understanding of the human dilemma and of the way of salvation correlates well with Christianity, while his view of empathy as the means of salvation has created some confusion. Kohut has thus left an unfinished, profoundly important, agenda for theologians and clinicians.     

A semantical investigation into Leśniewski's axiom of his ontology

A structure A for the language L, which is the first-order language (without equality) whose only nonlogical symbol is the binary predicate symbol , is called a quasi -struoture iff (a) the universe A of A consists of sets and (b) a b is true in A ([p) a = {p } & p b] for every a and b in A, where a(b) is the name of a (b). A quasi -structure A is called an -structure iff (c) {p } A whenever p a A. Then a closed formula in L is derivable from Leniewski's axiom x, y[x y u (u x) u; v(u, v x u v) u(u x u y)] (from the axiom x, y(x y x x) x, y, z(x y z y x z)) iff is true in every -structure (in every quasi -structure).     

Some notes on the nature of methodological indeterminacy

This paper is an attempt to extend the meaning of the concept of indeterminacy for the human sciences. The authors do this by coining the term methodological indeterminacy and arguing that indeterminacy is better understood when linked to specific methodological techniques. Paradoxically, while specific research techniques demonstrate that the issue of indeterminacy is complex, yielding the possibility of types and degrees, it does not eliminate the problem of translation first raised by Quine. However, the authors go on to argue that, from a research perspective, indeterminacy can and must be approached in such a way that it is possible to reduce cases of it, even though never completely eliminating it in the human sciences.     

On a statistic arising in testing correlation

This paper is devoted to the study of a certain statistic,u, defined on samples from a bivariate population with variances ₁₁, ₂₂ and correlation . Let the parameter corresponding tou be . Under binormality assumptions the following is demonstrated. (i) If ₁₁ = ₂₂, then the distribution ofu can be obtained rapidly from theF distribution. Statistical inferences about = may be based onF. (ii) In the general case, allowing for _{11 22}, a certain quantity involvingu,r (sample correlation between the variables) and follows at distribution. Statistical inferences about may be based ont. (iii) In the general case a quantityt may be constructed which involves only the statisticu and only the parameter . If treated like at distributed magnitude,t admits conservative statistical inferences. (iv) TheF distributed quantity mentioned in (i) is equivalent to a certaint distributed quantity as follows from an appropriate transformation of the variable. (v) Three test statistics are given which can be utilized in making statistical inferences about = in the case ₁₁ = ₂₂. A comparison of expected lengths of confidence intervals for obtained from the three test statistics is made. (vi) The use of the formulas derived is illustrated by means of an application to coefficient alpha.This research was supported by the National Institute of Child Health and Human Development, under Research Grant 1 PO1 HD01762.     

O pojęciu zdania analitycznego

Rezultaty przedstawione w pracy niniejszej pokrywaj si czciowo z wynikami osignitymi przezR. Wójcickiego w pracy:Analityczne komponenty definicji arbitralnych. Studia Logica, t. XIV. Dotyczy to gównie rezultatów zawartych w czci pierwszej. Chciabym podkreli, i wyniki R. Wójcickiego uzyskane zostay cakowicie niezalenie od rezultatów przedstawionych w pracy obecnej.Allatum est die 16 Aprilis 1962     

Theorem counting

Consider the set of tautologies of the classical propositional calculus containing no connective other than and, or, and not. Consider the subset of this set containing tautologies in exactlyn propositional variables. This paper provides a method for determining the number of equivalence classes of each such subset modulo equivalence in the infinite-valued Lukasiewicz propositional calculus.