Time,quantum mechanics,and decoherence

State-reduction and the notion of actuality are compared to passage through time and the notion of the present; already in classical relativity the latter give rise to difficulties. The solution proposed here is to treat both tense and value-definiteness as relational properties or facts as relations; likewise the notions of change and probability. In both cases essential characteristics are absent: temporal relations are tenselessly true; probabilistic relations are deterministically true.The basic ideas go back to Everett, although the technical development makes use of the decoherent histories theory of Griffiths, Omnès, and Gell-Mann and Hartle. Alternative interpretations of the decoherent histories framework are also considered.I would like to thank Abner Shimony for valuable criticism.     

Pomiar

Tekst referatu wygoszonego w roku 1957 na konferencji wykadowców logiki w Osiecznej, zorganizowanej przez MSW w zwizku z nowym programem logiki dla przyrodników.Allatum est die 25 Julii 1960     

A Translation of Intuitionistic Predicate Logic into Basic Predicate Logic

Basic Predicate Logic, BQC, is a proper subsystem of Intuitionistic Predicate Logic, IQC. For every formula in the language {, , , , , , }, we associate two sequences of formulas 0,1,... and 0,1,... in the same language. We prove that for every sequent , there are natural numbers m, n, such that IQC , iff BQC n m. Some applications of this translation are mentioned.     

Fitting the factor analysis model

When the covariance matrix (p×P) does not satisfy the formal factor analysis model for m factors, there will be no factor matrix (p×m) such that =(-) is diagonal. The factor analysis model may then be replaced by a tautology where is regarded as the covariance matrix of a set of residual variates. These residual variates are linear combinations of discarded common factors and unique factors and are correlated. Maximum likelihood, alpha and iterated principal factor analysis are compared in terms of the manner in which is defined, a maximum determinant derivation for alpha factor analysis being given. Weighted least squares solutions using residual variances and common variances as weights are derived for comparison with the maximum likelihood and alpha solutions. It is shown that the covariance matrix defined by maximum likelihood factor analysis is Gramian, provided that all diagonal elements are nonnegative. Other methods can define a which is nonGramian even when all diagonal elements are nonnegative.A modified version of this paper forms part of a Ph.D. thesis submitted to the University of South Africa.Presently at the National Institute for Personnel Research, South Africa.     

Six-year-old children's understanding of sentences adjoined with time adverbs

The adjoining of clauses with temporal links is the basis for many sentences that convey sequence of events. The present study attempts to delineate 6-year-old children's (N=30) understanding of the meaning sequences imparted by sentences adjoined with after, before, and until. Their performance of the meaning sequence for each of 24 carefully constructed sentences is compared to an adult model. Analysis of the results (using a Wilcoxon Matched Pairs Signed Rank Test) indicated that: (1)Ss understood sentences adjoined with after according to an adult model more frequently than before adjoined sentences (P<0.01); (b) Until adjoined sentences with a negative marker in the main clause were understood according to an adult model more often than until adjoined sentences with no such negative element, but the difference was not significant at a=0.01; (3)Ss understood before adjoined sentences according to an adult model more often than until adjoined sentences, but the difference was not significant at a=0.01. In general, the results indicated that 6-year-olds have not yet completed development of an adult grammar with respect to adjoining clauses with temporal links, after, before, and until.     

Логистическая система, исходными связками которой являются эквивалентность и дизъюнкция

- Allatum est die 5 Martii 1970     

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.     

Variations in use of the term “or”

Two studies showed that adults' responses to questions involving the term or varied markedly depending upon the type of question presented. When presented with various objects (A's and B's) and asked to circle all things which are A or B subjects tended to circle A's as well as B's, whereas when asked to circle all the A's or B's subjects showed a relatively stronger tendency to circle one or the other. Moreover the nature of the sets of objects (As and Bs) influenced behavior as well. There was also evidence that the effects due to question wording or set type transferred.     

Cooperation,Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications

Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as Alternating-time Temporal Logic (ATL). The key insight in ATL is that the path quantifiers of CTL could be replaced by cooperation modalities, of the form , where is a set of agents. The intended interpretation of an ATL formula is that the agents can cooperate to ensure that holds (equivalently, that have a winning strategy for ). In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as group can cooperate to bring about iff it is common knowledge in that . The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems.     

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

- Allatum est die 5 Martii 1970     

Analityczne komponenty definicji arbitralnych

Tre: Wstp. I. Definicje arbitralne. II. Syntetyczne konsekwencje definicji arbitralnych III. Analityczne i rzeczowe komponenty definicji arbitralnych. IV. Zdania analityczne.Artyku ten w nieznacznym tylko stopniu róni si od pracy doktorskiej, któr przedstawiem w 1962 r. Jak najuprzejmiej dzikuj Prof. Dr M. Kokoszyskiej-Lutman, Prof. Dr J. Supeckiemu oraz Doc. Dr M. Przeckiemu za szereg uwag i wskazówek, z których tak wiele skorzystaem przygotowujc ostateczn redakcj pracy.     

Thomas Kuhn revisited: Near-death studies and paradigm shifts

Near-death studies can be viewed within a theoretical framework of paradigms and paradigm shifts as explicated by Thomas Kuhn (1962). Assuming the validity of Kuhn's model, I hypothesize that the paradigm of today's normal science is shifting to a new paradigm to accommodate data from near-death studies.     

Depression and Anxiety in Persons with Parkinson's Disease With and Without “On–Off” Phenomena

On–off phenomena in Parkinson's disease (PD) are unpredictable motor fluctuations associated with long-term levodopa use. Mood fluctuations have been found to coincide with the motor fluctuations in that depression and anxiety increase while the person with PD is in the off state. What has been relatively unexplored is whether those persons with PD who have on–off phenomena differ psychologically in fundamental ways from those who do not have on–off phenomena. In the present study, depression and anxiety symptoms were assessed in 36 persons with PD (n = 14 with on–off phenomena, n = 22 without on–off phenomena). All those with on–off phenomena were assessed in their on state. Those persons with PD with on–off phenomena had significantly higher levels of anxiety than those without on–off phenomena. However, both groups, regardless of on–off status, were mildly depressed. Neurobiological interpretations of the results implicate the locus coeruleus in the pathogenesis of both on–off phenomena and anxiety, whereas psychological interpretations of the results involve the issues of learned helplessness and control over health symptoms in PD.     

The endorsement of irrational beliefs in a general clinical population

Burgess' Attitude and Belief Scale, a measure of Ellis' irrational beliefs, was administered to a large sample of outpatients. All 13 subscales demonstrate very adequate internal consistency. A factor analysis yielded one factor accounting for 83% of the variance, which was labeled irrationality. Clients endorsed focused items more than overgeneralized items, self-referential items more than non-self-referential items, and preferential items more than irrational items. Clients also received higher scores on the irrational process of demandingness than they did on the irrational process of awfulizing, self-worth and low frustration tolerance. The results were consistent with new formulations in Rational-Emotive theory. Suggestions were made for the construction of measures of irrational beliefs.     

Modifying Violent Communities by Enhancing Altruism: A Vision of Possibilities

A model for diagnosing and treating violent communities is outlined. The treatment consists of enhancing a form of pragmatic altruism by building relationships and mutual understanding between community leaders who are derived from task groups called community stabilizing systems, defined as groups essential for peaceful, creative stability in a community. Two examples of an intervention derived from this theory are described.     

"Solar love": Nietzsche,Merleau-Ponty and the fortunes of perception

Both Nietzsche and Merleau-Ponty repudiate the mirror view of perception and embrace what Nietzsche refers to as solar love or creative perception. I argue that Merleau-Ponty thinks of this type of perception primarily in terms of convergence and Nietzsche in terms of divergence. I then show how, contrary to their own emphases, Merleau-Ponty's notion of flesh and Nietzsche's idea of chaos suggest that convergence and divergence are abstractions from an ontologically prior realm of hybrid perceptions. In this realm, each perception is shot through with the others, simultaneously inside and outside one another. The creative tension among these perceptions continually produces new perspectives or voices, that is, a realm whose very being is metamorphosis. Moreover, this realm of hybrid perceptions suggests a political principle that might prove attractive for communities in an age of diversity and cultural hybridity.     

A latent class approach to fitting the weighted Euclidean model,clascal

A weighted Euclidean distance model for analyzing three-way proximity data is proposed that incorporates a latent class approach. In this latent class weighted Euclidean model, the contribution to the distance function between two stimuli is per dimension weighted identically by all subjects in the same latent class. This model removes the rotational invariance of the classical multidimensional scaling model retaining psychologically meaningful dimensions, and drastically reduces the number of parameters in the traditional INDSCAL model. The probability density function for the data of a subject is posited to be a finite mixture of spherical multivariate normal densities. The maximum likelihood function is optimized by means of an EM algorithm; a modified Fisher scoring method is used to update the parameters in the M-step. A model selection strategy is proposed and illustrated on both real and artificial data.The second author is supported as Bevoegdverklaard Navorser of the Belgian Nationaal Fonds voor Wetenschappelijk Onderzoek.     

Partially-Ordered (Branching) Generalized Quantifiers: A General Definition

Following Henkins discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or cardinality quantifiers, e.g., most, few, finitely many, exactly , where is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, Henkin definition first to a general definition of monotone-increasing (M) POQ and then to a general definition of generalized POQ, regardless of monotonicity. The extension is based on (i) Barwises 1979 analysis of the basic case of M POQ and (ii) my 1990 analysis of the basic case of generalized POQ. POQ is a non-compositional 1st-order structure, hence the problem of extending the definition of the basic case to a general definition is not trivial. The paper concludes with a sample of applications to natural and mathematical languages.     

On Ultrafilter Logic and Special Functions

Logics for generally were introduced for handling assertions with vague notions,such as generally, most, several, etc., by generalized quantifiers, ultrafilter logic being an interesting case. Here, we show that ultrafilter logic can be faithfully embedded into a first-order theory of certain functions, called coherent. We also use generic functions (akin to Skolem functions) to enable elimination of the generalized quantifier. These devices permit using methods for classical first-order logic to reason about consequence in ultrafilter logic.Presented by André Fuhrmann