“Soul-making” in a schizophrenic saint

Soul-making (cf. Jung and Hillman) is the process of integrating spiritual and bodily imagery into an intimated wholeness transcending conscious comprehension. Pierre Janet's case of the psychotic mystic, Madeleine, reveals that the patient had been making her own-soul even though his theory had no provision for soul. Janet's soul-stripping theory is contrasted with a soul-making approach, primarily in their respective interpretations of Madeleine's altered states of consciousness. Religious ecstasy is a stretching of soul, an expansion into the realm of spirit, which requires a subsequent descent into and reconciliation with tradition, society, outer world, and body.     

Независимость одной системы аксиом и правила вывода пропозиционального исчисления

- Allatum est die 5 Martii 1970     

Intuitionistic uniformity principles for propositions and some applications

This note deals with the prepositional uniformity principlep-UP: p x N A (p, x) x N p A (p, x) ( species of all propositions) in intuitionistic mathematics.p-UP is implied by WC and KS. But there are interestingp-UP-cases which require weak KS resp. WC only. UP for number species follows fromp-UP by extended bar-induction (ranging over propositions) and suitable weak continuity. As corollaries we have the disjunction property and the existential definability w.r.t. concrete objects. Other consequences are: there is no non-trivial countable partition of;id is the only injective function from to; there are no many-place injective prepositional functions; card () is incomparable with the cardinality of all metric spaces containing at least three elements.     

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).     

On the logic of conscious belief

In this paper we are discussing a version of propositional belief logic, denoted by LB, in which so-called axioms of introspection (B BB and B B B) are added to the usual ones. LB is proved to be sound and complete with respect to Boolean algebras equipped with proper filters (Theorem 5). Interpretations in classical theories (Theorem 4) are also considered. A few modifications of LB are further dealt with, one of which turns out to be S5.     

Omega-consistency and the diamond

G is the result of adjoining the schema (qAA)qA to K; the axioms of G* are the theorems of G and the instances of the schema qAA and the sole rule of G* is modus ponens. A sentence is -provable if it is provable in P(eano) A(rithmetic) by one application of the -rule; equivalently, if its negation is -inconsistent in PA. Let -Bew(x) be the natural formalization of the notion of -provability. For any modal sentence A and function mapping sentence letters to sentences of PA, inductively define A by: p = (p) (p a sentence letter); = ; (AB)su}= (A B); and (qA)= -Bew(A )(S) is the numeral for the Gödel number of the sentence S). Then, applying techniques of Solovay (Israel Journal of Mathematics 25, pp. 287–304), we prove that for every modal sentence A, _G A iff for all , _PA A ; and for every modal sentence A, _G* A iff for all , A is true.I should like to thank David Auerbach and Rohit Parikh.     

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.     

Iconic memory — an artifact of perceptual reconstruction processes?

Summary Two experiments, using a partial vs. whole report procedure to isolate iconic from short-term memory loss, are reported. In the first experiment 10 Ss had to judge the difference between two line lengths in a display of three pairs of lines (in rows). Results showed no significant variation in d' with cue delay in spite of a medium overall performance, and in contrast to preliminary partial/whole report experiments. To counter the possibility that the short-term memory load was too small in this experiment, a second experiment was performed with displays containing nine instead of three pairs, i.e., three pairs per row. Equivalence of performance for all conditions was about the same as before. This was true for both hit- and false-alarm rates. The results are interpreted as evidence against the view of iconic memory as a high capacity store containing a lot of information. An alternative reconstructive theory is put forward to explain both conventional iconic loss and our results. According to this account, partial report measures processed material rather than reflecting an iconic store of uninterpreted sensory events. Some consequences of this model are discussed in the context of some weak effects in our data; and suggestions are put forward for further investigation of visual processing.The experiments to be reported here were made possible by grant Schu 421/1–2 of the Deutsche Forschungsgemeinschaft. The main results of Experiment II have already been reported at the European Conference on Visual Perception at Nordwijkerhout, October 1979. I am indebted to Mrs. R. Ledebur, cand. phil, and Dipl.-Psych. G. Gros who collected the data. I also wish to thank Dr. A. Reeves (Dortmund) for helpful comments on an earlier version of this paper. Dr. P. Wolff (Osnabrück) and two anonymous reviewers contributed valuable suggestions concerning the final draft     

Oral production of linguistically complex sentences with meaning relationships of time

The purpose of this investigation was to determine the abilities of children to use the adjoining mechanism in combining two constituent sentences with the temporal adjoiners: after, before, until, when, and while. To elicit responses, a sentence repetition task was devised that included these five temporal adjoiners in four different syntactic environments: transitive sentences with the adjoiner and the subordinate clause following the main clause, transitive sentences with the adjoiner and the subordinate clause preceding the main clause, intransitive sentences with the adjoiner and the subordinate clause following the main clause, and intransitive sentences with the adjoiner and the subordinate clause preceding the main clause. The 30 were between the ages of 4O and 66 years. They were average children who were free from any known emotional disturbance, who were acquiring Standard American English as a native language, who had normal speech and hearing, and whose parents had neither very high nor very low socioeconomic status. To the extent that the children in this study were representative of normal-speaking children of their ages, certain general conclusions were drawn. Children begin to use the temporal adjoining mechanism early, but they do not master it by the age of 66 years. The ability to use the adjoiners, nor is it equal for different syntactic structures nor for all degrees of semantic complexity. After, before, and when appear earlier than while and until. A rapid period of growth in learning to use the temporal adjoining mechanism occurs between the ages of 4 and 5 years. However, a plateau of learning appears to be reached between the ages of 5 and 6 years. In general, children first learn to use the temporal adjoining mechanism in intransitive sentences with the adjoining link in the middle or at the beginning of the utterance. Next, they learn to use it in transitive sentences with the adjoining link at the beginning of the utterance. Finally, they learn to use it in transitive sentences with the adjoining link in the middle of the utterance. In transitive sentences, children appear to learn the rule for placing the subordinate clause at the beginning of the utterance when temporally adjoining two constituent sentences before they learn the base structure rule. In intransitive sentences, they appear to learn the rule for placing the subordinate clause at the beginning of the utterance when temporally adjoining two constituent sentences at the same time that they learn the base structure rule. The underlying semantic relationships that are expressed by specific temporal adjoiners are important determinants of children's abilities to use these adjoiners. In linguistic evaluations, one should consider the syntactic environment in which the temporal adjoiner occurs and assume that after, before, and when are developmentally earlier than while and until.     

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     

Test of the violation of local realism in quantum mechanics with no use of Bell's inequalities

A novel and versatile polarization-entanglement scheme is adopted to investigate the violation of the EPR local realism for a non-maximally entangled two-photon system according to the recent nonlocality proof by Lucien Hardy. In this context the adoption of a sophisticated detection method allows direct determination of any element of physical reality (viz., determined with probability equal to unity in the words of Einstein, Podolsky and Rosen) for the pair system within complete measurements that are largely insensitive to the detector quantum-efficiencies and noise.     

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.     

Two Orientations to Sin in the Human Predicament

Two orientations to sin proposed in Valerie Saiving's feminine view of the human situation (1960) are analyzed and developed, suggesting different ways they can be manifested in the lives of both men and women. These ways (of trusting the world) are paired and contrasted with ways of trusting God in order to aid pastors in counseling and teaching about the human predicament.     

Kenneth Strike on Liberalism,Citizenship and the Private Interest in Schooling

After indicating a number of points of agreement with the argument 0eveloped by Kenneth Strike in his article Liberalism, Citizenship and the Private Interest in Schooling, this article identifies and explores a number of queries and criticisms which arise in relation to that argument. These queries and criticisms relate especially to the nature and extent of the expansiveness involved in Strike's conception of public or common educational influence, and to the implications and justification of the claim that private educational interests enjoy a greater salience and recognition on Strike's view of public or common educational influence than on some alternative views.     

Varieties of Monadic Heyting Algebras. Part III

This paper is the concluding part of [1] and [2], and it investigates the inner structure of the lattice (MHA) of all varieties of monadic Heyting algebras. For every n , we introduce and investigate varieties of depth n and cluster n, and present two partitions of (MHA), into varieties of depth n, and into varieties of cluster n. We pay a special attention to the lower part of (MHA) and investigate finite and critical varieties of monadic Heyting algebras in detail. In particular, we prove that there exist exactly thirteen critical varieties in (MHA) and that it is decidable whether a given variety of monadic Heyting algebras is finite or not. The representation of (MHA) is also given. All these provide us with a satisfactory insight into (MHA). Since (MHA) is dual to the lattice NExtMIPC of all normal extensions of the intuitionistic modal logic MIPC, we also obtain a clearer picture of the lattice structure of intuitionistic modal logics over MIPC.     

A game-based formal system for Ł∞

A formal system for , based on a game-theoretic analysis of the ukasiewicz prepositional connectives, is defined and proved to be complete. An Herbrand theorem for the predicate calculus (a variant of some work of Mostowski) and some corollaries relating to its axiomatizability are proved. The predicate calculus with equality is also considered.     

The logic of linear tolerance

A nonempty sequence T₁,...,T_n of theories is tolerant, if there are consistent theories T ₁ ⁺ ,..., T _n ⁺ such that for each 1 i n, T _i ⁺ is an extension of T_i in the same language and, if i n, T _i ⁺ interprets T _i+1 ⁺ . We consider a propositional language with the modality , the arity of which is not fixed, and axiomatically define in this language the decidable logics TOL and TOL. It is shown that TOL (resp. TOL) yields exactly the schemata of PA-provable (resp. true) arithmetical sentences, if (A₁,..., A_n) is understood as (a formalization of) PA+A₁, ..., PA+A_n is tolerant.     

On a complexity-based way of constructivizing the recursive functions

Let g _E(m, n)=o mean that n is the Gödel-number of the shortest derivation from E of an equation of the form (m)=k. Hao Wang suggests that the condition for general recursiveness mn(g _E(m, n)=o) can be proved constructively if one can find a speedfunction _{s s}, with _s(m) bounding the number of steps for getting a value of (m), such that mn _s(m) s.t. g _E(m, n)=o. This idea, he thinks, yields a constructivist notion of an effectively computable function, one that doesn't get us into a vicious circle since we intuitively know, to begin with, that certain proofs are constructive and certain functions effectively computable. This paper gives a broad possibility proof for the existence of such classes of effectively computable functions, with Wang's idea of effective computability generalized along a number of dimensions.We are grateful to an anonymous referee for Studia Logica for valuable advice leading to substantial improvements in the presentation of the main definitions and theorem.     

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.