3 papers
math.LO2024
The strange world of transfinite Melodies -- Recognizability for weak and strong infinite time -register machines
Merlin Carl
For exponentially closed ordinals , we consider recognizability of constructible subsets of for -(w)ITRMs and their distribution in the constructible hierarchy. In par…
cs.CL2024
Using Large Language Models for (De-)Formalization and Natural Argumentation Exercises for Beginner's Students
Merlin Carl
We describe two systems currently being developed that use large language models for the automatized correction of (i) exercises in translating back and forth between natural langu…
cs.CL2024
Improving the Diproche CNL through Autoformalization via Large Language Models
Merlin Carl
The Diproche system is an automated proof checker for texts written in a controlled fragment of German, designed for didactical applications in classes introducing students to proo…