:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Carl, Merlin
Formato:	Preprint
Publicado:	2016
Materias:	Logic
Acceso en línea:	https://arxiv.org/abs/1601.01899
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Effectivity and Reducibility with Ordinal Turing Machines
por: Carl, Merlin
Publicado: (2018)

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

The Lost Melody Phenomenon
por: Carl, Merlin
Publicado: (2014)

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

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

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

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

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

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

Recognizable Realizability
por: Carl, Merlin
Publicado: (2024)

Algorithmic Randomness for Infinite Time Register Machines
por: Carl, Merlin
Publicado: (2014)

Taming Koepke's Zoo II: Register Machines
por: Carl, Merlin
Publicado: (2019)

Reduction Complexities in Set Theory
por: Carl, Merlin
Publicado: (2025)

Optimal Results on ITRM-recognizability
por: Carl, Merlin
Publicado: (2013)

A Note on Clockability for Ordinal Turing Machines
por: Carl, Merlin
Publicado: (2019)

The distribution of ITRM-recognizable reals
por: Carl, Merlin
Publicado: (2012)

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

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

A Note on Power-OTMs
por: Carl, Merlin
Publicado: (2024)

Some Observations on Infinitary Complexity
por: Carl, Merlin
Publicado: (2018)

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

Space and Time Complexity for Infinite Time Turing Machines
por: Carl, Merlin
Publicado: (2019)

Almost sure OTM-realizability
por: Carl, Merlin
Publicado: (2024)

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

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

Canonical Truth
por: Carl, Merlin, et al.
Publicado: (2017)

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

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

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

Effective Versions of Strong Measure Zero
por: Rayman, Matthew
Publicado: (2025)

Effective Disjunction and Effective Interpolation in Suffciently Strong Proof Systems
por: Maxa, Martin
Publicado: (2026)

Preservation under Reduced Products in Continuous Logic
por: Fronteau, Ivory
Publicado: (2024)

On Effective Banach-Mazur Games and an application to the Poincaré Recurrence Theorem for Category
por: Koul, Prajval, et al.
Publicado: (2025)

Effectiveness and strong graph indivisibility
por: Dzhafarov, Damir D., et al.
Publicado: (2024)

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

RV32I in ACL2
por: Kwan, Carl
Publicado: (2025)

On the Effectiveness of Partition Regularity over Algebraic Structures
por: Laboska, Gabriela
Publicado: (2025)

Generalized Decidability via Brouwer Trees
por: de Jong, Tom, et al.
Publicado: (2026)

A General (Uniform) Relational Semantics for Sentential Logics
por: Hartonas, Chrysafis
Publicado: (2025)

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