Affiliation:
1. Department of Mathematics, University of Wisconsin, Madison, WI, USA
2. Division of Mathematical Sciences, School of Physical and Mathematical Sciences, College of Science, Nanyang Technological University, Singapore
Abstract
In her 1990 thesis, Ahmad showed that there is a so-called “Ahmad pair”, i.e., there are incomparable Σ 2 0 -enumeration degrees a 0 and a 1 such that every enumeration degree x < a 0 is ⩽ a 1 . At the same time, she also showed that there is no “symmetric Ahmad pair”, i.e., there are no incomparable Σ 2 0 -enumeration degrees a 0 and a 1 such that every enumeration degree x 0 < a 0 is ⩽ a 1 and such that every enumeration degree x 1 < a 1 is ⩽ a 0 . In this paper, we first present a direct proof of Ahmad’s second result. We then show that her first result cannot be extended to an “Ahmad triple”, i.e., there are no Σ 2 0 -enumeration degrees a 0 , a 1 and a 2 such that both ( a 0 , a 1 ) and ( a 1 , a 2 ) are an Ahmad pair. On the other hand, there is a “weak Ahmad triple”, i.e., there are pairwise incomparable Σ 2 0 -enumeration degrees a 0 , a 1 and a 2 such that every enumeration degree x < a 0 is also ⩽ a 1 or ⩽ a 2 ; however neither ( a 0 , a 1 ) nor ( a 0 , a 2 ) is an Ahmad pair.
Subject
Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science
Reference13 articles.
1. Some special pairs of Σ 2 e-degrees;Ahmad;MLQ Math. Log. Q.,1998
2. Partial degrees and the density problem. II. The enumeration degrees of the Σ 2 sets are dense;Cooper;J. Symbolic Logic,1984
3. Interpreting true arithmetic in the local structure of the enumeration degrees;Ganchev;J. Symbolic Logic,2012
4. The Π 3 -theory of the Σ 2 0 -enumeration degrees is undecidable;Kent;J. Symbolic Logic,2006
5. S. Lempp, M. Lerman and R. Solomon, Embedding finite lattices into the computably enumerable degrees – A status survey, in: Logic Colloquium ’02, Lect. Notes Log., Vol. 27, Assoc. Symbol. Logic, La Jolla, CA, 2006, pp. 206–229.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. ON CUPPING AND AHMAD PAIRS;The Journal of Symbolic Logic;2022-12-11