Abstract
We generalize the analysis of Andrews, Schweber and Sorbi of the first-order theory of the partial order of degrees of c.e. equivalence relations to higher computability theory, specifically to the setting of a regular cardinal.
Original language | English |
---|---|
Pages (from-to) | 98-114 |
Number of pages | 17 |
Journal | Journal of Logic and Computation |
Volume | 32 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 1 2022 |
Keywords
- Ceers (c.e. equivalence relations)
- Degree structure
- First-order theory
- Uncountable computability
- Α -recursion
ASJC Scopus subject areas
- Theoretical Computer Science
- Software
- Arts and Humanities (miscellaneous)
- Hardware and Architecture
- Logic