Imagen de Portada

Almost sure OTM-realizability

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Carl, Merlin
Formato:	Preprint
Publicado:	2024
Materias:	Logic
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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)

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)

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)

Generalized Effective Reducibility
por: Carl, Merlin
Publicado: (2016)

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

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

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

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

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

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)

Many-one reducibility with realizability
por: Kihara, Takayuki
Publicado: (2024)

Degrees of incomputability, realizability and constructive reverse mathematics
por: Kihara, Takayuki
Publicado: (2020)

Almost cohomology of finite-dimensional Lie rings
por: Invitti, Moreno
Publicado: (2026)

Extensional realizability and choice for dependent types in intuitionistic set theory
por: Frittaion, Emanuele
Publicado: (2024)

Almost real closed fields with real analytic structure
por: Nguyen, Kien Huu, et al.
Publicado: (2024)

Modal logics of almost sure validities in some classes of euclidean and transitive frames
por: Sliusarev, Vladislav
Publicado: (2024)

A realization theorem for the modal logic of transitive closure $\mathsf{K}^+$
por: Shamkanov, Daniyar
Publicado: (2024)

Almost free algebras: from the word problem to elimination of quantifiers
por: Jia, Yifan, et al.
Publicado: (2026)

Ramsey Property and Pathological Sets: Almost Disjointness, Independence and Other Maximal Objects
por: He, Jialiang, et al.
Publicado: (2026)

Almost free modules, perfect decomposition and Enochs's conjecture
por: Cortés-Izurdiaga, Manuel, et al.
Publicado: (2024)

Positive Almost-Sure Termination of Polynomial Random Walks
por: Winkler, Lorenz, et al.
Publicado: (2025)

Compositional Verification of Almost-Sure Büchi Objectives in MDPs
por: van der Vegt, Marck, et al.
Publicado: (2025)