Conferences  >  Mathematics  >  Automated Theorem Proving

Simons Laufer Mathematical Sciences Institute (SLMath)

Computer assisted proofs are at the forefront of modern mathematics, and have led to many important recent mathematical advances. They provide a way of melding analytical techniques with numerical methods, in order to provide rigorous statements for mathematical models that could not be treated by either method alone. In this summer school, students will review standard computational and analytical techniques, learn to combine these techniques with more specialized methods of interval arithmetic and automatic differentiation, and apply these methods to establish rigorous results in otherwise intractable problems.

Courses and Events for Math Students and Early Career Researchers,    Applied Mathematics (in general)

The 7th International School and Workshop on Proof Theory will be organized by Ghent University under the auspices of The Proof Society.

Following the format of previous editions, the event begins with a three-day Summer School (September 1–3) offering five tutorials on a variety of topics related to proof theory. This will be followed by a two-day Workshop (September 4–5) featuring invited lectures and contributed talks. Guided by The Proof Manifesto, this event embraces the notion of proofs in its broadest sense, welcoming participation and contributions from logic, computer science, mathematics, and beyond.

Mathematical Logic and Foundations,    Courses and Events for Math Students and Early Career Researchers

An international autumn school "Proof and Computation" will be held from 14th to 20th September 2025 at Haus der bayerischen Landwirtschaft in Herrsching near Munich. Its aim is to bring together young researchers in the fields of Foundations of Mathematics, Computer Science and Philosophy.

Courses and Events for Math Students and Early Career Researchers,    Information Theory, Foundations of Computer Science

Banff International Research Station for Mathematical Innovation and Discovery (BIRS)

How hard is it to figure out if there is a way to make a set of logical statements true at the same time by choosing appropriate truth values for their variables? This satisfiability problem is of immense importance both theoretically and practically, and lies right at the heart of mathematics and computer science. On the one hand, today so-called Boolean satisfiability (SAT) solvers are routinely and successfully used to solve large-scale real-world formulas in a wide range of application areas (such as hardware and software verification, electronic design automation, artificial intelligence research, cryptography, bioinformatics, operations research, and sometimes even pure mathematics). On the other hand, this problem is believed to be intractable in general --- though proving that this is so is so is one of the famous million dollar Clay Millennium Problems (the P vs. NP problem) --- and there are tiny formulas for which even the very best SAT solvers today fail miserably.

Boolean satisfiability (SAT)