Today Martin Caminada (Cardiff University) is visiting Swansea. He will give a talk about “A Logical Account of Dishonesty” as a part of out Theory seminar series.
Abstract: Although formal logic is usually applied to reason about truth, in the current resentation we apply it to reason about dishonesty. Based on work in philosophy, we provide a formalisation of different forms of dishonesty, including lies, half-truth and bullshit, and discuss their formal properties. We also provide maxims for dishonest communication, that agents should ideally try to satisfy, both for moral and self-interested reasons.
Martin Caminada has as main research interests formal models of human argument and argumentation as a form of nonmonotonic reasoning. In 2004 he obtained a Ph.D. in computer science with his thesis “For the Sake of the Argument; explorations into argument-based reasoning”. From 2004 to 2007 he w…
Monika Seisenberger (Swansea University) and Lauri Hella (Tampere University, Finland) is chairing the Twenteeth International Workshop on Logic and Computational Complexity (LLC’19), which will be held in Patras, Greece, on July 8, 2019, as part of ICALP.
More information is here:
Logic and Computational Complexity
The Twenteeth International Workshop on Logic and Computational Complexity will be held in Patras, Greece, on July 8, 2019, as part of ICALP.
Dongseong Seon (선동성) from KAIST, Korea is visiting Swansea. This Thursday he will give a talk on computing Haar averages as a part of our Theory seminar series. For more infromation on this topic, please click here.
As a part of our Theory Seminars, today we welcomed Ryota Akiyoshi from Waseda University, who gave a talk on Takeuti’s finitism.
Abstract: In this talk, we address several mathematical and philosophical issues of Gaisi Takeuti’s proof theory, who is one of the most distinguished logicians in proof theory after Hilbert and Gentzen. He furthered the realization of Hilbert’s program by formulating Gentzen’s sequent calculus for higher-oder logics, conjecturing that the cut-elimination holds for it (Takeuti’s conjecture), and obtaining several stunning results in the 1950-60’s towards the solution of his conjecture.
This talk consists of two parts. (1) To summarize Takeuti’s background and the argument of the well-ordering proof of ordinals up to ε0 , (2) To evaluate it on philosophical grounds. Also, we will explain several mathematical and philosophical issues to be solved. This is joint work with Andrew Arana.
My research fields are philosophy of mathematics and logic, mathematical logic (proof theory), and theoretical computer science (type theory). The main philosophical question in my research is "what is a proof ?".