Prezados Ítala, Walter, Juliana, Rodolfo e Marcelo, Excelente a programação. Estaremos lá!
Abraços, On Fri, Jan 13, 2023 at 5:07 PM Walter Carnielli <walte...@unicamp.br> wrote: > WORLD LOGIC DAY - CLE '23 > Online Event > January 16, 2023 > 10:00-12:00 (UTC/GMT -3) > Link: https://meet.google.com/gon-mjxb-uyj > > > Program (UTC/GMT -3) > > 10:00-10:20 Prof. Itala Loffredo D`Ottaviano - CLE/Unicamp > - Perspective about the The São Paulo School of Advanced Science on > Contemporary Logic, Rationality, and Information – SPLogIC > https://www.cle.unicamp.br/splogic/ > - Other personal perspectives > > 10:20-10:40 Prof.Walter Carnielli - CLE and IFCH - Unicamp > - Recent research interests: Non-Classical Probabilities and > Reasoning- New FAPESP Thematic Project > > 10:40-11:00 Prof, Juliana Bueno-Soler - FT and CLE - Unicamp > - Advances in Possibilistic Logic > > 11:00-11:20 Dr. Rodolfo Ertola Biraben - CLE - Unicamp > - Recent research > > 11:20-11:40 Walter Carnielli interviews Dr. Felipe Abraão - CLE- Unicamp > > 11:40-12:00 Prof. Marcelo E. Coniglio - CLE and IFCH - Unicamp > - On Logics of Formal Incompatibility > > Abstract: Marcelo E. Coniglio Centre for Logic, Epistemology and the > History of Science, and Institute of Philosophy and the Humanities- Uniamp > and Guilherme V. Toledo The Spiegel Mathematics & Computer Center Bar Ilan > University, Israel Abstract: In this talk we propose a generalization of > logics of formal inconsistency (LFIs) to systems dealing with the concept > of incompatibility, expressed by means of a binary connective. The basic > idea is that having two incompatible formulas to hold trivializes a > deduction, and as a special case, a formula becomes consistent (in the > sense of LFIs) when it is incompatible with its own negation. We show how > this notion extends that of consistency in LFIs in a non-trivial way, > presenting conservative translations for many simple LFIs into some of the > most basic logics of incompatibility. We provide semantics for the new > logics, as well as decision procedures, based on restricted > non-deterministic matrices. The use of non-deterministic semantics with > restrictions is justified by the fact that, as proved here, these systems > are not algebraizable according to Blok-Pigozzi nor are they > characterizable by finite Nmatrices. > > 12:00 Closure > Data > 16/01/2023 - 10:00 > Language Portuguese, Brazil > > -- > LOGICA-L > Lista acadêmica brasileira dos profissionais e estudantes da área de > Lógica <logica-l@dimap.ufrn.br> > --- > Você recebeu essa mensagem porque está inscrito no grupo "LOGICA-L" dos > Grupos do Google. > Para cancelar inscrição nesse grupo e parar de receber e-mails dele, envie > um e-mail para logica-l+unsubscr...@dimap.ufrn.br. > Para ver essa discussão na Web, acesse > https://groups.google.com/a/dimap.ufrn.br/d/msgid/logica-l/CAOrCsLcorRzn1es45%3DhgLdmsPR80UeNPqnnCsAM9F4L1q6FThw%40mail.gmail.com > <https://groups.google.com/a/dimap.ufrn.br/d/msgid/logica-l/CAOrCsLcorRzn1es45%3DhgLdmsPR80UeNPqnnCsAM9F4L1q6FThw%40mail.gmail.com?utm_medium=email&utm_source=footer> > . > -- Elaine. ----------------------------------- Elaine Pimentel Associate Professor in Programming Principles, Logic, and Verification Department of Computer Science University College London https://sites.google.com/site/elainepimentel/ ----------------------------------- -- LOGICA-L Lista acadêmica brasileira dos profissionais e estudantes da área de Lógica <logica-l@dimap.ufrn.br> --- Você está recebendo esta mensagem porque se inscreveu no grupo "LOGICA-L" dos Grupos do Google. Para cancelar inscrição nesse grupo e parar de receber e-mails dele, envie um e-mail para logica-l+unsubscr...@dimap.ufrn.br. Para ver esta discussão na web, acesse https://groups.google.com/a/dimap.ufrn.br/d/msgid/logica-l/CAHQVs%2BW3Y6eNoFEhb_5doHZcOWef41S-9pNpb8iV2Szzx1LCMA%40mail.gmail.com.
