Image de couverture de livre

Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Carl, Merlin
Format:	Preprint
Publié:	2024
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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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)

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

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)

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

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)

Constructive Ordinal Exponentiation
par: de Jong, Tom, et autres
Publié: (2025)

The subTuring degrees
par: Kihara, Takayuki, et autres
Publié: (2024)

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

Incompleteness theorems via Turing category
par: Savelyev, Yasha
Publié: (2024)

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

Polymorphic Ordinal Notations
par: Towsner, Henry
Publié: (2025)

Did Turing prove the undecidability of the halting problem?
par: Hamkins, Joel David, et autres
Publié: (2024)

Turing Degrees of Hyperjumps
par: Jananthan, Hayden R., et autres
Publié: (2021)

Fagin's Theorem for Semiring Turing Machines
par: Badia, Guillermo, et autres
Publié: (2025)

Stochastic Process Turing Machines
par: Wolpert, David, et autres
Publié: (2024)

Ordinal measures of the set of finite multisets
par: Vialard, Isa
Publié: (2023)

Reducing Arbitrary Metric Temporal Formulas into Logic Programs under Answer Set Semantics
par: Diéguez, Martín, et autres
Publié: (2026)

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

A Dichotomy Theorem for Ordinal Ranks in MSO
par: Niwiński, Damian, et autres
Publié: (2025)