Urszula Wybraniec-Skardowska

This note is based on a lecture delivered at the Conference on the Scien- tic Research of the Mathematical Center of Opole, Turawa, May 10-11th, 1980. A somewhat extended version will be published in the Proceedings of the Conference. At the same time it is an abstract of a part of a planned larger paper, which will involve the theory of label-tokens. The theory is included into the author's monograph in Polish "Teorie Językow Syntaktycznie Kategorialnych", PWN, Warszawa-Wrocław 1985 and into its English version: Theory of Language Syntax. Categorial Approach, Kluwer Academic Publishers, Boston-London-Dordrecht 1991.

In the paper, certain rational postulates for protocols describing real communicating are introduced.These rational postulates, on the one hand, allow assigning a certain typology of real systems of interactions, which is consistent with the reality of epistemic argumentation in systems of communicating, and on the other one – defining rules of using argumentation in real situations. Moreover, the presented postulates for protocols characterize information networks and administering knowledge in real interactivity systems. Due to the epistemic character of the considerations, the problem undertaken in the paper concerns working out fundamental assumptions that refer to building of epistemic logics. They allow establishing the correctness of the discourse defined by rational postulates of protocols of real communication. In the context of the presented problem there are the following two research questions distinguished: 1) How do we determine the rule of building of real dynamic epistemic logics? and 2) How should we define semantics for these logics? Within the framework of considerations relating to the research questions asked, certain epistemic operators, relativized to types of communicating, are introduced. Basic logical relations between using these operators are established for these operators. The relations are presented by a diagram called the square of epis temic operators. On the basis of these logical relations some axioms for real dynamic epistemic logics are presented. The semantics of real dynamic epistem ic logics is extended by the methods of lower and upper approximation of formula evaluating. This allows defining ‘approximation Kripke models’. The results of conceptualization of knowledge on real premises of epistemic argum entation presented in this paper can be applied to rhetoric in real systems of interaction.

The aim of this study is to discuss in what sense one can speak about universal character of logic. The authors argue that the role of logic stands mainly in the generality of its language and its unrestricted applications to any field of knowledge and normal human life. The authors try to precise that universality of logic tends in: (a) general character of inference rules and the possibility of using those rules as a tool of justification of theorems of every science, (b) principles of correct formulating of thoughts and using language, and (c) general deductive method of reasoning, i.e in the study of language syntax and semantics. The authors present two theories of language syntax and semantics as exemplifications based on the Tarski’s famous results in metalogic: (1) a formalization of universal syntax system by Andrzej Grzegorczyk based on a new primitive notion of quotation-marks operator, and (2) an enlarged system of axiomatic theory of syntax of any categorial language of Urszula Wybraniec-Skardowska’s in which the main role plays the relation of concatenation understood as a set-theoretical function. The study concludes in arguing that the importance of the result (2) lies not only in solving some philosophical problems but also in different fields of knowledge and spheres of human life as ex. in discussion and education as well.

By logical foundations of language syntax ontology we understand here the construction of formalized linguistic theories based on widely conceived mathematical logic and dependent on two trends in language ontology. The formalization includes exclusively the syntactic aspect of logical analysis of language characterized categorially according to Ajdukiewicz's approach [1935, 1960]. Any categorial language L is characterized formally on two levels: on one of them it concerns the language of expression-tokens, on the other one - that of expression-types. Accepting the view that expression-concretes, that is expression-tokens - thus, physical objects are fundamental language layer, whereas the secondary layer for L are expression-abstracts, that is expression-types - thus, ideal objects, it is the nominalistic, concretistic philosophical view on the ontological nature of language entities that is adhered to. Supporting the view that expression-types are the basic language layer, while expression-concretes are the secondary one, we take the opposite standpoint - platonizing one. We prove that the two dual approaches towards the two-level syntax theory of language are logically eqivalent. In the scope of language syntax, both conceptions deriving from two different existential assumption are equivalent. This statement is philosophical significance, since it proves that in syntactical studies on language the assumption of the existence of abstract language beings (interpreted as classes equiform tokens) can be neglected. The idea was signalized by author in ealier paper "On the type-token relationships'' [1986) and than, in a slighly diffrent form in English "On the eliminatibility of ideal linguistic entities, Studia Logica 48,no 4 (1989), pp. 587-615.

Building on our diverse research traditions in the study of reasoning, language and communication, the Polish School of Argumentation integrates various disciplines and institutions across Poland in which scholars are dedicated to understanding the phenomenon of the force of argument. Our primary goal is to craft a methodological programme and establish organisational infrastructure: this is the first key step in facilitating and fostering our research movement, which joins people with a common research focus, complementary skills and an enthusiasm to work together. This statement—the Manifesto—lays the foundations for the research programme of the Polish School of Argumentation

The paper enriches the conceptual apparatus of the theory of meaning and denotation that was presented in Part I (Section 3). This part concentrates on the notion of interpretation, which is defined as an equivalence class of the relation possessing the same manner of interpreting types. In this part, some relations between meaning and interpretation, as well as one between denotation an interpretational denotation are established. In the theory of meaning and interpretation, the notion of language communication has been formally introduced and some conditions of correctness of communication have been formulated.

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

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.

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.

The main goal of this paper is to outline a general formal-logical theory of language construed as a particular ontological being. The theory itself will be referred to as an ontology of language, because it is motivated by the fact that language plays a special role: it reflects ontology, and ontology reflects the world. Linguistic expressions will be regarded as having a dual ontological status: they are to be understood as either concreta – i.e. tokens, in the sense of material, physical objects – or types, in the sense of classes of tokens – i.e. abstract objects. Such a duality will then be taken into account in the logical theory of syntax, semantics and pragmatics presented here. We point to the possibility of constructing the latter on two different levels, one stemming from concreta, construed as linguistic tokens of expressions, the other from their classes – namely types, conceived as abstract, ideal beings. The aim of this work is not only to outline such a theory with respect to the dual ontological nature of the expressions of language in terms that take into account a functional approach to language itself, but also to show that the logic based on it is ontologically neutral in the sense that it is abstracted from the level at which certain existential assumptions relating to the ontological nature of these linguistic expressions and their extra-linguistic ontological counterparts (objects) would have to be embraced.

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.

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.

The European Summer Schools in Logic, Language and Information (ESSLLI) have been organised every year since 1989 under the auspices of the Association for Logic, Language and Information (FoLLI) in different cities around Europe. The 24th European Summer School in Logic, Language and Information (ESSLLI 2012) took place at the University of Opole, Poland, during August 6-17, 2012. The organisation committee was chaired by Janusz Czelakowski and Urszula Wybraniec-Skardowska (Institute of Mathematics and Informatics, University of Opole) and the programme committee was chaired by Andreas Herzig (University of Toulouse and CNRS). During two weeks, over 340 participants from 36 countries were offered a rich academic program of their choice from 9 foundational, 16 introductory and 17 advanced courses and 6 workshops. Just as in the previous years, the 17th conference on Formal Grammar collocated with ESSLLI. Besides the regular courses, a traditional highlight of the summer school were the 4 evening lectures by distinguished academics: - Johan van Benthem (Institute for Logic, Language & Computation (ILLC), Amsterdam and Department of Philosophy, Stanford University), "Computation as Agency''; - Melvin Fitting (Department of Mathematics and Computer Science, City University of New York), "Reasoning About Games''; - Jonathan Ginzburg (UFR Études anglophones, Université Paris-Diderot (Paris 7)), "False starts, jokes, and music:semantics in the 21st century''; - Adam Przepiórkowski (Institute of Computer Science, Polish Academy of Sciences, Warsaw), "Secret life of corpora''. Another traditional event was the student session, organised by a student programme committee chaired by Rasmus K. Rendsvig (University of Copenhagen): master and doctoral students presented 16 papers and 5 posters, and Michał Zawidzki obtained the best paper award and Raul Fervari obtained the best poster award. Moreover, the Beth Dissertation Prizes were announced at the FoLLI General Meeting and went to Andreas Kapsner (University of Barcelona) and Daniel R. Licata (Carnegie Mellon University). Apart from the busy academic programme, participants of the summer school were offered an exciting social program as well. In addition to the traditional ESSLLI Party and the famous Students vs. Lecturers Soccer Match (also called `Johan van Benthem Cup'), kayaking, and excursions to Kraków and Wrocław were offered.

This book presents a formal and philosophical analysis of language syntax. It refers to some ideas of E.Husserl and G. Frege, to S. Leśniewski's theory of syntactic categories and K. Ajdukiewicz's conception of formal grammar, also to Ch.S. Pierces's distinction between tokens (concrete linguistic entities) and types (ideal linguistic entities) and to A.A. Markov's theory of algorithms. The central aim of the book is - in the spirit of these ideas - to provide both strict yet comprehensive lectures on two axiomatic theories of languages (grammars) irrespective of specific structure of their expression and the notation used in them. The main feature of these theories are that definitions of well-formed expression allow the formulation of algorithms for the examination of syntactic correctness of expressions and that their formalizations are bi-level, in reference to opposite philosophical orientations: nominalistic and idealistic. The theoretical considerations in the book speak in favour of the former. The book contains a translation of the basic contents of the book in Polish "Teorie języków syntaktycznie kategorialnych ("Theories of syntactically categorial languages"), PWN, Warszawa-Wrocław 1985, and extensive Introduction and Final Remarks. In Introduction are discussed the main assumptions, objectives and conditionings of presented theories and intuitive foundations of these theories. Final Remarks are connected with the subject-matter of the book and the ability to build syntax theories in the opposition spirit, because of the Platonic approach to language syntax.

With reference to Polish logico-philosophical tradition two formal theories of language syntax have been sketched and then compared with each other. The first theory is based on the assumption that the basic linguistic stratum is constituted by object-tokens (concrete objects perceived through the senses) and that the types of such objects (ideal objects) are derivative constructs. The other is founded on an opposite philosophical orientation. The two theories are equivalent. The main conclusion is that in syntactic researches it is redundant to postulate the existence of abstract linguistic entities. Earlier, in a slightly different form, the idea was presented in [27] and signalled in [26] and [25].

In the paper, the authors discuss two kinds of consequence operations characterized axiomatically. The first one are consequence operations of the type Cn + that, in the intuitive sense, are infallible operations, always leading from accepted (true) sentences of a deductive system to accepted (true) sentences of the deductive system (see Tarski in Monatshefte für Mathematik und Physik 37:361–404, 1930, Comptes Rendus des Séances De la Société des Sciences et des Lettres de Varsovie 23:22–29, 1930; Pogorzelski and Słupecki in Stud Logic 9:163–176, 1960, Stud Logic 10:77–95, 1960). The second kind are dual consequence operations of the type Cn − that can be regarded as anti-infallible operations leading from non-accepted (rejected, false) sentences of a deductive system to non-accepted (rejected, false) sentences of the system (see Słupecki in Funkcja Łukasiewicza, 33–40, 1959; Wybraniec-Skardowska in Teoria zdań odrzuconych, 5–131, Zeszyty Naukowe Wyższej Szkoły Inżynierskiej w Opolu, Seria Matematyka 4(81):35–61, 1983, Ann Pure Appl Logic 127:243–266, 2004, in On the notion and function of rejected propositions, 179–202, 2005). The operations of the types Cn + and Cn − can be ordinary finitistic consequence operations or unit consequence operations. A deductive system can be characterized in two ways by the following triple: $$\begin{array}{ll}{\rm by\,the\,triple}:\hspace{1.4cm} (+ , -)\hspace{0,6cm} \\ {\rm or\,by\,the\,triple}:\hspace{1.0cm} (-, +)\hspace{0,6cm} .\end{array}$$ We compare axiom systems for operations of the types Cn + and Cn −, give some methodological properties of deductive systems defined by means of these operations (e.g. consistency, completeness, decidability in Łukasiewicz’s sense), as well as formulate different metatheorems concerning them

The work broadens – to a considerable extent – Z. Pawlak’s original method (1982, 1992) of approximation of sets. The approximation of sets included in a universum U goes on in the contextual approximation space CAS which consists of: 1) a sequence of Pawlak’s approximation spaces (U,Ci), where indexes i from set I are linearly ordered degrees of contexts (I, <), and Ci is the universum partition U, 2) a sequence of binary relations on sets included in U, relations called context relations indexed with degrees of contexts. The introduction of relations of contexts of sets was inspired by the work of W. Ziarnko (1993). Intuitively, set X is the context of set Y to the degree i, when on the basis of knowledge of the elements of set X we can obtain knowledge about the belonging of these elements to set Y to the degree i which is a degree of uncertainty or ambiguity, or inaccuracy. The operations of approximation of sets Ci-, BNi, Ci+, called lower approximation of the degree i, boundary of the degree i, upper approximation of the degree i, are formulated in a way which is analogous with the systems of Pawlak’s approximation, by expanding their formulas accordingly. In the next part of the work, it is shown (in an analogous way to Bryniarski’s work (1989)) that one can define the following operations on contextual rough sets: the union of contextual rough sets, the intersection of contextual rough sets and the complement of contextual rough set. It is proved that the algebra of contextual rough sets is a ditributive lattice with a unit and with a zero. On the basis of the results presented above the problem of defining operations on contextual rough sets by membership relations (Bryniarski 1989) may be formulated analogously to the classical operations on sets.

Logic and linguistics have engaged in a many-faceted dialogue since the very beginnings of both disciplines in Antiquity. While participants may have had diverse views over the ages, arguably, the dialogue has always revolved around the relationship between human thought and natural language. While there are those who see these two domains as one and the same, or as a case of one-directional influence , we beg to differ. To us, the long historical tradition of authors such as Arnauld, Boole, Turing, or Jespersen demonstrates the much richer perspectives on language and reasoning that are needed, including connections with intelligence and computability.Another major historical theme in the above dialogue are similarities or convergences between natural and artificial languages. It is clear that natural languages are not only semantically broader, but also much closer to human communication than artificial languages, and so linguistic grammars have long dealt with a larger set of problems than logical formalism. This specal issue of JoLLI consists six selected papers presented in the "Logic and Linguisics" Workshop in UNI-LOG 2013 in Rio de Janeiro, plus two papers by invited authors: Johan van Benthem, and Marcus Kracht and Uno Klein. It contains a number of samples of what is intriguing and promising work at the interfaces of logic and language.

This paper sketches or signals some ideas, results, and proposals connected with the theoretical issues related to the categorial approach to language which originated from the first author and which form the basis for further research by the second author. The main aims are the following: 1) to bring into common use some Polish ideas concerned with classical categorial grammar; 2) to take into consideration a universal and simultaneously formal-logical perspective; 3) to consider Peirce's well-known differentiation of linguistic objects, i.e. their twofold ontological status as tokens and types and, according to this, to consider the biaspectual formalization of language dealing with the two main orientations in the controversy between nominalism and Platonism; 4) to characterize language according to Frege's ontological canons, according to which each expression of language corresponds to its denotation. All of these factors make possible not only the syntactic characterization of language but also the introduction of syntactic and semantic definitions of a true expression and its denotation. These notions correspond here to the old classical, but not necessarily standard, understanding of semantic concepts. The paper is divided into four sections: the first contains a brief characterization of the categorial approach to syntax; the second presents two strains of this approach; the third touches on certain general semantic issues connected with the notion of truth; and the last gives some final remarks.

This paper deals with Tarski's first axiomatic presentations of the syntax of deductive system. Andrzej Grzegorczyk's significant results which laid the foundations for the formalization of metalogic, are touched upon briefly. The results relate to Tarski's theory of concatenation, also called the theory of strings, and to Tarski's ideas on the formalization of metamathematics. There is a short mention of author's research in the field. The main part of the paper surveys research on the theory of deductive systems initiated by Tarski, in particular research on the axiomatization of the general notion of consequence operation, axiom systems for the theories of classic consequence and for some equivalent theories, and axiom systems for the theories of nonclassic consequence. In this paper the results of Jerzy Supecki's research are taken into account, and also the author's and other people belonging to his circle of scientific research. Particular study is made of his dual characterization of deductive systems, both as systems in regard to acceptance and systems in regard to rejection . Comparison is made, therefore, with axiomatizations of the theories of rejection and dual consequence, and the theory of the usual consequence operation