Category Archives: Research

36th British Colloquium for Theoretical Computer Science


Wordpress is loading infos from ac

Please wait for API server to collect data from

Swansea University is looking forward to host BCTCS2020 this April.

Meeting to commemorate the logician Erik Palmgren (1963-2019) on the occasion of the World Logic Day

We meet to remember the great logician Erik Palmgren who sadly passed away in November 2019 .

To honor Erik Palmgren’s work, Anton Setzer will give a talk with the title:

Palmgren’s interpretation of inductive definitions in type theory and development of  higher type universes in type theory.

The meeting also marks the 2nd World Logic Day.

Venue: Theory Lab (CoFo 209)

Time: 14th of January 2020, 2-3 pm

Hideki Tsuiki is back in Swansea

We Hideki Tsuiki in Swanseaare glad to welcome Hideki Tsuiki in Swansea again.  This Thursday we really enjoyed his talk on “Imaginary Cubes —  Mathematics, Puzzle, Art and Education”.

Abstract: Imaginary cubes are three-dimensional objects with square projections in three orthogonal ways just as a cube has.   How many different kinds of imaginary cubes can you imagine?  In this talk we  show that there are 16 kinds of minimal convex imaginary cubes which includes regular tetrahedron, cuboctahedron, and two objects that we call H and T.  As we will explain, H and T have a lot of beautiful mathematical properties related to tiling, fractal, and higher-dimensional geometry, and based on these properties, the speaker has designed a puzzle, constructed three-dimensional math-art objects, and used them for educations at various levels from elemental school to graduate schools. In this talk, I will explain mathematics of imaginary cubes and show the activities I have been engaged in.  I will carry a couple of copies of the puzzle and some of the math-art objects so that the audience can enjoy them while I am staying in Swansea.

2nd Proof Society Workshop on Proof Theory and its Applications

Following the Summer School, we are really proud to host the 2nd Proof Society Workshop. The workshop was an opportunity to listen to a lot of interesting invited and contributed talks on proof theory and various areas of its application:

Adam Wyner: Computational Law – The Case of Autonomous Vehicles
Yong Cheng: Exploring the incompleteness phenomenon
Matthias Baaz: Towards a Proof Theory for Henkin Quantifiers
Sonia Marin: On cut-elimination for non-wellfounded proofs: the case of PDL
Gilles Dowek: Logical frameworks, reverse mathematics, and formal proofs translation
Benjamin Ralph: What is a combinatorial proof system?
William Stirton: Ordinal assignments correlated with notions of reduction
Oliver Kullmann: Practical proof theory: practical versions of Extended Resolution
Anton Setzer and Ulrich Berger on behalf of Ralph Matthes: Martin Hofmann’s case for non-strictly positive data types – reloaded
Laura Crosilla: Philosophy of mathematics and proof theory
Takako Nemoto: Recursion Theory in Constructive Mathematics
Arno Pauly: Combinatorial principles equivalent to weak induction
Antonina Kolokolova: The proof complexity of reasoning over richer domains
Joost Joosten: The reduction property revisited
Helmut Schwichtenberg: Computational content of proofs

Thanks to all the speaker and participants and we hope to see you all again soon.

Proof Society Workshop 2019

Logic and Computational Complexity 2019

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:

Ryota Akiyoshi visiting

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.

Erisa Karafili on forensic analysis of cyber-attacks

Today Erisa Karafili from the Imperial College London has given a talk on “Helping Forensic Analysts to Analyze and Attribute Cyber-Attacks” as a part of our Theory seminars.

Abstract: The frequency and harmfulness of cyber-attacks are increasing every day, and with them also the amount of data that the cyber-forensics analysts need to collect and analyze. Analyzing and discovering who performed an attack or from where it originated would permit to put in act targeted mitigative and preventive measures. In my talk, I will present two techniques that help the forensics analyst to analyze and attribute cyber-attacks. The first technique is a formal analysis process that allows an analyst to filter the enormous amount of evidence collected and either identify crucial information about the attack (e.g., when it occurred, its culprit, its target) or, at the very least, perform a pre-analysis to reduce the complexity of the problem in order to then draw conclusions more swiftly and efficiently. The second technique is a novel argumentation-based reasoner (ABR) for analyzing and attributing cyber-attacks that includes in its reasoning technical and social evidence.