Formalize!(?)

Schedule

15:50 - 16:00 Introduction
16:00 - 16:30 Talk 1: David Fuenmayor & Walter Carnielli: Gödelian flowers in exotic fields: automating (meta-)mathematical reasoning for non-classical logics
16:30 - 17:00 Talk 2: Anna Steensen: A semiotic perspective on the distinction of syntax and semantics in mathematical practice *
(will be held later, you can still join, write us an email)
17:00 - 17:30 Talk 3: Peter Koepke: Formalize, Naturally!
17:30 - 18:00 Naproche Tutorial: Adrian De Lon, Peter Koepke and Anton Lorenzen (Optional) // Break
18:00 - 18:30 Break
18:30 - 19:00 Talk 4: Fenner Stanley Tanswell: Rigour and Formalisability
19:00 - 19:30 Talk 5: Kevin Buzzard: Teaching Mathematicians the New Way
19:30 - 20:00 Talk 6: Paola Iannone & Athina Thoma: Learning about proof with LEAN
20:00 - 21:00 The room will stay open for unofficial discussion.

Abstracts:

Kevin Buzzard: Teaching Mathematicians the New Way
Abstract: Why should mathematicians formalise mathematics in theorem provers? Because it's now not too difficult, and we have no idea what will happen once this becomes normal. But first, we have to teach them how to do it. I will talk about my efforts in this area.

David Fuenmayor & Walter Carnielli: Gödelian flowers in exotic fields: automating (meta-)mathematical reasoning for non-classical logics
How is it possible to employ automated theorem provers and proof assistants for formalization and reasoning in non-classical logics? We will discuss the semantic embedding approach and use it to formalize the 'last mile' of the proof of Gödel's incompleteness theorems in Isabelle/HOL. We aim at motivating a discussion on the use of automated reasoning with non-classical logics for the formalization and interpretation of (meta-)mathematical results.

Paola Iannone & Athina Thoma: Learning about proof with LEAN
Abstract: Why using theorem provers in university instruction? What does one investigation about their use tells us in terms of students producing proofs? We will report on a study on the introduction of LEAN in one first year mathematics module and we will discuss benefits, uptake and (educational) future of this endeavour.

Peter Koepke: Formalize, Naturally!
Abstract: I shall present a version of Euclid's proof of the infinitude of primes in the natural language proof assistant Naproche. Naproche can be understood as an implementation of the derivation indicator view of mathematical proofs: a perfectly natural proof text is transformed into a formal derivation in some proof calculus, using natural language processing, logical transformations and automatic theorem proving. In the subsequent short tutorial on Naproche I shall go into details of the Euclid formalization. The tutorial demonstrates the potential of natural formalizations: in a couple of years and after extensive further development work natural formalizations will become commonplace in mathematical research and teaching!

Anna Steensen: A semiotic perspective on the distinction of syntax and semantics in mathematical practice
There is a common intuition that from a semiotic point of view, formalization in mathematics has to do with introducing and performing transformations of some notation while ignoring meaning. However, studies of various historical mathematical practices have shown this intuition to be problematic both historically and historiographically. I will suggest an approach for analyzing formalization as semiotic process, which hopefully can lead to more nuanced descriptions of historical as well as contemporary mathematical practices.

Fenner Stanley Tanswell: Rigour and Formalisability
Abstract: In this talk I will discuss the relationship between rigour and formalisability, especially focusing on whether informal proofs can be rigorous. I will argue that the concepts of rigour and formalisability don’t coincide for a number of reasons. Nonetheless, these reasons also tell us about why the process of formalising proofs is very useful for the mathematical community.