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

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

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. -/- . (shrink)