Speaker: Paulo Guilherme Santos (Departamento de Matemática - Universidade Nova de Lisboa).
Abstract: In this talk, we will present a form of completeness for numerals that holds for Peano Arithmetic. We will establish relationships between this result and a weak version of an initial form of Hilbert's Program.
Speaker: Ulrich Kohlenbach (Department of Mathematics - Technische Universität Darmstadt).
Speaker: Imme van den Berg (CIMA, Universidade de Évora).
Speaker: Étienne Miquey (École Normale Supérieure de Lyon).
Speaker: Étienne Miquey (École Normale Supérieure de Lyon).
Speaker: António Marques Fernandes (Instituto Superior Técnico - Universidade de Lisboa).
Zoom Meeting | Meeting ID: 890 8479 3299 | Password: 409604
Speaker: Jaime Gaspar (Centro de Matemática e Aplicações - CMA, FCT, UNL).
Speaker: Pedro Pinto (Technische Universitat Darmstadt).
Abstract: Proof mining is a research program that employs proof theoretical tools to obtain additional information from mathematical results, [1]. Its techniques have been applied successfully to many areas of Mathematics with special focus on Nonlinear Analysis. This presentation reports ongoing joint work with Ulrich Kohlenbach.
Speaker: Clarence Protin.
Abstract: Many intuitively valid arguments involving intensionality cannot be captured by first-order logic, even when extended by modal and epistemic operators.
Indeed, previous attempts at providing an adequate treatment of the phenomenon of intensionality in logic and language, such as those of Frege, Church, Russell, Carnap, Quine, Montague and others are fraught with numerous philosophical and technical difficulties and shortcomings.
Speaker: Clarence Protin.
Abstract: Many intuitively valid arguments involving intensionality cannot be captured by first-order logic, even when extended by modal and epistemic operators.
Indeed, previous attempts at providing an adequate treatment of the phenomenon of intensionality in logic and language, such as those of Frege, Church, Russell, Carnap, Quine, Montague and others are fraught with numerous philosophical and technical difficulties and shortcomings.
