We present our experiences teaching two courses on formal methods and detail the
contents of the courses and their positioning in the curriculum. The first course is a bachelor …

We describe SeCaV, a sequent calculus verifier for first-order logic in Isabelle/HOL, and the
SeCaV Unshortener, an online tool that expands succinct derivations into the full SeCaV …

Classical first-order logic is in many ways central to work in mathematics, linguistics,
computer science and artificial intelligence, so it is worthwhile to define it in full detail. We …

We describe a natural deduction formalization of intuitionistic and classical propositional
logic in the Isabelle/Pure framework. In contrast to earlier work, where we explored the …

Utilisation des assistants de preuves pour l'enseignement en L1 Utilisation des assistants de
preuves pour l'enseignement en L1 Retours d'expériences Nous rendons compte de cinq …

In this work, we introduce AXolotl, a self-study aid designed to guide students through the
basics of formal reasoning and term manipulation. Unlike most of the existing study aids for …

Proof competence, ie the ability to write and check (mathematical) proofs, is an important
skill in Computer Science, but for many students it represents a difficult challenge. The main …

Automated reasoning is the study of computer programs that can build proofs of theorems in
a logic. Such programs can be either automatic theorem provers or interactive theorem …

We present a simple prover for classical propositional logic. The prover is based on the
sequent calculus and is formally verified in the Isabelle/HOL proof assistant. We use the …

Isabelle is a proof assistant, ie a computer program that helps its user to define concepts in
mathematics and computer science as well as to prove properties about them. This process …