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
Portuguese, Brazil
PUBLICAÇÕES / PUBLICATIONS
CLE"