DeepAI

# The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs

The sequent calculus is a formalism for proving validity of statements formulated in First-Order Logic. It is routinely used in computer science modules on mathematical logic. Formal proofs in the sequent calculus are finite trees obtained by successively applying proof rules to formulas, thus simplifying them step-by-step. Students often struggle with the mathematical formalities and the level of abstraction that topics like formal logic and formal proofs involve. The difficulties can be categorised as syntactic or semantic. On the syntactic level, students need to understand what a correctly formed proof is, how rules can be applied (on paper for instance) without leaving the mathematical framework of the sequent calculus, and so on. Beyond this, on the semantic level, students need to acquire strategies that let them find the right proof. The Sequent Calculus Trainer is a tool that is designed to aid students in learning the techniques of proving given statements formally. In this paper we describe the didactical motivation behind the tool and the techniques used to address issues on the syntactic as well as on the semantic level.

03/10/2023

### A Proof Tree Builder for Sequent Calculus and Hoare Logic

We have developed a web-based pedagogical proof assistant, the Proof Tre...
02/28/2020

### Teaching a Formalized Logical Calculus

Classical first-order logic is in many ways central to work in mathemati...
07/26/2022

### Teaching Simple Constructive Proofs with Haskell Programs

In recent years we have explored using Haskell alongside a traditional m...
10/07/2021

### A Logic-Based Framework for Natural Language Inference in Dutch

We present a framework for deriving inference relations between Dutch se...
02/28/2020

### A Mobile Application for Self-Guided Study of Formal Reasoning

In this work, we introduce AXolotl, a self-study aid designed to guide s...
03/03/2023

### ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses

Constrained Horn Clauses (CHCs) are often used in automated program veri...
03/05/2018

### Teaching the Formalization of Mathematical Theories and Algorithms via the Automatic Checking of Finite Models

Education in the practical applications of logic and proving such as the...