SBL - Brazilian Logic Society

* [[https://csbc.sbc.org.br/2022/wbl/|II Workshop Brasileiro de Lógica]]

* [[http://wollic.org/wollic2020/|Workshop on Logic, Language, Information and Computation]]

* [[https://www.mathstat.dal.ca/wollic2023/WoLLIC 2023]]

* [[https://www.cle.unicamp.br/splogic/|II Encontro Brasileiro em Teoria das Categorias]]

* [[https://csbc.sbc.org.br/2022/wbl/|Workshop Brasileiro de Lógica]]

* [[http://lsfa2020.ufba.br/wbl.html|Workshop Brasileiro de Lógica]]

* [[http://ebl2021.ufba.br/|Brazilian Logic Conference]]

* I ENC(UE-O)NTRO DE LÓGICA BRASIL-COL(O-Ô)MBIA

! Eventos apoiados pela SBL

! Events supported by SBL

!! 2020

* [[http://dlmps.org/pages/2023-congress.php|XVIIth Congress on Logic, Methodology, and Philosophy of Science and Technology]]

* [[http://lia.ufc.br/~lsfa2018/|Workshop on Logical and Semantic Frameworks with Applications]]

* [[https://logicsocialepistemology2019.wordpress.com/pt/|I Simpósio de Lógica e Filosofia Analítica & VIII Conferência de Epistemologia Social]]

* [[http://www.inf.ufg.br/ebl2017/ebl.html|Brazilian Logic Conference]]

* [[http://www.inf.ufg.br/ebl2017/ebl.html|EBL]]

* [[Events/WorkshopSBL2018|Workshop da Sociedade Brasileira de Lógica]]

* [[http://www.dlmpst.org/pages/activities/icm-2018-satellite.php|Conference on Mathematical Logic 2018]]
* [[Events/WorkshopSBL2017|Workshop da Sociedade Brasileira de Lógica 2017]]

* [[http://www.dlmpst.org/pages/activities/icm-2018-satellite.php|Conference on Mathematical Logic]]
* [[Events/WorkshopSBL2017|Workshop da Sociedade Brasileira de Lógica]]

*  [[Events/WorkshopSBL2017|Workshop da Sociedade Brasileira de Lógica]]

Attach:SBL.jpg

17h00-17h25    Prof. Dr. Darllan C. Pinto (UFBA)

                            CONGRUENTIAL FILTER PAIRS AND THEIR RELATION WITH
                            LEIBNIZ OPERATOR                   
                         
Abstract:  We consider the special case of filter pairs (G,i) where the functor G = Co_K is given by congruences relative to some quasivariety K , and give criteria when the associated logic is protoalgebraic, equivalential, algebraizable, truth- equational, self-extentional or Lindenbaum algebraizable, by just analyzing the relation between Leibniz operator and the adjoint of i , improving our previous results. Also, we give a way of producing a logic from a quasivariety and a given set of equations, yielding many interesting new logics. We introduce a notion of morphism of filter pairs and show that it encodes translations between their associated logics. Moreover, we show that the category of abstract logics is isomorphic to a full and reflective subcategory of the category of filter pairs.

O Workshop realizar-se-á no Auditório do Instituto de Matemática e Estatística da UFBA, na mesma semana em que ocorrem em Salvador outros dois eventos relacionados à Lógica (e organizados pelo Prof. Dr. Abel Lassale Casanave, do Departamento de Filosofia da UFBA):

PROGRAMAÇÃO DO WORKSHOP


14h-14h40              Prof. Dr. Cezar Mortari (UFSC, atual presidente da SBL)

                                TBA


14h50-15h30         Prof. Dr. Walter Carnielli (CLE/UNICAMP)

                                 THE PRINCIPLE OF ARIADNE AND THE AXIOM OF CHOICE

Abstract:  I intend to survey some results on combinatorial aspects of infinite Ramsey-type problems inspired by finite properties, discussing  the relevance of an alternative set-theoretical principle, the so-called “Principle of Ariadne”.  This principle, a rival of the Axiom of Choice and connected to the polarized partition relations, can be consistently added to the usual axiomatic stock of ZF set theory under certain conditions. The new axiom, which preserves all the finite contents of mathematics but deviates from the standard in the infinite contents, may help us to understand the finite-infinite divide in mathematics, making clear that there is more than one way to generalize from finite principles of order (or choice) to the infinite.

15h35-16h00           Prof. Dr. Carlos Brito (UFC)

                                  TALKING ABOUT MEANING: AN ALGORITHMIC APPROACH
                                  TO SEMANTICS

Abstract: The terms in the natural language are typically used to designate objects in the world. However, an important characteristic of natural languages is precisely the fact that they are capable of speaking not only of the objects in the world, but also of language itself, as well as the speakers of the language. The starting point for the development of our proposed notion of algorithmic semantics is the observation that it doesn’t make sense, in some cases, to understand any term as a name for the corresponding sentence or proposition that would exist in the domain of objects. Such terms do not refer to an object, but are themselves the objects which are being talked about. Next, we observe that linguistic objects do not have the same nature as the objects of the world: their properties are not assessed through perceptual inspection, but are defined by the conventional rules of the language. These two observations give rise to the idea of a semantic value that is produced by the execution of an algorithm which verifies a set of rules. The notion of algorithmic semantics opens the way to a number of interesting possibilities: (i) a formal model for a language that can talk about the meaning of its own expressions (the language as its own metalanguage), (ii) quantification over syntactical terms; iii) an alternative semantics for the mathematical discourse, (iv) proof-theoretic semantics as a special case of algorithmic semantics.

16h05-16h30    Prof. Dr. Francicleber M. Ferreira (UFC)

                           COMPLEXITY OF BOUNDED-DEGREE FIXED-POINTS

                         
Abstract:  The characterization of the expressive power of logics over finite structures sheds light on the connections between finite model theory and complexity theory, making it possible to transfer results and insights from one side to the other. In particular, questions about the separation of complexity classes reduce to questions regarding the separation of logics with respect to expressive power. Also, the logical characterization of complexity classes, in the spirit of descriptive complexity, provides a machine-independent representation of such classes and provides decidable languages where all problems in a complexity class can be expressed. In this work we investigate the complexity of problems expressible by fixed-point logics where both the fixed-points computed and the structures over which problems are defined have bounded Gaifman degree, which are related to linear time complexity.

             Membro da Diretoria da SBL