Dowód aksjomatyzowalności pewnychn-wartościowych rachunków zdań

Praca ta zostaa wykonana pod kierunkiem prof. drJerzego Supeckiego. Jej szczególny przypadek dotyczcyn-wartociowego rachunku zda o jednej wartoci wyrónionej by referowany w Warszawie na zjedzie Grupy Logiki Instytutu Filozofii i Socjologii PAN. Streszczenie tego referatu [5] zostao wydrukowane w Sprawozdaniach Wydziau Nauk Spoecznych PAN.Allatum est die 19 Aprilis 1963     

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.     

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     

O klasach normalnych i nienormalnych na terenie języka potocznego

Problematyka i glówne tezy tej pracy pochodz od pierwszego autora. Udzial drugiego autora sprowadza sie do propozycji utosamienia jeezyka potocznego z formalizmem logiki zda i logiki nazw oraz do pewnych sugestii odnonie systematyzacji materialuAllatum est die 2 Octobris 1965     

O liczbach kardynalnych

Tre: Wstp. I. Niektóre pojcia i prawa teorii klas stosunków. II. O klasach abstrakcji. III. O równoskadnikowoci. IV. O kardynalnych liczbach skadników. V. O. stosowanej teorii równoskadnikowoci. VI. O relacji równej liczby elementów. VII. Stosunek obu poj liczb kardynalnych. Zakoczenie.Allatum est die 30 Augusti 1961     

Was sind “ek-statische Maschinen”? (Gedanken aus und zu: M. K. Mamardašvili,Wissenschaft und Kultur)

Ohne ZusammenfassungM. K. Mamardavili, Nauka i kul'tura, inMetodologieskie problemy istorikonaunych issledovanij, M., Nauka, 1982, str. 38–58. Zitate aus diesem Aufsatz werden im Text mit der in Klammern gesetzten Seitenzahl ausgewiesen.     

Branching space-time

Branching space-time is a simple blend of relativity and indeterminism. Postulates and definitions rigorously describe the causal order relation between possible point events. The key postulate is a version of everything has a causal origin; key defined terms include history and choice point. Some elementary but helpful facts are proved. Application is made to the status of causal contemporaries of indeterministic events, to how splitting of histories happens, to indeterminism without choice, and to Einstein-Podolsky-Rosen distant correlations.     

Epistemologische betrachtungen zu [S4, S5]

Zusammenfassung Die zahlreichen modallogischen Systeme zwischen den Standardkalkülen S4 und S5 werden vom epistemologischen Standpunkt aus untersucht, indem Notwendigkeit wahlweise als Wissen bzw. als Überzeugt-sein gedeutet wird. Dabei stellt sich heraus, daß — unter gewissen andernorts begründeten Voraussetzungen über epistemische Logik-S4.4 als Logik der wahren Überzeugungen aufgefaßt werden kann, während die Systeme S4.3.2 und S4.2 als Logiken für solche Leute erscheinen, die das Schema Wissen = wahre Überzeugung nur eingeschränkt für ganz spezielle rein doxastische bzw. rein epistemische Sätze akzeptieren. S4.2 ist dabei allem Anschein nach die Logik des Wissens.

---

The numerous modal systems between S4 and S5 are investigated from an epistemological point of view by interpreting necessity either as knowledge or as (strong) belief. It is shown that-granted some assumptions about epistemic logic for which the author has argued elsewhere-the system S4.4 may be interpreted as the logic of true belief, while S4.3.2 and S4.2 may be taken to represent epistemic logic systems for individuals who accept the scheme knowledge = true belief only for certain special instances. There is strong evidence in favor of the assumption that S4.2 is the logic of knowledge.

     

A calculus for the common rules of ∧ and ∨

We provide a finite axiomatization of the consequence , i.e. of the set of common sequential rules for and . Moreover, we show that has no proper non-trivial strengthenings other than and . A similar result is true for , but not, e.g., for ⁺.To the memory of Jerzy Supecki     

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.     

A partially ordered extention of the integers

This paper presents a monotonic system of Post algebras of order +* whose chain of Post constans is isomorphic with 012 ... -3-2-1. Besides monotonic operations, other unary operations are considered; namely, disjoint operations, the quasi-complement, succesor, and predecessor operations. The successor and predecessor operations are basic for number theory.The editing of this unified version of two previous papers [Epstein, Rasiowa 1990, 1991] by the authors was completed, except for footnotes, while the first author visited at Warsaw University during June–July, 1994. The footnotes were added by the first author in September, 1994.Presented byRyszard Wójcicki     

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.     

Formalization of functionally complete propositional calculus with the functor of implication as the only primitive term

The most difficult problem that Leniewski came across in constructing his system of the foundations of mathematics was the problem of defining definitions, as he used to put it. He solved it to his satisfaction only when he had completed the formalization of his protothetic and ontology. By formalization of a deductive system one ought to understand in this context the statement, as precise and unambiguous as possible, of the conditions an expression has to satisfy if it is added to the system as a new thesis. Now, some protothetical theses, and some ontological ones, included in the respective systems, happen to be definitions. In the present essay I employ Leniewski's method of terminological explanations for the purpose of formalizing ukasiewicz's system of implicational calculus of propositions, which system, without having recourse to quantification, I first extended some time ago into a functionally complete system. This I achieved by allowing for a rule of implicational definitions, which enabled me to define any propositionforming functor for any finite number of propositional arguments.To the memory of Jerzy Supecki     

Three theories of nominalized predicates

By the term nominalization I mean any process which transforms a predicate or predicate phrase into a noun or noun phrase, e.g. feminine is transformed into feminity. I call these derivative nouns abstract singular terms. Our aim is to provide a model-theoretic interpretation for a formal language which admits the occurrence of such abstract singular terms.     

The method of axiomatic rejection for the intuitionistic propositional logic

We prove that the intuitionistic sentential calculus is -decidable (decidable in the sense of ukasiewicz), i.e. the sets of theses of Int and of rejected formulas are disjoint and their union is equal to all formulas. A formula is rejected iff it is a sentential variable or is obtained from other formulas by means of three rejection rules. One of the rules is original, the remaining two are ukasiewicz's rejection rules: by detachement and by substitution. We extensively use the method of Beth's semantic tableaux.To the memory of Jerzy SupeckiTranslated from the Polish by Jan Zygmunt. Preparation of this paper was supported in part by C.P.B.P. 08-15.     

Can Parts of Space Move? On Paragraph Six of Newton’s Scholium

Paragraph 6 of Newtons Scholium argues that the parts of space cannot move. A premise of the argument – that parts have individuality only through an order of position – has drawn distinguished modern support yet little agreement among interpretations of the paragraph. I argue that the paragraph offers an a priori, metaphysical argument for absolute motion, an argument which is invalid. That order of position is powerless to distinguish one part of Euclidean space from any other has gone virtually unremarked. It remains uncertain what the import of the paragraph is but it is not close to apparently similar arguments of Leibniz.     

A reduction rule for Peirce formula

A reduction rule is introduced as a transformation of proof figures in implicational classical logic. Proof figures are represented as typed terms in a -calculus with a new constant P ⁽⁽⁾⁾. It is shown that all terms with the same type are equivalent with respect to -reduction augmented by this P-reduction rule. Hence all the proofs of the same implicational formula are equivalent. It is also shown that strong normalization fails for P-reduction. Weak normalization is shown for P-reduction with another reduction rule which simplifies of (( ) ) into an atomic type.This work was partially supported by a Grant-in-Aid for General Scientific Research No. 05680276 of the Ministry of Education, Science and Culture, Japan and by Japan Society for the Promotion of Science. Hiroakira Ono     

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

- Allatum est die 5 Martii 1970     

Supererogation in Deontic Logic: Metatheory for DWE and Some Close Neighbours

In "Doing Well Enough: Toward a Logic for Common Sense Morality", Paul McNamara sets out a semantics for a deontic logic which contains the operator It is supererogatory that. As well as having a binary accessibility relation on worlds, that semantics contains a relative ordering relation, . For worlds u, v and w, we say that u w v when v is at least as good as u according to the standards of w. In this paper we axiomatize logics complete over three versions of the semantics. We call the strongest of these logics DWE for Doing Well Enough.     

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.