Imagen de Portada

A note on the degree structure of primitive recursive m-reducibility

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kalmurzayev, Birzhan, Bazhenov, Nikolay, Iskakov, Alibek
Formato:	Preprint
Publicado:	2023
Materias:	Logic 03D30, 03D20
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

\texorpdfstring{$D$}{D}-maximal many-one degrees contain least finite-one degrees
por: Cintioli, Patrizio
Publicado: (2026)

Conjunctive reducibilities and completeness
por: Chitaia, Irakli, et al.
Publicado: (2026)

On the Hausdorff dimension of maximal chains and antichains of Turing and Hyperarithmetic degrees
por: Song, Sirun, et al.
Publicado: (2025)

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

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

Intuitionism and computing with partial information
por: Ganchev, Hristo, et al.
Publicado: (2026)

A Computably Enumerable $tt$-Degree Without Computably Enumerable Irreducible $m$-Degrees
por: Cintioli, Patrizio
Publicado: (2026)

$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees
por: Cintioli, Patrizio
Publicado: (2026)

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

Open Problems in Computability Theory and Descriptive Set Theory
por: Barmpalias, George, et al.
Publicado: (2025)

Online and feasible presentability: from trees to modal algebras
por: Bazhenov, Nikolay, et al.
Publicado: (2025)

A $wtt$-introimmune set in \texorpdfstring{$Π^0_1$}{Pi01} and introimmunity for several reducibilities
por: Cintioli, Patrizio
Publicado: (2026)

Solovay reducibility implies S2a-reducibility
por: Titov, Ivan
Publicado: (2024)

Martin's Conjecture in the Enumeration Degrees
por: Cordero, Antonio Nakid
Publicado: (2025)

Introenumerability, autoreducibility, and randomness
por: Li, Ang
Publicado: (2024)

Analogues of the countable Borel equivalence relations in the setting of computable reducibility
por: Andrews, Uri, et al.
Publicado: (2024)

Regainingly approximable numbers and sets
por: Hertling, Peter, et al.
Publicado: (2023)

A total Solovay reducibility and totalizing of the notion of speedability
por: Merkle, Wolfgang, et al.
Publicado: (2024)

Isolated d.c.e. degrees and $Σ_1$ induction
por: Liu, Yiqun, et al.
Publicado: (2025)

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

There is No Composition in the Computable Reducibility Degrees
por: Mourad, Daniel
Publicado: (2024)

The computational content of multidimensional discontinuity
por: Hölzl, Rupert, et al.
Publicado: (2024)

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

Variants of Solovay reducibility
por: Titov, Ivan
Publicado: (2024)

A closed subset of Baire space not Medvedev equivalent to any closed set of Cantor space
por: Cole, Joshua
Publicado: (2024)

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

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

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

Contrasting the Halves of an Ahmad Pair
por: Ravishankar, Karthik
Publicado: (2025)

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

On Sets That Encode Themselves
por: Em, Taeyoung
Publicado: (2026)

Kolmogorov Complexity of Attractive Degrees
por: Royer, Tiago
Publicado: (2025)

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

Bounded Ramsey's theorem for triples in computability theory
por: Patey, Ludovic, et al.
Publicado: (2026)

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

Fundamental sequences based on localization
por: Wilken, Gunnar
Publicado: (2024)

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