The following pages link to Merlin Carl (Q330193):
Displaying 34 items.
- Structures associated with real closed fields and the axiom of choice (Q330194) (← links)
- A polynomial encoding provability in pure mathematics (outline of an explicit construction) (Q351271) (← links)
- Some observations on infinitary complexity (Q1670730) (← links)
- Taming Koepke's zoo (Q1670732) (← links)
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe (Q1694811) (← links)
- Ordinal computability. An introduction to infinitary machines (Q1738872) (← links)
- Admissibles in gaps (Q2011650) (← links)
- Koepke machines and satisfiability for infinitary propositional languages (Q2011652) (← links)
- The recognizability strength of infinite time Turing machines with ordinal parameters (Q2011653) (← links)
- Taming Koepke's zoo. II: Register machines (Q2067510) (← links)
- Lower bounds on \(\beta (\alpha)\) (Q2104252) (← links)
- Clockability for ordinal Turing machines (Q2106588) (← links)
- The lost melody theorem for infinite time Blum-Shub-Smale machines (Q2117767) (← links)
- Randomising realizability (Q2117768) (← links)
- Decision times of infinite computations (Q2153830) (← links)
- On a Diophantine representation of the predicate of provability (Q2253864) (← links)
- The basic theory of infinite time register machines (Q2267751) (← links)
- On the value group of a model of Peano arithmetic (Q2363347) (← links)
- Infinite computations with random oracles (Q2364653) (← links)
- The distribution of ITRM-recognizable reals (Q2453067) (← links)
- How to grow it? Strategies of mathematical development presented by the example of enumerating certain set partitions (Q2663616) (← links)
- Realisability for infinitary intuitionistic set theory (Q2700803) (← links)
- OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES (Q2795911) (← links)
- (Q2905691) (← links)
- A Computational Approach to an Alternative Working Environment for the Constructible Universe (Q3091437) (← links)
- Generalized Effective Reducibility (Q3188260) (← links)
- $$ITRM$$-Recognizability from Random Oracles (Q3195690) (← links)
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY (Q4579818) (← links)
- Models of true arithmetic are integer parts of models of real exponentation (Q4989722) (← links)
- Space and time complexity for infinite time Turing machines (Q5140310) (← links)
- What is worthy of investigation? Philosophical attitudes and their impact on mathematical development by the example of discovering 10-adic numbers (Q6169841) (← links)
- Randomness via infinite computation and effective descriptive set theory (Q6280636) (← links)
- Space and Time Complexity for Infinite Time Turing Machines (Q6318877) (← links)
- Using Large Language Models for (De-)Formalization and Natural Argumentation Exercises for Beginner's Students (Q6509625) (← links)
