Cover Image

Reduction Complexities in Set Theory

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Carl, Merlin
Format:	Preprint
Published:	2025
Subjects:	Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Some Observations on Infinitary Complexity
by: Carl, Merlin
Published: (2018)

Space and Time Complexity for Infinite Time Turing Machines
by: Carl, Merlin
Published: (2019)

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

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

The Lost Melody Phenomenon
by: Carl, Merlin
Published: (2014)

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

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

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

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

Recognizable Realizability
by: Carl, Merlin
Published: (2024)

Algorithmic Randomness for Infinite Time Register Machines
by: Carl, Merlin
Published: (2014)

Taming Koepke's Zoo II: Register Machines
by: Carl, Merlin
Published: (2019)

Optimal Results on ITRM-recognizability
by: Carl, Merlin
Published: (2013)

A Note on Clockability for Ordinal Turing Machines
by: Carl, Merlin
Published: (2019)

The distribution of ITRM-recognizable reals
by: Carl, Merlin
Published: (2012)

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

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

A Note on Power-OTMs
by: Carl, Merlin
Published: (2024)

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

Generalized Effective Reducibility
by: Carl, Merlin
Published: (2016)

Effectivity and Reducibility with Ordinal Turing Machines
by: Carl, Merlin
Published: (2018)

Almost sure OTM-realizability
by: Carl, Merlin
Published: (2024)

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

Canonical Truth
by: Carl, Merlin, et al.
Published: (2017)

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

The Complexity of the Set of Validities of a Theory
by: Hirschfeldt, Denis R., et al.
Published: (2025)

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

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

Characterizing Sets of Theories That Can Be Disjointly Combined
by: Przybocki, Benjamin, et al.
Published: (2025)

The Category of Iterative Sets in Homotopy Type Theory and Univalent Foundations
by: Gratzer, Daniel, et al.
Published: (2024)

Gödel's Program in Set Theory
by: Müller, Sandra, et al.
Published: (2024)

Classical Set Theory: Theory of Sets and Classes
by: Banakh, Taras
Published: (2020)

Interpretation of Inaccessible Sets in Martin-Löf Type Theory with One Mahlo Universe
by: Takahashi, Yuta
Published: (2024)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

Borel Reductions and Cub Games in Generalized Descriptive Set Theory
by: Kulikov, Vadim
Published: (2012)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)

On the Complexity of Proving Polyhedral Reductions
by: Amat, Nicolas, et al.
Published: (2023)

Sets and Classes: Operational Theory
by: Warner, Garth
Published: (2024)

Elementarity of Subgroups and Complexity of Theories for Profinite Groups
by: Block, Jason
Published: (2024)