Loading...
Please wait, while we are loading the content...
Similar Documents
ON THE TRIPLE JUMP OF THE SET OF ATOMS OF A BOOLEAN ALGEBRA
| Content Provider | Semantic Scholar |
|---|---|
| Author | Montalbán, Antonio |
| Copyright Year | 2007 |
| Abstract | We prove the following result about the degree spectrum of the atom relation on a computable Boolean algebra. Let C be a computable Boolean algebra with infinitely many atoms and a be the Turing degree of the atom relation of C. If d is a c.e. degree such that a′′′ ≤T d′′′, then there is a computable copy of C where the atom relation has degree d. In particular, for every high3 c.e. degree d, any computable Boolean algebra with infinitely many atoms has a computable copy where the atom relation has degree d. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://math.berkeley.edu/~antonio/papers/atomrelation.pdf |
| Alternate Webpage(s) | http://www.math.uchicago.edu/~antonio/papers/atomrelation.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Boolean algebra Computable function Mandibular right second molar tooth Turing degree |
| Content Type | Text |
| Resource Type | Article |
