This is a collection of new investigations and discoveries on the history of a great tradition, the Lvov-Warsaw School of logic , philosophy and mathematics, by the best specialists from all over the world. The papers range from historical considerations to new philosophical, logical and mathematical developments of this impressive School, including applications to Computer Science, Mathematics, Metalogic, Scientific and Analytic Philosophy, Theory of Models and Linguistics.

The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz [20]. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions [22, 23]. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (refutation) systems, introduced by Łukasiewicz (...) and developed by his student Słupecki, the pioneers of the method, which becomes relevant in modern approaches to logic. (shrink)

The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz [20]. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions [22, 23]. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (refutation) systems, introduced by Łukasiewicz (...) and developed by his student Słupecki, the pioneers of the method, which becomes relevant in modern approaches to logic. (shrink)

Es conocido que el Teorema de Completitud de Gödel, el Teorema del Colapso Transitivo de Mostowski y el Principio de Reflexión son resultados muy útiles en las investigaciones de Lógica matemática y/o los Fundamentos de la matemática. El objetivo de este trabajo es presentar algunas demostraciones clásicas de tales resultados: Dos del Teorema de Completitud de Gödel, una del Teorema del Colapso Transitivo de Mostowski y una del Principio de Reflexión. Se aspira que estas notas sean de utilidad para estudiar (...) dichas pruebas. Vale la pena resaltar que entre los métodos matemáticos que se utilizan en tales demostraciones se encuentran: (1) La técnica de construcción de modelos a partir de constantes (o "método del conjunto maximal consistente con un conjunto de testigos" de Henkin) y (2) el Principio de inducción matemática en varias versiones [ (2.1) Inducción matemática sobre los números naturales y (2.2) Inducción transfinita ((2.2.1) Inducción transfinita sobre conjuntos bien ordenados cualesquiera, por ejemplo sobre un cardinal infinito Alef_alfa, (2.2.2) Inducción transfinita sobre una clase de conjuntos bien ordenada, por ejemplo sobre la "clase de todos los ordinales, finitos o infinitos", y (2.2.3) Inducción transfinita sobre relaciones bien fundamentadas, por ejemplo sobre la "relación de pertenencia" entre conjuntos)]. (shrink)

The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (refutation) systems, introduced by Łukasiewicz and developed by (...) his student Słupecki, the pioneers of the method, which becomes relevant in modern approaches to logic. (shrink)

Alfred Tarski was one of the greatest logicians of the twentieth century. His influence comes not merely through his own work but from the legion of students who pursued his projects, both in Poland and Berkeley. This chapter focuses on three key areas of Tarski's research, beginning with his groundbreaking studies of the concept of truth. Tarski's work led to the creation of the area of mathematical logic known as model theory and prefigured semantic approaches in the philosophy of language (...) and philosophical logic, such as Kripke's possible worlds semantics for modal logic. We also examine the paradoxical decomposition of the sphere known as the Banach–Tarski paradox. Finally we examine Tarski's work on decidable and undecidable theories, which he carried out in collaboration with students such as Mostowski, Presburger, Robinson and others. (shrink)

Starting from certain metalogical results, I argue that first-order logical truths of classical logic are a priori and necessary. Afterwards, I formulate two arguments for the idea that first-order logical truths are also analytic, namely, I first argue that there is a conceptual connection between aprioricity, necessity, and analyticity, such that aprioricity together with necessity entails analyticity; then, I argue that the structure of natural deduction systems for FOL displays the analyticity of its truths. Consequently, each philosophical approach to these (...) truths should account for this evidence, i.e., that first-order logical truths are a priori, necessary, and analytic, and it is my contention that the semantic account is a better candidate. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

PARC is an "appended numeral" system of natural deduction that I learned as an undergraduate and have taught for many years. Despite its considerable pedagogical strengths, PARC appears to have never been published. The system features explicit "tracking" of premises and assumptions throughout a derivation, the collapsing of indirect proofs into conditional proofs, and a very simple set of quantificational rules without the long list of exceptions that bedevil students learning existential instantiation and universal generalization. The system can be used (...) with any Copi-style set of inference rules, so it is quite adaptable to many mainstream symbolic logic textbooks. Consequently, PARC may be especially attractive to logic teachers who find Jaskowski/Gentzen-style introduction/elimination rules to be far less "natural" than Copi-style rules. The PARC system is also keyboard-friendly in comparison to the widely adopted Jaskowski-style graphical subproof system of natural deduction, viz., Fitch diagrams and Copi "bent arrow" diagrams. (shrink)

In 1988, J. Ivlev proposed some (non-normal) modal systems which are semantically characterized by four-valued non-deterministic matrices in the sense of A. Avron and I. Lev. Swap structures are multialgebras (a.k.a. hyperalgebras) of a special kind, which were introduced in 2016 by W. Carnielli and M. Coniglio in order to give a non-deterministic semantical account for several paraconsistent logics known as logics of formal inconsistency, which are not algebraizable by means of the standard techniques. Each swap structure induces naturally a (...) non-deterministic matrix. The aim of this paper is to obtain a swap structures semantics for some Ivlev-like modal systems proposed in 2015 by M. Coniglio, L. Fariñas del Cerro and N. Peron. Completeness results will be stated by means of the notion of Lindenbaum–Tarski swap structures, which constitute a natural generalization to multialgebras of the concept of Lindenbaum–Tarski algebras. (shrink)

1971. Discourse Grammars and the Structure of Mathematical Reasoning II: The Nature of a Correct Theory of Proof and Its Value, Journal of Structural Learning 3, #2, 1–16. REPRINTED 1976. Structural Learning II Issues and Approaches, ed. J. Scandura, Gordon & Breach Science Publishers, New York, MR56#15263. -/- This is the second of a series of three articles dealing with application of linguistics and logic to the study of mathematical reasoning, especially in the setting of a concern for improvement of (...) mathematical education. The present article presupposes the previous one. Herein we develop our ideas of the purposes of a theory of proof and the criterion of success to be applied to such theories. In addition we speculate at length concerning the specific kinds of uses to which a successful theory of proof may be put vis-a-vis improvement of various aspects of mathematical education. The final article will deal with the construction of such a theory. The 1st is the 1971. Discourse Grammars and the Structure of Mathematical Reasoning I: Mathematical Reasoning and Stratification of Language, Journal of Structural Learning 3, #1, 55–74. https://www.academia.edu/s/fb081b1886?source=link . (shrink)

ABSTRACT This part of the series has a dual purpose. In the first place we will discuss two kinds of theories of proof. The first kind will be called a theory of linear proof. The second has been called a theory of suppositional proof. The term "natural deduction" has often and correctly been used to refer to the second kind of theory, but I shall not do so here because many of the theories so-called are not of the second kind--they (...) must be thought of either as disguised linear theories or theories of a third kind (see postscript below). The second purpose of this part is 25 to develop some of the main ideas needed in constructing a comprehensive theory of proof. The reason for choosing the linear and suppositional theories for this purpose is because the linear theory includes only rules of a very simple nature, and the suppositional theory can be seen as the result of making the linear theory more comprehensive. CORRECTION: At the time these articles were written the word ‘proof’ especially in the phrase ‘proof from hypotheses’ was widely used to refer to what were earlier and are now called deductions. I ask your forgiveness. I have forgiven Church and Henkin who misled me. (shrink)

We discuss central aspects of history of the concept of an affine differentiable manifold, as a proposal confirming the need for using some quantitative methods (drawn from elementary Model Theory) in Mathematical Historiography. In particular, we prove that this geometric structure is a syntactic rigid designator in the sense of Kripke-Putnam.

In the study of modal and nonclassical logics, translations have frequently been employed as a way of measuring the inferential capabilities of a logic. It is sometimes claimed that two logics are “notational variants” if they are translationally equivalent. However, we will show that this cannot be quite right, since first-order logic and propositional logic are translationally equivalent. Others have claimed that for two logics to be notational variants, they must at least be compositionally intertranslatable. The definition of compositionality these (...) accounts use, however, is too strong, as the standard translation from modal logic to first-order logic is not compositional in this sense. In light of this, we will explore a weaker version of this notion that we will call schematicity and show that there is no schematic translation either from first-order logic to propositional logic or from intuitionistic logic to classical logic. (shrink)

Intuitionistic Propositional Logic is proved to be an infinitely many valued logic by Gödel (Kurt Gödel collected works (Volume I) Publications 1929–1936, Oxford University Press, pp 222–225, 1932), and it is proved by Jaśkowski (Actes du Congrés International de Philosophie Scientifique, VI. Philosophie des Mathématiques, Actualités Scientifiques et Industrielles 393:58–61, 1936) to be a countably many valued logic. In this paper, we provide alternative proofs for these theorems by using models of Kripke (J Symbol Logic 24(1):1–14, 1959). Gödel’s proof gave (...) rise to an intermediate propositional logic (between intuitionistic and classical), that is known nowadays as Gödel or the Gödel-Dummett Logic, and is studied by fuzzy logicians as well. We also provide some results on the inter-definability of propositional connectives in this logic. (shrink)

The traditional picture of the development of analytical philosophy, represented especially by such thinkers as G. Frege, G. E. Moore, B. Russell or R. Carnap, whose attitude was generally anti-metaphysical, can, on closer study, be shown to be incomplete. This article treats of the Cracow circle – a group of Polish philosophers among whom are, above all, to be counted J. Salamucha, J. M. Bocheński, J. F. Drewnowski, and B. Sobociński, who were, at the beginning of the twentieth century, (...) fascinated by the development of modern formal logic and its application to philosophical thinking. They also attempted to apply it to Catholic philosophy. The result of their endeavours were many remarkable works introducing not only a defence of the use of modern philosophical approaches in Christian thought, but also the reconstruction, by means of formal logic, of significant proofs given by Scholastic authors. (shrink)

Why are natural theories pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. This approach was inspired by Martin's Conjecture, one of the most prominent conjectures in recursion theory. Fixing a reasonable subsystem $T$ of arithmetic, the goal was to classify the recursive functions that are monotone with respect to the Lindenbaum algebra of $T$. According to an optimistic conjecture, roughly, every such function must be equivalent to an iterate $\mathsf{Con}_T^\alpha$ of the consistency operator ``in (...) the limit'' within the ultrafilter of sentences that are true in the standard model. In previous work the author established the first case of this optimistic conjecture; roughly, every recursive monotone function is either as weak as the identity operator in the limit or as strong as $\mathsf{Con}_T$ in the limit. Yet in this note we prove that this optimistic conjecture fails already at the next step; there are recursive monotone functions that are neither as weak as $\mathsf{Con}_T$ in the limit nor as strong as $\mathsf{Con}_T^2$ in the limit. In fact, for every $\alpha$, we produce a function that is cofinally equivalent to $\mathsf{Con}^\alpha_T$ yet cofinally equivalent to $\mathsf{Con}_T$. (shrink)

The Introduction outlines, in a concise way, the history of the Lvov-Warsaw School – a most unique Polish school of worldwide renown, which pioneered trends combining philosophy, logic, mathematics and language. The author accepts that the beginnings of the School fall on the year 1895, when its founder Kazimierz Twardowski, a disciple of Franz Brentano, came to Lvov on his mission to organize a scientific circle. Soon, among the characteristic features of the School was its serious approach towards philosophical studies (...) and teaching of philosophy, dealing with philosophy and propagation of it as an intellectual and moral mission, passion for clarity and precision, as well as exchange of thoughts, and cooperation with representatives of other disciplines.The genesis is followed by a chronological presentation of the development of the School in the successive years. The author mentions all the key representatives of the School (among others, Ajdukiewicz, Lesniewski, Łukasiewicz,Tarski), accompanying the names with short descriptions of their achievements. The development of the School after Poland’s regaining independence in 1918 meant part of the members moving from Lvov to Warsaw, thus providing the other segment to the name – Warsaw School of Logic. The author dwells longer on the activity of the School during the Interwar period – the time of its greatest prosperity, which ended along with the outbreak of World War 2. Attempts made after the War to recreate the spirit of the School are also outlined and the names of followers are listed accordingly. The presentation ends with some concluding remarks on the contribution of the School to contemporary developments in the fields of philosophy, mathematical logic or computer science in Poland. (shrink)

The Introduction outlines, in a concise way, the history of the Lvov-Warsaw School—a most unique Polish school of worldwide renown, which pioneered trends combining philosophy, logic, mathematics and language. The author accepts that the beginnings of the School fall on the year 1895, when its founder Kazimierz Twardowski, a disciple of Franz Brentano, came to Lvov on his mission to organize a scientific circle. Soon, among the characteristic features of the School was its serious approach towards philosophical studies and teaching (...) of philosophy, dealing with philosophy and propagation of it as an intellectual and moral mission, passion for clarity and precision, as well as exchange of thoughts, and cooperation with representatives of other disciplines. The genesis is followed by a chronological presentation of the development of the School in the successive years. The author mentions all the key representatives of the School, accompanying the names with short descriptions of their achievements. The development of the School after Poland’s regaining independence in 1918 meant part of the members moving from Lvov to Warsaw, thus providing the other segment to the name—Warsaw School of Logic. The author dwells longer on the activity of the School during the Interwar period—the time of its greatest prosperity, which ended along with the outbreak of World War 2. Attempts made after the War to recreate the spirit of the School are also outlined and the names of continuators are listed accordingly. The presentation ends with some concluding remarks on the contribution of the School to contemporary developments in the fields of philosophy, mathematical logic or computer science in Poland. (shrink)

Logical and philosophical literature provides different classifications of reasoning. In the Polish literature on the subject, for instance, there are three popular ones accepted by representatives of the Lvov-Warsaw School: Jan Łukasiewicz, Tadeusz Czeżowski and Kazimierz Ajdukiewicz (Ajdukiewicz in Logika pragmatyczna [Pragmatic Logic]. PWN, Warsaw (1965, 2nd ed. 1974). Translated as: Pragmatic Logic. Reidel & PWN, Dordrecht, 1975). The author of this paper, having modified those classifications, distinguished the following types of reasoning: (1) deductive and (2) non-deductive, and additionally two (...) types of them in each of the two, depending on the manner of combining their premises with the conclusion through the relation of classical logical entailment. Consequently, the four types of reasoning: unilateral deductive (incl. its sub-types: deductive inference and proof), bilateral deductive (incl. complete induction), and reductive (incl. the sub-types: explanation and verification), logically nonvaluable (incl. inference by analogy, statistic inference), correspond to four operators of derivability. They are defined formally on the ground of Tarski’s axiomatic theory of deductive systems, by means of the consequence operation _Cn_ (Tarski in Monatshefte Math Phys 37:361–404, 1930a, C R Soc Sci Lett Vars 23:22–29, 1930b). Also, certain metalogical properties of these operators are given, as well as their relations with Tarski’s consequence operations \(Cn^+\) ( \(Cn^+ = Cn\) ) and dual consequences \(Cn^{-1}\) (Słupecki in Zeszyty Naukowe Uniwersytetu Wrocławskiego Seria B Nr 3:33–40, 1959, Słupecki et al. in Stud Log 29:76–123, 1971, Wybraniec-Skardowska, in: Wybraniec-Skardowska, Bryll (eds) Z badań nad teorią zdań odrzuconych [Studies in the Theory of Rejected Propositions], Series B, Studia i Monografie, Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Opole, 1969), and \(Cn^-\) (Wójcicki in Bull Sect Log 2(2):54–57, 1973)). (shrink)

In this paper, two axiomatic theories T− and T′ are constructed, which are dual to Tarski’s theory T+ (1930) of deductive systems based on classical propositional calculus. While in Tarski’s theory T+ the primitive notion is the classical consequence function (entailment) Cn+, in the dual theory T− it is replaced by the notion of Słupecki’s rejection consequence Cn− and in the dual theory T′ it is replaced by the notion of the family Incons of inconsistent sets. The author has proved (...) that the theories T+, T−, and T′ are equivalent. (shrink)

The two-fold ontological character of linguistic objects revealed due to the distinction between “type” and “token” introduced by Ch. S. Peirce can be a base of the two-fold, both theoretical and axiomatic, approach to the language. Referring to some ideas included in A. A. Markov’s work [1954] (in Russian) on Theory of Algorithms and in some earlier papers of the author, the problem of formalization of the concrete and abstract words theories raised by J. Słupecki was solved. The construction of (...) the theories presented here has two levels. The axiomatic theory of label-tokens: material, physical linguistic objects, constitutes the first one. Label-types, according to the literature of the subject, are defined on the other level as equivalence classes of equiform label-tokens. Assuming the opposite point of view, one can accept that theory of label-types: abstract labels, formalized on the first level, in which it is possible to define the notion of label-token as well as the derivative notions on the second level, should become the basis of formalization of the theory of linguistic expressions and the theory of language in general. The axioms and definitions of both theories of labels: T k and T p representing the other approach to the ontology of language are included in the sequel of the abstract. The foundations of the theory of labels T k in which the primary assumption as to the label-types existence is superfluous have been referred on the basis of the author's monography "Teorie Języków Syntaktycznie Kategorialnych" ( "The Theories of Syntactically Categorial Languages"), PWN, Warszawa-Wrocław 1985. The basis of the theory of labels T p which takes into account the other position has to be presented here for the first time. Some extended ideas of the paper will also be presented in author's paper "Logiczne podstawy ontologii składni Języka" ("Logical foundations of language syntax ontology), Studia Filozoficzne 6-7 (271-272), (1988), pp. 263-284. (shrink)

This is the PhD dissertation, written under supervision of Professor Jerzy Słupecki, published in the book: U.Wybraniec-Skardowska i Grzegorz Bryll "Z badań nad teorią zdań odrzuconych" ( "Studies of theory of rejected sentences"), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Seria B: Studia i Monografie nr 22, pp. 5-131. It is the first, original publication on the theory of rejected sentences on which are based, among other, papers: "Theory of rejected propositions. I"and "Theory of rejected propositions II" with Jerzy Słupecki (...) and Grzegorz Bryll. -/- -/- . (shrink)

The monograph contains three works on research on the concept of a rejected sentence. This research, conducted under the supervision of Prof. Jerzy Słupecki by U. Wybraniec-Skardowska (1) "Theory of rejected sentences" and G. Bryll (2) "Some supplements of theory of rejected sentences" and (3) "Logical relations between sentences of empirical sciences" led to the construction of a theory rejected sentences and made it possible to formalize certain issues in the methodology of empirical sciences. The concept of a rejected sentence (...) was introduced by J. Łukasiewicz in the course of his inquiry into Aristotelian Syllogistic. It was essentialy generelized by J. Słupecki who, with reference to Tarski's axiomatic theory of deductive systems (1930), gave the formal definition of the rejection function Cn' according to which a sentence y is rejected on the base of a set of sentences X iff at least one sentence which belongs to X can be deduced from the sentence y. Słupecki proved (1959) that the function Cn', which assignes to the set X the set of sentences rejected on the basis of X, is additive and satisfies the axioms of Tarski's general theory of deductive systems. Work (1) uses not only Tarski's general theory of systems but also his the so-called enlarged theory of systems (1930). It constructs a theory T of rejected sentences (propositions), which is created from Tarski's richer theory of systems by adding one axiom and a number of definitions; among them the definition of the rejection function Cn' is fundamental one. Cn' is a function which assignes to every set X of false sentences the set Cn'X whose members are exclusively false senteces. A number of theorems which describes properties of defined concepts have been proved in T. Some of them are necessary for conducting considertions of the concluding section of (1) devoted to the empirical sentences. Section 2 of (1) deals with the theory of the unit consequenses. It is characterized by an axiom from which follow all axioms of Tarski's general theory of deductive systems, additivity and the property that the unit consequence of the set X of sentences is a unit consequence only one sentence of X. An example of unit consequence is the rejection consequence Cn'. In section 3 of (1) the dual theory T' equivalent to T is presented. In T' the primitive concept is the rejection function Cn'. The fundamental axiom of T' states that Cn' is a unit consequence. The concluding section brings a few examples of applications of the definitions and theorems of T in the domain of the scientific methodology. Work (2) corresonds to J. Słupecki paper (1959) and the theory T of rejected propositions given in work (1). In this paper some suplements of the theory T are given. Work (3) is an extension of the theory of rejected propositios given in the paper (1). It is an attempt of formalization some problems of methodology of the empirical sciences which concern to such concepts as: empirical sentence, similar sentence, generalization, inductive conclusion etc. (shrink)