:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Carl, Merlin
Format:	Preprint
Publié:	2013
Sujets:	Logic
Accès en ligne:	https://arxiv.org/abs/1306.5128
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The distribution of ITRM-recognizable reals
par: Carl, Merlin
Publié: (2012)

Models of true arithmetic are integer parts of nice real closed fields
par: Carl, Merlin
Publié: (2013)

The Lost Melody Phenomenon
par: Carl, Merlin
Publié: (2014)

Randomness and Degree Theory for Infinite Time Register Machines
par: Carl, Merlin
Publié: (2015)

Infinite Time Recognizability from Random Oracles and the Recognizable Jump Operator
par: Carl, Merlin
Publié: (2015)

The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
par: Carl, Merlin
Publié: (2020)

Structures Associated with Real Closed Fields and the Axiom of Choice
par: Carl, Merlin
Publié: (2014)

Space-Bounded OTMs and REG$^{\infty}$
par: Carl, Merlin
Publié: (2017)

A Note on OTM-Realizability and Constructive Set Theories
par: Carl, Merlin
Publié: (2019)

Recognizable Realizability
par: Carl, Merlin
Publié: (2024)

Algorithmic Randomness for Infinite Time Register Machines
par: Carl, Merlin
Publié: (2014)

Taming Koepke's Zoo II: Register Machines
par: Carl, Merlin
Publié: (2019)

Reduction Complexities in Set Theory
par: Carl, Merlin
Publié: (2025)

A Note on Clockability for Ordinal Turing Machines
par: Carl, Merlin
Publié: (2019)

Lower bounds on $β(α)$ and other properties of $α$-ITRMs
par: Carl, Merlin
Publié: (2021)

A Note on Power-OTMs
par: Carl, Merlin
Publié: (2024)

Some Observations on Infinitary Complexity
par: Carl, Merlin
Publié: (2018)

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

Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines
par: Carl, Merlin
Publié: (2024)

Generalized Effective Reducibility
par: Carl, Merlin
Publié: (2016)

Effectivity and Reducibility with Ordinal Turing Machines
par: Carl, Merlin
Publié: (2018)

Space and Time Complexity for Infinite Time Turing Machines
par: Carl, Merlin
Publié: (2019)

Almost sure OTM-realizability
par: Carl, Merlin
Publié: (2024)

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

Canonical Truth
par: Carl, Merlin, et autres
Publié: (2017)

Randomness via infinite computation and effective descriptive set theory
par: Carl, Merlin, et autres
Publié: (2016)

Improving the Diproche CNL through Autoformalization via Large Language Models
par: Carl, Merlin
Publié: (2023)

Recognizable sets and Woodin cardinals: Computation beyond the constructible universe
par: Carl, Merlin, et autres
Publié: (2015)

Non-Derivability Results in Polymorphic Dependent Type Theory
par: Geuvers, Herman
Publié: (2026)

Some General Completeness Results for Propositionally Quantified Modal Logics
par: Ding, Yifeng, et autres
Publié: (2024)

Efficient Model Checking for the Alternating-Time μ-Calculus via Effectivity Frames
par: Hausmann, Daniel, et autres
Publié: (2025)

Results on Colored Tree Properties
par: Day, Gabriel
Publié: (2025)

A Characterization Result for Non-Distributive Logics
par: Chrysafis, et autres
Publié: (2020)

Some Results on Finitely Splitting Subtrees of Aronszajn Trees
par: Krueger, John
Publié: (2024)

Goodstein at the Second Threshold: An Independence Result for $ID_2$
par: Gjetaj, Oriola, et autres
Publié: (2026)

At the Edge of Putnam's Program: Limitative Results For Computable Inductive Logics
par: Mercier, Antoine, et autres
Publié: (2026)

RV32I in ACL2
par: Kwan, Carl
Publié: (2025)

Forcing Axioms for Proper Posets Preserving a Topological Property: Consistency Results
par: Gilton, Thomas
Publié: (2025)

Optimal Syntactic Definitions of Back-and-Forth Types
par: Chen, Ruiyuan, et autres
Publié: (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
par: Baader, Franz, et autres
Publié: (2026)