The first-order theory of the computably enumerable equivalence relations in the uncountable setting. (22nd July 2021)
- Record Type:
- Journal Article
- Title:
- The first-order theory of the computably enumerable equivalence relations in the uncountable setting. (22nd July 2021)
- Main Title:
- The first-order theory of the computably enumerable equivalence relations in the uncountable setting
- Authors:
- Andrews, Uri
Lempp, Steffen
Mustafa, Manat
Schweber, Noah D - Abstract:
- 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.
- Is Part Of:
- Journal of logic and computation. Volume 32:Number 1(2022)
- Journal:
- Journal of logic and computation
- Issue:
- Volume 32:Number 1(2022)
- Issue Display:
- Volume 32, Issue 1 (2022)
- Year:
- 2022
- Volume:
- 32
- Issue:
- 1
- Issue Sort Value:
- 2022-0032-0001-0000
- Page Start:
- 98
- Page End:
- 114
- Publication Date:
- 2021-07-22
- Subjects:
- ceers (c.e. equivalence relations) -- first-order theory -- degree structure -- α -recursion -- uncountable computability
Logic programming -- Periodicals
Logic, Symbolic and mathematical -- Periodicals
Computational complexity -- Periodicals
005.115 - Journal URLs:
- http://logcom.oxfordjournals.org/ ↗
http://ukcatalogue.oup.com/ ↗ - DOI:
- 10.1093/logcom/exab045 ↗
- Languages:
- English
- ISSNs:
- 0955-792X
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 5010.552200
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 20524.xml