Cover Image

Conjunctive reducibilities and completeness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chitaia, Irakli, Ng, Keng Meng, Omanadze, Roland, Sorbi, Andrea
Format:	Preprint
Published:	2026
Subjects:	Logic 03D25, 03D30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

A note on the degree structure of primitive recursive m-reducibility
by: Kalmurzayev, Birzhan, et al.
Published: (2023)

Robinson Splitting Theorem and $Σ_1$ Induction
by: Liu, Yong, et al.
Published: (2026)

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

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

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

More conservativity for weak Kőnig's lemma
by: Freund, Anton, et al.
Published: (2024)

Solovay reducibility implies S2a-reducibility
by: Titov, Ivan
Published: (2024)

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

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

Introenumerability, autoreducibility, and randomness
by: Li, Ang
Published: (2024)

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

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

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

Normal forms and representable functions in Moisil logic
by: Sipos, Andrei
Published: (2023)

Subresiduated Nelson Algebras
by: Lubomirsky, Noemí, et al.
Published: (2024)

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

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

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

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

Variants of Solovay reducibility
by: Titov, Ivan
Published: (2024)

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)

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

Low$_2$ computably enumerable sets have hyperhypersimple supersets
by: Cholak, Peter, et al.
Published: (2024)

Computable categoricity relative to a c.e. degree
by: Villano, Java Darleen
Published: (2024)

Contrasting the Halves of an Ahmad Pair
by: Ravishankar, Karthik
Published: (2025)

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

On Sets That Encode Themselves
by: Em, Taeyoung
Published: (2026)

Kolmogorov Complexity of Attractive Degrees
by: Royer, Tiago
Published: (2025)

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

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

Extensions of categoricity relative to a degree
by: Villano, Java Darleen
Published: (2025)

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

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