The unification of the paradoxes of truth and vagueness has been a topic of recurrent philosophical interest. 

Por Serena Delli (Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa).

Por Bogdan Dicher (Centro de Filosofia, Universidade de Lisboa).

Abstract: Graph optimization problems find important applications in the analysis of large-scale networks. One representative example is the computation of maximum-size complete subgraphs.

This talk details a computational logic approach for computing maximum-size complete subgraphs, which is not only efficient in practice, but also scales for large-scale networks.

Por Pedro Pinto (Universidade de Lisboa).

An introduction to Constructive Zermelo-Frankel set theory / A calculus for worms

15h00
An introduction to Constructive Zermelo-Frankel set theory
Nicola Gambino (University of Leeds)

Por Imme Van Den Berg (Universidade de Évora).

Emanuele Frittaion
CMAFCIO, Universidade de Lisboa

Abstract: Goodman's theorem (after Nicholas D. Goodman) asserts that adding the axiom of choice to intuitionistic arithmetic in all finite types yields a system which is conservative over Heyting arithmetic. This is in contrast with classical arithmetic in all finite types. In fact, the combination of choice with classical logic results in a system as strong as full second-order arithmetic.

Jean-Yves Béziau
University of Brazil, Rio de Janeiro
École Normale Supérieure, Paris

Por Pablo Cubides Kovacsics (Université de Caen).

Abstract: After introducing C-minimal expansions of valued fields, the aim of the talk is to show that every C-minimal valued field having a value group which is Q-linearly bounded is uniformly polynomially bounded. As a corollary, we obtain that any C-minimal expansion of valued fields like C_p, Falg((tQ)) and, in general, of any valued field having Q as its value group, is uniformly polynomially bounded. This is a joint work with Françoise Delon.

Por Zoran Ognjanovic (Mathematical Institute of the Serbian Academy of Sciences and Arts).