default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMerlin Carl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Merlin Carl:
Almost Sure OTM-Realizability. CiE 2024: 153-165- 2023
- [j16]Merlin Carl, Lorenzo Galeotti, Robert Paßmann
:
Realisability for infinitary intuitionistic set theory. Ann. Pure Appl. Log. 174(6): 103259 (2023) - [c18]Merlin Carl:
All Melodies Are Lost - Recognizability for Weak and Strong α-Register Machines. CiE 2023: 77-88 - [c17]Merlin Carl:
Using large language models for (de-)formalization and natural argumentation exercises for beginner's students. ThEdu@CADE 2023: 28-43 - [c16]Merlin Carl:
Improving the Diproche CNL through autoformalization via GPT-3. ThEdu@CADE 2023: 44-58 - 2022
- [j15]Merlin Carl:
Taming Koepke's Zoo II: Register machines. Ann. Pure Appl. Log. 173(3): 103041 (2022) - [j14]Merlin Carl:
Space-bounded OTMs and REG∞. Comput. 11(1): 41-56 (2022) - [c15]Merlin Carl:
Lower Bounds on β (α ). CiE 2022: 64-73 - 2021
- [j13]Merlin Carl:
Effectivity and reducibility with ordinal Turing machines. Comput. 10(4): 289-304 (2021) - [j12]Merlin Carl, Lothar Sebastian Krapp:
Models of true arithmetic are integer parts of models of real exponentation. J. Log. Anal. 13 (2021) - [c14]Merlin Carl:
The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines. CiE 2021: 71-81 - [c13]Merlin Carl, Lorenzo Galeotti, Robert Paßmann:
Randomising Realizability. CiE 2021: 82-93 - [c12]Merlin Carl, Hinrich Lorenzen, Michael Schmitz:
Natural Language Proof Checking in Introduction to Proof Classes - First Experiences with Diproche. ThEdu@CADE 2021: 59-70 - 2020
- [j11]Merlin Carl, Benjamin G. Rin, Philipp Schlicht:
Reachability for infinite time Turing machines with long tapes. Log. Methods Comput. Sci. 16(2) (2020) - [j10]Merlin Carl:
Space and time complexity for infinite time Turing machines. J. Log. Comput. 30(6): 1239-1255 (2020) - [c11]Merlin Carl:
Clockability for Ordinal Turing Machines. CiE 2020: 14-25 - [c10]Merlin Carl:
Number Theory and Axiomatic Geometry in the Diproche System. ThEdu@IJCAR 2020: 56-78 - [i4]Merlin Carl:
Using Automated Theorem Provers for Mistake Diagnosis in the Didactics of Mathematics. CoRR abs/2002.05083 (2020) - [i3]Merlin Carl:
Automatized Evaluation of Formalization Exercises in Mathematics. CoRR abs/2006.01800 (2020) - [i2]Merlin Carl, Philipp Schlicht, Philip D. Welch:
Decision times of infinite computations. CoRR abs/2011.04942 (2020)
2010 – 2019
- 2018
- [j9]Merlin Carl, Philipp Schlicht, Philip D. Welch:
Recognizable sets and Woodin cardinals: computation beyond the constructible universe. Ann. Pure Appl. Log. 169(4): 312-332 (2018) - [j8]Merlin Carl, Asgar Jamneshan:
A transfer principle for second-order arithmetic, and applications. J. Log. Anal. 10 (2018) - [j7]Merlin Carl, Philipp Schlicht:
Randomness via Infinite Computation and Effective Descriptive Set Theory. J. Symb. Log. 83(2): 766-789 (2018) - [c9]Merlin Carl:
Some Observations on Infinitary Complexity. CiE 2018: 118-125 - [c8]Merlin Carl, Sabrina Ouazzani, Philip D. Welch:
Taming Koepke's Zoo. CiE 2018: 126-135 - [i1]Merlin Carl, Benjamin G. Rin, Philipp Schlicht:
Writability and reachability for alpha-tape infinite time Turing machines. CoRR abs/1802.05734 (2018) - 2017
- [j6]Merlin Carl:
Infinite time recognizability from generic oracles and the recognizable jump operator. Comput. 6(3): 223-247 (2017) - [j5]Merlin Carl, Philipp Schlicht:
Infinite Computations with Random Oracles. Notre Dame J. Formal Log. 58(2): 249-270 (2017) - [c7]Merlin Carl, Bruno Durand, Grégory Lafitte, Sabrina Ouazzani:
Admissibles in Gaps. CiE 2017: 175-186 - [c6]Merlin Carl, Benedikt Löwe, Benjamin G. Rin:
Koepke Machines and Satisfiability for Infinitary Propositional Languages. CiE 2017: 187-197 - [c5]Merlin Carl, Philipp Schlicht:
The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters. CiE 2017: 198-209 - 2016
- [j4]Merlin Carl:
Randomness and degree theory for infinite time register machines. Comput. 5(2): 181-196 (2016) - [c4]Merlin Carl:
Generalized Effective Reducibility. CiE 2016: 225-233 - 2015
- [j3]Merlin Carl:
Optimal Results on Recognizability for Infinite Time Register Machines. J. Symb. Log. 80(4): 1116-1130 (2015) - [c3]Merlin Carl:
ITRM I T R M -Recognizability from Random Oracles. CiE 2015: 137-144 - 2014
- [j2]Merlin Carl:
The distribution of ITRM-recognizable reals. Ann. Pure Appl. Log. 165(9): 1403-1417 (2014) - [c2]Merlin Carl:
Algorithmic Randomness for Infinite Time Register Machines. CiE 2014: 84-92 - 2011
- [c1]Merlin Carl:
A Computational Approach to an Alternative Working Environment for the Constructible Universe. CiE 2011: 21-30 - 2010
- [j1]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): 249-273 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
