Image de couverture de livre

Generalized Effective Reducibility

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Carl, Merlin
Format:	Preprint
Publié:	2016
Sujets:	Logic
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

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)

Optimal Results on ITRM-recognizability
par: Carl, Merlin
Publié: (2013)

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

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)

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)

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)

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

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

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)

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

Effective Disjunction and Effective Interpolation in Suffciently Strong Proof Systems
par: Maxa, Martin
Publié: (2026)

Effective Versions of Strong Measure Zero
par: Rayman, Matthew
Publié: (2025)

Preservation under Reduced Products in Continuous Logic
par: Fronteau, Ivory
Publié: (2024)

Effectiveness and strong graph indivisibility
par: Dzhafarov, Damir D., et autres
Publié: (2024)

On Effective Banach-Mazur Games and an application to the Poincaré Recurrence Theorem for Category
par: Koul, Prajval, et autres
Publié: (2025)

On the Effectiveness of Partition Regularity over Algebraic Structures
par: Laboska, Gabriela
Publié: (2025)

Effective weak convergence and tightness of measures in computable Polish spaces
par: Rojas, Diego A.
Publié: (2024)

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

Generalized Decidability via Brouwer Trees
par: de Jong, Tom, et autres
Publié: (2026)

A General (Uniform) Relational Semantics for Sentential Logics
par: Hartonas, Chrysafis
Publié: (2025)

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