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

02/08/2022
by   Merlin Carl, et al.
0

We present and analyze the employment of the Diproche system, a natural language proof checker, within a one-semester mathematics beginners lecture with 228 participants. The system is used to check the students' solution attempts to proving exercises in Boolean set theory and elementary number theory and to give them immediate feedback. The benefits of the employment of the system are assessed via a questionnaire at the end of the semester and via analyzing the solution attempts of a subgroup of the students. Based on our results we develop approaches for future improvements.

READ FULL TEXT

page 3

page 5

research
04/01/2019

Students' Proof Assistant (SPA)

The Students' Proof Assistant (SPA) aims to both teach how to use a proo...
research
06/02/2020

Automatized Evaluation of Formalization Exercises in Mathematics

We describe two systems for supporting beginner students in acquiring ba...
research
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...
research
03/11/2016

A short proof that O_2 is an MCFL

We present a new proof that O_2 is a multiple context-free language. It ...
research
03/12/2023

Improving the Diproche CNL through autoformalization via GPT-3

The Diproche system is an automated proof checker for texts written in a...
research
05/17/2023

What do we know when we know that a theory is consistent?

Given a first-order theory and a proof that it is consistent, can we des...
research
02/12/2020

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

The Diproche system, an automated proof checker for natural language pro...

Please sign up or login with your details

Forgot password? Click here to reset