Image de couverture de livre

Structures Associated with Real Closed Fields and the Axiom of Choice

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Carl, Merlin
Format:	Preprint
Publié:	2014
Sujets:	Logic
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

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

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

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

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)

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

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)

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

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

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

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

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)

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

The Logic of Cardinality Comparison Without the Axiom of Choice
par: Harrison-Trainor, Matthew, et autres
Publié: (2022)

Multi-level Nonstandard Analysis and the Axiom of Choice
par: Hrbacek, Karel
Publié: (2024)

Separable C*-algebras Without the Countable Axiom of Choice
par: Blackadar, Bruce, et autres
Publié: (2026)

The uncountability of the reals and the Axiom of Choice
par: Normann, Dag, et autres
Publié: (2026)

A Gentle Introduction to the Axiom of Choice
par: Blass, Andreas, et autres
Publié: (2025)

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)

The Axiom of Choice in the $κ$-Mantle
par: Lietz, Andreas
Publié: (2024)

Speedups for Presburger Arithmetic and Real Closed Fields
par: Pakhomov, Fedor, et autres
Publié: (2026)

On the Axioms of Arboreal Categories
par: Jakl, Tomáš, et autres
Publié: (2026)

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

On forcing axioms and weakenings of the Axiom of Choice
par: Bomfim, Diego Lima, et autres
Publié: (2024)

The Largest Suslin Axiom
par: Sargsyan, Grigor, et autres
Publié: (2021)

The Open Coloring Axiom
par: Matos-Wiederhold, Tonatiuh
Publié: (2022)

The Axiom of Real Determinacy and the Axiom of Real Blackwell Determinacy
par: Ikegami, Daisuke, et autres
Publié: (2025)

The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
par: Kátay, Tamás, et autres
Publié: (2023)