Image de couverture de livre

Recognizable Realizability

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

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

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

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

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

Congruence Preservation, Lattices and Recognizability
par: Cegielski, Patrick, et autres
Publié: (2024)

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

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

Almost sure OTM-realizability
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)

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)

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)

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

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)

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)

Realizing the totally unordered structure of ordinals
par: Fontanella, Laura, et autres
Publié: (2025)

The Arithmetical Hierarchy: A Realizability-Theoretic Perspective
par: Kihara, Takayuki
Publié: (2024)

Groupoidal Realizability for Intensional Type Theory
par: Speight, Sam
Publié: (2024)

Realizing the Maximal Analytic Display Fragment of Labeled Sequent Calculi for Tense Logics
par: Lyon, Tim S.
Publié: (2024)

Stateful Realizers for Nonstandard Analysis
par: Dinis, Bruno, et autres
Publié: (2022)

Syntactic Effectful Realizability in Higher-Order Logic
par: Cohen, Liron, et autres
Publié: (2025)

A Guide to Krivine Realizability for Set Theory
par: Matthews, Richard
Publié: (2023)

Realization of relational presheaves
par: Chamoun, Yorgo, et autres
Publié: (2025)

Completeness of Synthesis under Realizability Assumptions using Superposition
par: Hajdu, Márton, et autres
Publié: (2026)

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

ocLTL: LTL Realizability and Synthesis Modulo ω-Categorical Structures
par: Asor, Ohad
Publié: (2026)