Merlin Carl

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 35

Top Topics

Automated Theorem Provers

Propositional Theories

Picture Languages

Top Venues

Ann. Pure Appl. Log.

Publications

Merlin Carl
Almost Sure OTM-Realizability. CiE (2024)
Merlin Carl, Lorenzo Galeotti, Robert Paßmann
Realisability for infinitary intuitionistic set theory. Ann. Pure Appl. Log. 174 (6) (2023)
Merlin Carl
Using large language models for (de-)formalization and natural argumentation exercises for beginner's students. CoRR (2023)
Merlin Carl
All Melodies Are Lost - Recognizability for Weak and Strong α-Register Machines. CiE (2023)
Merlin Carl
Improving the Diproche CNL through autoformalization via GPT-3. CoRR (2023)
Merlin Carl
Lower Bounds on β (α ). CiE (2022)
Merlin Carl, Hinrich Lorenzen, Michael Schmitz
Natural Language Proof Checking in Introduction to Proof Classes - First Experiences with Diproche. CoRR (2022)
Merlin Carl
Taming Koepke's Zoo II: Register machines. Ann. Pure Appl. Log. 173 (3) (2022)
Merlin Carl
Space-bounded OTMs and REG∞. Comput. 11 (1) (2022)
Merlin Carl, Lorenzo Galeotti, Robert Paßmann
Randomising Realizability. CiE (2021)
Merlin Carl, Lothar Sebastian Krapp
Models of true arithmetic are integer parts of models of real exponentation. J. Log. Anal. 13 (2021)
Merlin Carl
The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines. CiE (2021)
Merlin Carl
Effectivity and reducibility with ordinal Turing machines. Comput. 10 (4) (2021)
Merlin Carl
Automatized Evaluation of Formalization Exercises in Mathematics. CoRR (2020)
Merlin Carl
Using Automated Theorem Provers for Mistake Diagnosis in the Didactics of Mathematics. CoRR (2020)
Merlin Carl, Philipp Schlicht, Philip D. Welch
Decision times of infinite computations. CoRR (2020)
Merlin Carl
Number Theory and Axiomatic Geometry in the Diproche System. ThEdu@IJCAR (2020)
Merlin Carl
Space and time complexity for infinite time Turing machines. J. Log. Comput. 30 (6) (2020)
Merlin Carl
Clockability for Ordinal Turing Machines. CiE (2020)
Merlin Carl, Benjamin G. Rin, Philipp Schlicht
Reachability for infinite time Turing machines with long tapes. Log. Methods Comput. Sci. 16 (2) (2020)
Merlin Carl, Philipp Schlicht
Randomness via Infinite Computation and Effective Descriptive Set Theory. J. Symb. Log. 83 (2) (2018)
Merlin Carl, Asgar Jamneshan
A transfer principle for second-order arithmetic, and applications. J. Log. Anal. 10 (2018)
Merlin Carl, Philipp Schlicht, Philip D. Welch
Recognizable sets and Woodin cardinals: computation beyond the constructible universe. Ann. Pure Appl. Log. 169 (4) (2018)
Merlin Carl, Sabrina Ouazzani, Philip D. Welch
Taming Koepke's Zoo. CiE (2018)
Merlin Carl, Benjamin G. Rin, Philipp Schlicht
Writability and reachability for alpha-tape infinite time Turing machines. CoRR (2018)
Merlin Carl
Some Observations on Infinitary Complexity. CiE (2018)
Merlin Carl, Philipp Schlicht
Infinite Computations with Random Oracles. Notre Dame J. Formal Log. 58 (2) (2017)
Merlin Carl, Philipp Schlicht
The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters. CiE (2017)
Merlin Carl, Bruno Durand, Grégory Lafitte, Sabrina Ouazzani
Admissibles in Gaps. CiE (2017)
Merlin Carl
Infinite time recognizability from generic oracles and the recognizable jump operator. Comput. 6 (3) (2017)
Merlin Carl, Benedikt Löwe, Benjamin G. Rin
Koepke Machines and Satisfiability for Infinitary Propositional Languages. CiE (2017)
Merlin Carl
Randomness and degree theory for infinite time register machines. Comput. 5 (2) (2016)
Merlin Carl
Generalized Effective Reducibility. CiE (2016)
Merlin Carl
Optimal Results on Recognizability for Infinite Time Register Machines. J. Symb. Log. 80 (4) (2015)
Merlin Carl
ITRM I T R M -Recognizability from Random Oracles. CiE (2015)
Merlin Carl
The distribution of ITRM-recognizable reals. Ann. Pure Appl. Log. 165 (9) (2014)
Merlin Carl
Algorithmic Randomness for Infinite Time Register Machines. CiE (2014)
Merlin Carl
A Computational Approach to an Alternative Working Environment for the Constructible Universe. CiE (2011)
Merlin Carl, Tim Fischbach, Peter Koepke, Russell G. Miller, Miriam Nasfi, Gregor Weckbecker
The basic theory of infinite time register machines. Arch. Math. Log. 49 (2) (2010)