:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Carl, Merlin
Format:	Preprint
Published:	2013
Subjects:	Logic
Online Access:	https://arxiv.org/abs/1306.5128
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The distribution of ITRM-recognizable reals
by: Carl, Merlin
Published: (2012)

Models of true arithmetic are integer parts of nice real closed fields
by: Carl, Merlin
Published: (2013)

The Lost Melody Phenomenon
by: Carl, Merlin
Published: (2014)

Randomness and Degree Theory for Infinite Time Register Machines
by: Carl, Merlin
Published: (2015)

Infinite Time Recognizability from Random Oracles and the Recognizable Jump Operator
by: Carl, Merlin
Published: (2015)

The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
by: Carl, Merlin
Published: (2020)

Structures Associated with Real Closed Fields and the Axiom of Choice
by: Carl, Merlin
Published: (2014)

Space-Bounded OTMs and REG$^{\infty}$
by: Carl, Merlin
Published: (2017)

A Note on OTM-Realizability and Constructive Set Theories
by: Carl, Merlin
Published: (2019)

Recognizable Realizability
by: Carl, Merlin
Published: (2024)

Algorithmic Randomness for Infinite Time Register Machines
by: Carl, Merlin
Published: (2014)

Taming Koepke's Zoo II: Register Machines
by: Carl, Merlin
Published: (2019)

Reduction Complexities in Set Theory
by: Carl, Merlin
Published: (2025)

A Note on Clockability for Ordinal Turing Machines
by: Carl, Merlin
Published: (2019)

Lower bounds on $β(α)$ and other properties of $α$-ITRMs
by: Carl, Merlin
Published: (2021)

A Note on Power-OTMs
by: Carl, Merlin
Published: (2024)

Some Observations on Infinitary Complexity
by: Carl, Merlin
Published: (2018)

The strange world of transfinite Melodies -- Recognizability for weak and strong infinite time $α$-register machines
by: Carl, Merlin
Published: (2022)

Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines
by: Carl, Merlin
Published: (2024)

Generalized Effective Reducibility
by: Carl, Merlin
Published: (2016)

Effectivity and Reducibility with Ordinal Turing Machines
by: Carl, Merlin
Published: (2018)

Space and Time Complexity for Infinite Time Turing Machines
by: Carl, Merlin
Published: (2019)

Almost sure OTM-realizability
by: Carl, Merlin
Published: (2024)

Using Large Language Models for (De-)Formalization and Natural Argumentation Exercises for Beginner's Students
by: Carl, Merlin
Published: (2023)

Canonical Truth
by: Carl, Merlin, et al.
Published: (2017)

Randomness via infinite computation and effective descriptive set theory
by: Carl, Merlin, et al.
Published: (2016)

Improving the Diproche CNL through Autoformalization via Large Language Models
by: Carl, Merlin
Published: (2023)

Recognizable sets and Woodin cardinals: Computation beyond the constructible universe
by: Carl, Merlin, et al.
Published: (2015)

Non-Derivability Results in Polymorphic Dependent Type Theory
by: Geuvers, Herman
Published: (2026)

Some General Completeness Results for Propositionally Quantified Modal Logics
by: Ding, Yifeng, et al.
Published: (2024)

Efficient Model Checking for the Alternating-Time μ-Calculus via Effectivity Frames
by: Hausmann, Daniel, et al.
Published: (2025)

Results on Colored Tree Properties
by: Day, Gabriel
Published: (2025)

A Characterization Result for Non-Distributive Logics
by: Chrysafis, et al.
Published: (2020)

Some Results on Finitely Splitting Subtrees of Aronszajn Trees
by: Krueger, John
Published: (2024)

Goodstein at the Second Threshold: An Independence Result for $ID_2$
by: Gjetaj, Oriola, et al.
Published: (2026)

At the Edge of Putnam's Program: Limitative Results For Computable Inductive Logics
by: Mercier, Antoine, et al.
Published: (2026)

RV32I in ACL2
by: Kwan, Carl
Published: (2025)

Forcing Axioms for Proper Posets Preserving a Topological Property: Consistency Results
by: Gilton, Thomas
Published: (2025)

Optimal Syntactic Definitions of Back-and-Forth Types
by: Chen, Ruiyuan, et al.
Published: (2025)

The Unification Type of an Equational Theory May Depend on the Instantiation Preorder: From Results for Single Theories to Results for Classes of Theories
by: Baader, Franz, et al.
Published: (2026)