Merlin Carl
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Merlin Carl has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Philipp Schlicht
Dipartimento di Ingegneria dell’Informazione e Scienze Matematiche Università di Siena 53100 Siena, Italy
5 shared publications - Philip D. Welch
Univ Bristol, Sch Math, Bristol BS8 1TW, Avon, England
4 shared publications - Michael Schmitz
Europa-Universität Flensburg
2 shared publications - Paola D'Aquino
Department of Mathematics Seconda Università di Napoli Via Vivaldi 43 81100 Caserta
2 shared publications - Philipp Schlicht
MATHEMATISCHES INSTITUT, UNIVERSITÄT BONN ENDENICHER ALLEE 60 53115 BONN, GERMANY
2 shared publications Sabrina Ouazzani
LACL, Université Paris-Est Créteil
2 shared publications
Latest Publications
- 20 July 2026
- Published by Springer Nature
- p. 178-192
Complexities of Effective Reductions with Ordinal Turing Machines
- 20 July 2026
- Published by Springer Nature
- p. 178-192
Complexities of Effective Reductions with Ordinal Turing Machines
- 21 June 2026
- Published by Springer Nature in Israel Journal of Mathematics
- p. 1-49
Countable ranks at the first and second projective levels
- 21 June 2026
- Published by Springer Nature in Israel Journal of Mathematics
- p. 1-49
Countable ranks at the first and second projective levels
- 9 August 2024
- Published by Springer Nature
- p. 221-242
Per figuras ad astra. Die Bedeutung der Mathematik für den Aufstieg in der Politeia
- 9 August 2024
- Published by Springer Nature
- p. 221-242
Per figuras ad astra. Die Bedeutung der Mathematik für den Aufstieg in der Politeia
- Open Access
- 1 July 2024
- Published by Claremont Colleges Library in Journal of Humanistic Mathematics
- Vol. 14 (2) , 27-59
Sociomathematical Norms and Automated Proof Checking in Mathematical Education: Reflections and Experiences
According to a widely held view, mathematical proofs are essentially (indications of) formal derivations, and thus in principle mechanically checkable (this view is defended, for example, by Azzouni [3]). This should in particular hold for the kind of simple proof exercises typically given to students of mathematics learning to write proofs. If that is so, then automated proof checking should be an attractive option for math education at the undergraduate level. An opposing view would be that mathematical proofs are social objects and that what constitutes a mathematical proof can thus not be separated from the social context in which it arises. In particular, such “sociomathematical norms” play a role in teaching situations, see, for example, Stephan [37]. There thus seems to be a tension between the inherent social nature of “natural” mathematical proofs and attempts at their automated verification. In this paper, we explore this tension both theoretically and on the basis of our experiences with developing the Diproche system, a program for the automated verification of natural language proofs in college-level introduction to proof classes (modelled after the example of the Naproche system by Cramer, Koepke et al. [14]) and its use at the Europa-Universität Flensburg during the winter term 2020/2021.
- 1 July 2024
- Published by Claremont Colleges Library in Journal of Humanistic Mathematics
- Vol. 14 (2) , 27-59
Open AccessSociomathematical Norms and Automated Proof Checking in Mathematical Education: Reflections and Experiences
According to a widely held view, mathematical proofs are essentially (indications of) formal derivations, and thus in principle mechanically checkable (this view is defended, for example, by Azzouni [3]). This should in particular hold for the kind of simple proof exercises typically given to students of mathematics learning to write proofs. If that is so, then automated proof checking should be an attractive option for math education at the undergraduate level. An opposing view would be that mathematical proofs are social objects and that what constitutes a mathematical proof can thus not be separated from the social context in which it arises. In particular, such “sociomathematical norms” play a role in teaching situations, see, for example, Stephan [37]. There thus seems to be a tension between the inherent social nature of “natural” mathematical proofs and attempts at their automated verification. In this paper, we explore this tension both theoretically and on the basis of our experiences with developing the Diproche system, a program for the automated verification of natural language proofs in college-level introduction to proof classes (modelled after the example of the Naproche system by Cramer, Koepke et al. [14]) and its use at the Europa-Universität Flensburg during the winter term 2020/2021.
- Open Access
- 4 April 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 400, 28-43
Using Large Language Models for (De-)Formalization and Natural Argumentation Exercises for Beginner's Students
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 language and the languages of propositional logic and first-order predicate logic and (ii) exercises in writing simple arguments in natural language in non-mathematical scenarios.
- 4 April 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 400, 28-43
Open AccessUsing Large Language Models for (De-)Formalization and Natural Argumentation Exercises for Beginner's Students
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 language and the languages of propositional logic and first-order predicate logic and (ii) exercises in writing simple arguments in natural language in non-mathematical scenarios.
- Open Access
- 4 April 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 400, 44-58
Improving the Diproche CNL through Autoformalization via Large Language Models
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 proofs for the first time. The first version of the system used a controlled natural language for which a Prolog formalization routine was written. In this paper, we explore the possibility of prompting large language models for autoformalization in the context of Diproche, with encouraging first results.
- 4 April 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 400, 44-58
Open AccessImproving the Diproche CNL through Autoformalization via Large Language Models
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 proofs for the first time. The first version of the system used a controlled natural language for which a Prolog formalization routine was written. In this paper, we explore the possibility of prompting large language models for autoformalization in the context of Diproche, with encouraging first results.
- 6 March 2024
- Published by SAGE Publications in Computability
- Vol. Preprint (Preprint) , 1-26
Lower bounds on β ( α ) and other properties of α-register machines
This paper extends our paper (In Revolutions and Revelations in Computability. CiE 2022 (2022)) for the conference “Computability in Europe” 2022. After Infinite Time Turing Machines (ITTM) were introduced in Hamkins and Lewis (Journal of Symbolic Logic 65 (2000)), a number of machine models of computability have been generalized to the transfinite. While for some of these models the computational strength has been successfully determined, there are still several white spots on the map of transfinite computability. In this paper, we contribute to the understanding of the computational strength of transfinite machine models by (i) proving lower bounds on the computational strength of α-Infinite Time Register Machines (α-ITRMs) for certain values of α, refuting a conjecture about their strength made in (Annals of Pure and Applied Logic 173 (2022)), (ii) showing that the computational strength of cardinal-recognizing ITRMs is equal to that of ITRMs and (iii) showing that non-solvability of the bounded halting problem, existence of a universal machine and an increase of computational power by allowing machines to recognize cardinals are equivalent for α-ITRMs for all relevant values of α. Finally, we give some results indicating how the picture changes when the use of parameters is dropped or restricted.
- 6 March 2024
- Published by SAGE Publications in Computability
- Vol. Preprint (Preprint) , 1-26
Lower bounds on β ( α ) and other properties of α-register machines
This paper extends our paper (In Revolutions and Revelations in Computability. CiE 2022 (2022)) for the conference “Computability in Europe” 2022. After Infinite Time Turing Machines (ITTM) were introduced in Hamkins and Lewis (Journal of Symbolic Logic 65 (2000)), a number of machine models of computability have been generalized to the transfinite. While for some of these models the computational strength has been successfully determined, there are still several white spots on the map of transfinite computability. In this paper, we contribute to the understanding of the computational strength of transfinite machine models by (i) proving lower bounds on the computational strength of α-Infinite Time Register Machines (α-ITRMs) for certain values of α, refuting a conjecture about their strength made in (Annals of Pure and Applied Logic 173 (2022)), (ii) showing that the computational strength of cardinal-recognizing ITRMs is equal to that of ITRMs and (iii) showing that non-solvability of the bounded halting problem, existence of a universal machine and an increase of computational power by allowing machines to recognize cardinals are equivalent for α-ITRMs for all relevant values of α. Finally, we give some results indicating how the picture changes when the use of parameters is dropped or restricted.
- Open Access
- 8 February 2024
- Published by Springer Nature in International Journal for Philosophy of Religion
- Vol. 95 (3) , 233-256
The negative theology of absolute infinity: Cantor, mathematics, and humility
Cantor argued that absolute infinity is beyond mathematical comprehension. His arguments imply that the domain of mathematics cannot be grasped by mathematical means. We argue that this inability constitutes a foundational problem. For Cantor, however, the domain of mathematics does not belong to mathematics, but to theology. We thus discuss the theological significance of Cantor’s treatment of absolute infinity and show that it can be interpreted in terms of negative theology. Proceeding from this interpretation, we refer to the recent debate on absolute generality and argue that the method of diagonalization constitutes a modern version of the vianegativa. On our reading, negative theology can evoke an attitude of humility with respect to the boundedness of the human condition. Along these lines, we think that the foundational problem of mathematics concerning its domain can be addressed through a methodological attitude of humility.
- 8 February 2024
- Published by Springer Nature in International Journal for Philosophy of Religion
- Vol. 95 (3) , 233-256
Open AccessThe negative theology of absolute infinity: Cantor, mathematics, and humility
Cantor argued that absolute infinity is beyond mathematical comprehension. His arguments imply that the domain of mathematics cannot be grasped by mathematical means. We argue that this inability constitutes a foundational problem. For Cantor, however, the domain of mathematics does not belong to mathematics, but to theology. We thus discuss the theological significance of Cantor’s treatment of absolute infinity and show that it can be interpreted in terms of negative theology. Proceeding from this interpretation, we refer to the recent debate on absolute generality and argue that the method of diagonalization constitutes a modern version of the vianegativa. On our reading, negative theology can evoke an attitude of humility with respect to the boundedness of the human condition. Along these lines, we think that the foundational problem of mathematics concerning its domain can be addressed through a methodological attitude of humility.