New definitions in the theory of Type 1 computable topological spaces
Fuente:
arXiv
Saved in:
| Main Author: | Rauzy, Emmanuel |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A generalization of Markov's approach to the continuity problem for Type 1 computable functions
by: Rauzy, Emmanuel
Published: (2023)
by: Rauzy, Emmanuel
Published: (2023)
Computable Bases
by: Brattka, Vasco, et al.
Published: (2025)
by: Brattka, Vasco, et al.
Published: (2025)
A non-computable c.e. closed subset of $[0,1]$
by: Badaev, Serikzhan, et al.
Published: (2025)
by: Badaev, Serikzhan, et al.
Published: (2025)
Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
Published: (2025)
by: Brattka, Vasco, et al.
Published: (2025)
Computability for tree presentations of continuum-size structures
by: Block, Jason, et al.
Published: (2025)
by: Block, Jason, et al.
Published: (2025)
The computational content of multidimensional discontinuity
by: Hölzl, Rupert, et al.
Published: (2024)
by: Hölzl, Rupert, et al.
Published: (2024)
Computable Gelfand Duality
by: Burton, Peter, et al.
Published: (2024)
by: Burton, Peter, et al.
Published: (2024)
A jump operator on the Weihrauch degrees
by: Andrews, Uri, et al.
Published: (2024)
by: Andrews, Uri, et al.
Published: (2024)
Effective weak convergence and tightness of measures in computable Polish spaces
by: Rojas, Diego A.
Published: (2024)
by: Rojas, Diego A.
Published: (2024)
Computable topological groups
by: Koh, Heer Tern, et al.
Published: (2022)
by: Koh, Heer Tern, et al.
Published: (2022)
Computable analysis on the space of marked groups
by: Rauzy, Emmanuel
Published: (2021)
by: Rauzy, Emmanuel
Published: (2021)
Minimal covers in the Weihrauch degrees
by: Lempp, Steffen, et al.
Published: (2023)
by: Lempp, Steffen, et al.
Published: (2023)
Benign approximations and non-speedability
by: Hölzl, Rupert, et al.
Published: (2023)
by: Hölzl, Rupert, et al.
Published: (2023)
Randomness versus superspeedability
by: Hölzl, Rupert, et al.
Published: (2024)
by: Hölzl, Rupert, et al.
Published: (2024)
Evaluative presentations
by: McNicholl, Timothy H.
Published: (2024)
by: McNicholl, Timothy H.
Published: (2024)
Chains and antichains in the Weihrauch lattice
by: Lempp, Steffen, et al.
Published: (2024)
by: Lempp, Steffen, et al.
Published: (2024)
Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)
by: Hertling, Peter, et al.
Published: (2023)
Computable $K$-theory for $\mathrm{C}^*$-algebras: UHF algebras
by: Eagle, Christopher, et al.
Published: (2025)
by: Eagle, Christopher, et al.
Published: (2025)
Problems with fixpoints of polynomials of polynomials
by: Pradic, Cécilia, et al.
Published: (2026)
by: Pradic, Cécilia, et al.
Published: (2026)
Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
by: Hertling, Peter, et al.
Published: (2025)
by: Hertling, Peter, et al.
Published: (2025)
Strong reducibilities and set theory
by: Schweber, Noah
Published: (2024)
by: Schweber, Noah
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)
by: Cipriani, Vittorio, et al.
Published: (2022)
On the computability of cofinal Fraïssé limits
by: Ackerman, Nathanael, et al.
Published: (2026)
by: Ackerman, Nathanael, et al.
Published: (2026)
Isomorphism Spectra and Computably Composite Structures
by: Lakerdas-Gayle, Joey
Published: (2025)
by: Lakerdas-Gayle, Joey
Published: (2025)
A Counterexample Regarding C.E. Closed Subsets of [0,1] Under Homeomorphisms
by: Bosserhoff, Volker
Published: (2025)
by: Bosserhoff, Volker
Published: (2025)
The Galvin-Prikry Theorem in the Weihrauch lattice
by: Marcone, Alberto, et al.
Published: (2024)
by: Marcone, Alberto, et al.
Published: (2024)
An effective version of the Stone duality
by: Bazhenov, Nikolay A., et al.
Published: (2026)
by: Bazhenov, Nikolay A., et al.
Published: (2026)
Finding descending sequences through ill-founded linear orders
by: Goh, Jun Le, et al.
Published: (2020)
by: Goh, Jun Le, et al.
Published: (2020)
The weakness of finding descending sequences in ill-founded linear orders
by: Goh, Jun Le, et al.
Published: (2024)
by: Goh, Jun Le, et al.
Published: (2024)
Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)
by: Rydval, Jakub
Published: (2021)
Online and feasible presentability: from trees to modal algebras
by: Bazhenov, Nikolay, et al.
Published: (2025)
by: Bazhenov, Nikolay, et al.
Published: (2025)
Automatic structures and the problem of natural well-orderings
by: Beklemishev, Lev D., et al.
Published: (2024)
by: Beklemishev, Lev D., et al.
Published: (2024)
Sequential discontinuity and first-order problems
by: Pauly, Arno, et al.
Published: (2024)
by: Pauly, Arno, et al.
Published: (2024)
Countable Ordered Groups and Weihrauch Reducibility
by: Li, Ang
Published: (2024)
by: Li, Ang
Published: (2024)
Computable Approximations of Semicomputable Graphs
by: Čačić, Vedran, et al.
Published: (2024)
by: Čačić, Vedran, et al.
Published: (2024)
Computably discrete represented spaces
by: Neumann, Eike, et al.
Published: (2025)
by: Neumann, Eike, et al.
Published: (2025)
Computability in infinite Galois theory and algorithmically random algebraic fields
by: Calvert, Wesley, et al.
Published: (2023)
by: Calvert, Wesley, et al.
Published: (2023)
Reordered Computable Numbers
by: Janicki, Philip
Published: (2023)
by: Janicki, Philip
Published: (2023)
Sheaves as oracle computations
by: Ahman, Danel, et al.
Published: (2026)
by: Ahman, Danel, et al.
Published: (2026)
Analysis of HOD for Admissible Structures
by: Kruschewski, Jan, et al.
Published: (2025)
by: Kruschewski, Jan, et al.
Published: (2025)
Similar Items
-
A generalization of Markov's approach to the continuity problem for Type 1 computable functions
by: Rauzy, Emmanuel
Published: (2023) -
Computable Bases
by: Brattka, Vasco, et al.
Published: (2025) -
A non-computable c.e. closed subset of $[0,1]$
by: Badaev, Serikzhan, et al.
Published: (2025) -
Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
Published: (2025) -
Computability for tree presentations of continuum-size structures
by: Block, Jason, et al.
Published: (2025)