This paper is a continuation of Part I under the same title. Its Chapter III contains results given in the following publications: U. Wybraniec-Skardowska, Teoria zdań odrzuconych (Theory of Rejected Sentences), (doctoral dissertation under the supervision of Jerzy Słupecki, published as a monograph), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Studia i Monografie, Nr 22 (1969), 5-131. G. Bryll, Związki logiczne pomiędzy zdaniami nauk empirycznych (Logical relations between sentences of empirical sciences). Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Studia i (...) Monografie, Nr 22 (1969), 155-216. This chapter contains an attempt to formalize some questions of methodology of empirical sciences. The theory T is enriched here not only by new definitions but also by a new primitive term and new axioms. The most important notion defined in this chapter is the set IndX of all inductive conclusions obtained on the basis of sentences of the set X. The function CnI defined by the equality: CnI X = X u IndX, satisfies the axioms of the general theory of deductive systems. The set CnI X can be understood as a system of empirical sciences in a narrower sense. This paper is a development of the considerations of G. Bryll, included in the above-listed article by this author. (shrink)

This paper reminds, puts in order, sketches and also initiates some researches from the field of logic and philosophy of language. It lays emphasis on the logical-linguistic and ontological developmental lines originated with Polish researchers. The author discusses two opposite orientations of the former line in the process of formalization of language, called here nominalistic and Platonistic. The paper mentions the author's result (1989; 1991) concerning theoretical equivalence of two axiomatic approaches to language syntax which take into consideration these two (...) different philosophical orientations, respectively. It also introduces certain formal-logical foundations of language semantics, discusses and develops the problem of the syntactic and semantic categorial agreement, i.e. the agreement of the syntactic category of each language expression with the ontological category assigned to the reference of this expression. The author, in particular, gives a solution to this problem for quantifiers. (shrink)

The idea of rejection of some sentences on the basis of others comes from Aristotle, as Jan Łukasiewicz states in his studies on Aristotle's syllogistic [1939, 1951], concerning rejection of the false syllogistic form and those on certain calculus of propositions. Short historical remarks on the origin and development of the notion of a rejected sentence, introduced into logic by Jan Łukasiewicz, are contained in the Introduction of this paper. This paper is to a considerable extent a summary of papers (...) which are not easily available, even to the Polish reader: (1) J. Słupecki, Funkcja Łukasiewicza (Łukasiewicz’s function), Zeszyty Naukowe Uniwersytetu Wrocławskiego, Seria B, nr 3 (1959), 33-40; (2) U. Wybraniec-Skardowska, Teoria zdań odrzuconych (Theory of Rejected Sentences), (doctoral dissertation under the supervision of Jerzy Słupecki, published as a monograph), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Studia i Monografie, Nr 22 (1969), 5-131; (3) G. Bryll, Kilka uzupełnień teorii zdań odrzuconych (Some supplements to the theory of rejcted sentences), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Studia i Mnografie, Nr 22 (1969), 153-154. The paper also contains a good number of results which have not been published yet. Chapter I contains results presented in the papers (1)-(3). It provides an extension of Alfred Tarski’s theory of deductive systems presented by him in the papers [1930]: Fundamentale Begriffe der Methodologie der deduktiven Wssenschaften, I and Über einige fundamentale Begriffe der Metamathematik. The enriched theory is marked with T. The most essential new concept in T is the function Cn-1, whose definition was given by Słupecki in (1) on the basis of the so-called Tarski’s general theory of deductive systems. It has the form: y e Cn-1X iff Ex e X (x e Cn {y}), where Cn is Tarski’s consequence operation. In accordance with the definition: A sentence y is rejected on the basis of the sentences of the set X iff at least one of sentences of X is a consequence of y (is deducible from y). The intuitive meaning of the rejection function Cn-1: on the basis of false sentences we can reject false sentences only (while by means of the consequence operation Cn on the basis of true sentences we can deduce true sentences only). The function Cn-1 is a generalization of the notion of rejected sentences which was introduced into logic by Łukasiewicz. The essential property of the rejection function Cn-1 is that it satisfies the axioms of general Tarski’s consequence Cn, so it is a consequence operation, called the rejection consequence. In addition, it is an additive and normal operation. In Chapter I, there are given notions analogous to those of the theory of deductive systems, but they are written down by means of the symbol ‘Cn-1’ and not ‘Cn’. There are established the properties of introduced notions and differences and analogies taking place between them and properties of respective notions of the theory T. There are also given generalizations of the notions of ‘decidable system’ and ‘consistent system’ used by Łukasiewicz. The short Chapter II contains axioms of the system T’ which is equivalent to the system T. The only difference between sets of primitive notions of these systems consists in the appearance of the function Cn-1 in the system T’ instead of the function Cn. This chapter reproduces the results given in (2), but they are partially simplified. (shrink)

Popper's definition of verisimilitude was criticized for its paradoxical consequences in the case of false theories. The aim of this paper is to show that paradoxes disappear if the falsity content of a theory is defined with help of dCn or Cn –1.