Using Automated Theorem Provers for Mistake Diagnosis in the Didactics of Mathematics

02/12/2020
by   Merlin Carl, et al.
0

The Diproche system, an automated proof checker for natural language proofs specifically adapted to the context of exercises for beginner's students similar to the Naproche system by Koepke, Schröder, Cramer and others, uses a modification of an automated theorem prover which uses common formal fallacies intead of sound deduction rules for mistake diagnosis. We briefly describe the concept of such an `Anti-ATP' and explain the basic techniques used in its implementation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2020

Generative Language Modeling for Automated Theorem Proving

We explore the application of transformer-based language models to autom...
research
08/29/2018

Comparison of Two Theorem Provers: Isabelle/HOL and Coq

The need for formal definition of the very basis of mathematics arose in...
research
02/24/2023

ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics

We introduce ProofNet, a benchmark for autoformalization and formal prov...
research
03/05/2022

The Proof is in the Pudding: Using Automated Theorem Proving to Generate Cooking Recipes

This paper presents FASTFOOD, a rule-based Natural Language Generation P...
research
01/03/2022

Open Geometry Prover Community Project

Mathematical proof is undoubtedly the cornerstone of mathematics. The em...
research
03/10/2023

A Rule Based Theorem Prover: an Introduction to Proofs in Secondary Schools

The introduction of automated deduction systems in secondary schools fac...
research
02/08/2022

Natural Language Proof Checking in Introduction to Proof Classes – First Experiences with Diproche

We present and analyze the employment of the Diproche system, a natural ...

Please sign up or login with your details

Forgot password? Click here to reset