Cover Image

The computational content of multidimensional discontinuity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hölzl, Rupert, Ng, Keng Meng
Format:	Preprint
Published:	2024
Subjects:	Logic 03D78, 03D30, 03F60
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Benign approximations and non-speedability
by: Hölzl, Rupert, et al.
Published: (2023)

Randomness versus superspeedability
by: Hölzl, Rupert, et al.
Published: (2024)

Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)

Problems with fixpoints of polynomials of polynomials
by: Pradic, Cécilia, et al.
Published: (2026)

A jump operator on the Weihrauch degrees
by: Andrews, Uri, et al.
Published: (2024)

Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
Published: (2025)

Computable Approximations of Semicomputable Graphs
by: Čačić, Vedran, et al.
Published: (2024)

Countable Ordered Groups and Weihrauch Reducibility
by: Li, Ang
Published: (2024)

Minimal covers in the Weihrauch degrees
by: Lempp, Steffen, et al.
Published: (2023)

The singleton degrees of the $Σ^0_2$ sets are not dense
by: Kent, Thomas F., et al.
Published: (2024)

Chains and antichains in the Weihrauch lattice
by: Lempp, Steffen, et al.
Published: (2024)

Conjunctive reducibilities and completeness
by: Chitaia, Irakli, et al.
Published: (2026)

Induction on Dilators and Bachmann-Howard Fixed Points
by: Aguilera, Juan P., et al.
Published: (2024)

Computable topological groups
by: Koh, Heer Tern, et al.
Published: (2022)

The Galvin-Prikry Theorem in the Weihrauch lattice
by: Marcone, Alberto, et al.
Published: (2024)

The Weihrauch lattice at the level of $\boldsymbolΠ_1^1\mathsf{-CA}_0$: the Cantor-Bendixson theorem
by: Cipriani, Vittorio, et al.
Published: (2022)

New definitions in the theory of Type 1 computable topological spaces
by: Rauzy, Emmanuel
Published: (2023)

Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)

A generalization of Markov's approach to the continuity problem for Type 1 computable functions
by: Rauzy, Emmanuel
Published: (2023)

Sequential discontinuity and first-order problems
by: Pauly, Arno, et al.
Published: (2024)

Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
by: Hertling, Peter, et al.
Published: (2025)

Algorithmic Randomness, Effective Disintegrations, and Rates of Convergence to the Truth
by: Huttegger, Simon M., et al.
Published: (2024)

Axiom Beta Implies Elementary Transfinite Recursion
by: Frittaion, Emanuele, et al.
Published: (2026)

Fundamental sequences based on localization
by: Wilken, Gunnar
Published: (2024)

Generalizing Goodstein's theorem and Cichon's independence proof
by: Wilken, Gunnar
Published: (2025)

A $Π^0_2$ Singleton of Minimal Arithmetic Degree
by: Gerdes, Peter
Published: (2023)

Computability of the Hahn-Banach Theorem Revisited
by: Brattka, Vasco, et al.
Published: (2026)

The tree pigeonhole principle in the Weihrauch degrees
by: Dzhafarov, Damir, et al.
Published: (2023)

A non-computable c.e. closed subset of $[0,1]$
by: Badaev, Serikzhan, et al.
Published: (2025)

Effective inseparability and some applications in meta-mathematics
by: Cheng, Yong
Published: (2022)

On the relationships between some meta-mathematical properties of arithmetical theories
by: Cheng, Yong
Published: (2023)

The limitless First Incompleteness Theorem
by: Cheng, Yong
Published: (2021)

The Tree Pulldown Method: McLaughlin's Conjecture and Beyond
by: Harrington, Leo A., et al.
Published: (2025)

The weakness of finding descending sequences in ill-founded linear orders
by: Goh, Jun Le, et al.
Published: (2024)

Finding descending sequences through ill-founded linear orders
by: Goh, Jun Le, et al.
Published: (2020)

Proof-theoretic dilator and intermediate pointclasses
by: Jeon, Hanul
Published: (2025)

Computably discrete represented spaces
by: Neumann, Eike, et al.
Published: (2025)

An order-reversing embedding of Turing degrees into Arthur-Nimue-Merlin degrees
by: Samra, Jean Abou, et al.
Published: (2026)

A computably enumerable many-one degree with no least finite-one degree
by: Cintioli, Patrizio
Published: (2026)

Bi-Isolated d.c.e. Degrees and $Σ_1$ Induction
by: Liu, Yong, et al.
Published: (2025)