On the existence of a strong minimal pair
Logic
2016-10-13 v1
Abstract
We show that there is a strong minimal pair in the computably enumerable Turing degrees.
Keywords
Cite
@article{arxiv.1610.03591,
title = {On the existence of a strong minimal pair},
author = {George Barmpalias and Mingzhong Cai and Steffen Lempp and Theodore A. Slaman},
journal= {arXiv preprint arXiv:1610.03591},
year = {2016}
}
Related papers
View all related →
Logic · Mathematics
On the Nonexistence of a Strong Minimal Pair
Mingzhong Cai, Yiqun Liu, Yong Liu, Cheng Peng +1
2022-11-22
Logic · Mathematics
A minimal pair in the generic degrees
Denis R. Hirschfeldt
2020-04-22
Algebraic Geometry · Mathematics
On the existence of minimal models for log canonical pairs
Vladimir Lazić, Nikolaos Tsakanikas
2022-05-24
Logic · Mathematics
Realizing Computably Enumerable Degrees in Separating Classes
Peter Cholak, Rod Downey, Noam Greenberg, Daniel Turetsky
2020-08-25
Logic · Mathematics
On the structure of computable reducibility on equivalence relations of natural numbers
Uri Andrews, Daniel Belin, Luca San Mauro
2022-06-24
Logic · Mathematics
Isomorphism Spectra and Computably Composite Structures
Joey Lakerdas-Gayle
2026-01-19
Logic · Mathematics
Turing degrees of isomorphism types of geometric objects
Wesley Calvert, Valentina Harizanov, Alexandra Shlapentokh
2011-11-10
General Mathematics · Mathematics
There are Infinitely Many Pairs of Twin Prime
Zhanle Du, Shouyu Du
2007-05-23
Algebraic Geometry · Mathematics
A few remarks on effectivity and good minimal models
Vladimir Lazić
2026-03-26
Logic · Mathematics
Inherent enumerability of strong jump-traceability
David Diamondstone, Noam Greenberg, Daniel Turetsky
2011-10-10
Logic · Mathematics
Dependent Pairs
Ayhan Günaydin, Philipp Hieronymi
2011-05-03
Logic · Mathematics
Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies
Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Mars Yamaleev
2019-09-27
Combinatorics · Mathematics
A Ramsey theorem for pairs in trees
R. M. Causey, C. Doebele
2019-05-17
Logic · Mathematics
Degree spectra for transcendence in fields
Iskander Kalimullin, Russell Miller, Hans Schoutens
2019-08-20
General Mathematics · Mathematics
On sequences of natural numbers having pairwise relatively prime terms
Konstantinos N. Gaitanas
2015-01-14
Logic · Mathematics
Universal computably enumerable sets and initial segment prefix-free complexity
George Barmpalias
2013-11-28
Combinatorics · Mathematics
On an induced version of Menger's theorem
Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte
2025-10-29
Combinatorics · Mathematics
Minimum pair degree condition for tight Hamiltonian cycles in $4$-uniform hypergraphs
Joanna Polcyn, Christian Reiher, Vojtěch Rödl, Andrzej Ruciński +2
2020-12-18
Number Theory · Mathematics
The Belyi degree is computable
Ariyan Javanpeykar, John Voight
2018-05-17
Logic · Mathematics
The isometry degree of a computable copy of $\ell^p$
Timothy H. McNicholl, D. M. Stull
2019-04-30
Optimization and Control · Mathematics
Strong Duality Theorem for Continuous-Time Linear Programming Problems
Hsien-Chung Wu
2014-11-03
Logic · Mathematics
Computable embeddings for pairs of linear orders
Nikolay Bazhenov, Hristo Ganchev, Stefan Vatev
2023-11-09
Logic · Mathematics
Asymptotic Density and Computably Enumerable Sets
Rodney G. Downey, Carl G. Jockusch, Paul E. Schupp
2013-07-02
Logic · Mathematics
A computably enumerable many-one degree with no least finite-one degree
Patrizio Cintioli
2026-04-14
Combinatorics · Mathematics
A short proof of the existence of a minor-universal countable planar graph
George Kontogeorgiou
2023-09-14