The first-order theory of the computably enumerable equivalence relations in the uncountable setting

Uri Andrews, Steffen Lempp, Manat Mustafa, Noah D. Schweber

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)98-114
Number of pages17
JournalJournal of Logic and Computation
Volume32
Issue number1
DOIs
Publication statusPublished - 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

Fingerprint

Dive into the research topics of 'The first-order theory of the computably enumerable equivalence relations in the uncountable setting'. Together they form a unique fingerprint.

Cite this