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

- Allatum est die 5 Martii 1970     

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

- Allatum est die 5 Martii 1970     

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.     

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.     

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.     

Aids,myth, and ethics

The present paper is a commentary on an article by Larry Churchill [1]. Churchill has argued that the negative attitudes and adverse behavior we commonly encounter in connection with (suspected) AIDS patients may be understood in terms of a dualistic myth inspiring a ritual avoidance of dirt, of dirt as something that does not belong to a clean world order. The deep-seated mythical character of attitudes and behavior here makes them less accessible to the kind of rational argument commonly employed in ethics. Churchill also proposes a remedy for the (morally outrageous) dualistic mythical-ritual behavior he has focused — a remedy that may be overly intellectualistic.Three further comments are made: on the metaphorical meaning of myth, on a reductionist tendency in Churchill's deep-looking project, and on an ethically crucial ambiguity in the meaning of the other person's otherness. These (mildly critical) comments do not, however, detract from a positive overall evaluation of Churchill's basic idea that we will understand more about adverse attitudes and behavior in connection with AIDS if we think in terms of myth, ritual, dirt, and cleanliness.     

A New Representation Theorem for Contranegative Deontic Logic

The logic of an ought operator O is contranegative with respect to an underlying preference relation if it satisfies the property Op & (¬p)(¬q) Oq. Here the condition that is interpolative ((p (pq) q) (q (pq) p)) is shown to be necessary and sufficient for all -contranegative preference relations to satisfy the plausible deontic postulates agglomeration (Op & OqO(p&q)) and disjunctive division (O(p&q) Op Oq).     

On superintuitionistic logics as fragments of proof logic extensions

Coming fromI andCl, i.e. from intuitionistic and classical propositional calculi with the substitution rule postulated, and using the sign to add a new connective there have been considered here: Grzegorozyk's logicGrz, the proof logicG and the proof-intuitionistic logicI set up correspondingly by the calculiFor any calculus we denote by the set of all formulae of the calculus and by the lattice of all logics that are the extensions of the logic of the calculus, i.e. sets of formulae containing the axioms of and closed with respect to its rules of inference. In the logiclG the sign is decoded as follows: A = (A & A). The result of placing in the formulaA before each of its subformula is denoted byTrA. The maps are defined (in the definitions of x and the decoding of is meant), by virtue of which the diagram is constructedIn this diagram the maps, x and are isomorphisms, thereforex ^–1 = ; and the maps and are the semilattice epimorphisms that are not commutative with lattice operation +. Besides, the given diagram is commutative, and the next equalities take place: ^–1 = ^–1 and = ^–1 x. The latter implies in particular that any superintuitionistic logic is a superintuitionistic fragment of some proof logic extension.     

Cut-free tableau calculi for some propositional normal modal logics

We give sound and complete tableau and sequent calculi for the prepositional normal modal logics S4.04, K4B and G ⁰(these logics are the smallest normal modal logics containing K and the schemata A A, A A and A ( A); A A and AA; A A and ((A A) A) A resp.) with the following properties: the calculi for S4.04 and G ⁰are cut-free and have the interpolation property, the calculus for K4B contains a restricted version of the cut-rule, the so-called analytical cut-rule.In addition we show that G ⁰is not compact (and therefore not canonical), and we proof with the tableau-method that G ⁰is characterised by the class of all finite, (transitive) trees of degenerate or simple clusters of worlds; therefore G ⁰is decidable and also characterised by the class of all frames for G ⁰.Research supported by Fonds zur Förderung der wissenschaftlichen Forschung, project number P8495-PHY.Presented by W. Rautenberg     

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.     

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.     

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

Third Men: The Logic of the Sophisms at Arist. SE 22, 178b36–170a10

This article aims at elucidating the logic of Arist. SE 22, 178b36–179a10 and, in particular, of the sophism labelled "Third Man" discussed in it. I suggest that neither the sophistic Walking Man argument, proposed by ancient commentators, nor the Aristotelian Third Man of the , suggested by modern interpreters, can be identified with the fallacious argument Aristotle presents and solves in the passage. I propose an alternative reconstruction of the Third Man sophism and argue that an explanation of the lines regarding the identity of Coriscus and Coriscus the musician (178b39–179a3) is indispensable for its correct understanding, since they hint at another sophism in some important aspects analogous. Finally, I show that two contradictions concerning spotted by scholars in the passage are only apparent and can be dissolved once the assumption that the anti-Platonic Third Man argument is at stake here is discarded, and once the passage is read in the light of its agonistic context.     

On a certain class ofm-address machines

Conclusion It follows from the proved theorems that ifM =Q, (whereQ={0,q ₁,q ₂,...,q }) is a machine of the classM _F then there exist machinesM _i such thatM _i(1,c)=M (q _i,c) andQ _i={0, 1, 2, ..., +1} (i=1, 2, ..., ).And thus, if the way in which to an initial function of content of memorycC a machine assigns a final onecC is regarded as the only essential property of the machine then we can deal with the machines of the formM ={0, 1, 2, ..., }, and processes (t) (wheret=1,c,cC) only.Such approach can simplify the problem of defining particular machines of the classM _F , composing and simplifying them.Allatum est die 19 Januarii 1970     

A modification of kendall's tau for measuring association in contingency tables

A coefficient of association is described for a contingency table containing data classified into two sets of ordered categories. Within each of the two sets the number of categories or the number of cases in each category need not be the same.=+1 for perfect positive association and has an expectation of 0 for chance association. In many cases also has –1 as a lower limit. The limitations of Kendall's _a and _b and Stuart's _c are discussed, as is the identity of these coefficients to' under certain conditions. Computational procedure for is given.     

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.     

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     

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

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.     

Is “some-other-time” sometimes better than “sometime” for proving partial correctness of programs?

The main result of this paper belongs to the field of the comparative study of program verification methods as well as to the field called nonstandard logics of programs. We compare the program verifying powers of various well-known temporal logics of programs, one of which is the Intermittent Assertions Method, denoted as Bur. Bur is based on one of the simplest modal logics called S5 or sometime-logic. We will see that the minor change in this background modal logic increases the program verifying power of Bur. The change can be described either technically as replacing the reflexive version of S5 with an irreflexive version, or intuitively as using the modality some-other-time instead of sometime. Some insights into the nature of computational induction and its variants are also obtained.This project was supported by the Hungarian National Foundation for Scientific Research, Grant No. 1810.