COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY. (13th March 2015)
- Record Type:
- Journal Article
- Title:
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY. (13th March 2015)
- Main Title:
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY
- Authors:
- GREENBERG, NOAM
KACH, ASHER M.
LEMPP, STEFFEN
TURETSKY, DANIEL D. - Abstract:
- Abstract: We study the computable structure theory of linear orders of size $\aleph _1 $ within the framework of admissible computability theory. In particular, we characterize which of these linear orders are computably categorical.
- Is Part Of:
- Journal of symbolic logic. Volume 80:Number 1(2015)
- Journal:
- Journal of symbolic logic
- Issue:
- Volume 80:Number 1(2015)
- Issue Display:
- Volume 80, Issue 1 (2015)
- Year:
- 2015
- Volume:
- 80
- Issue:
- 1
- Issue Sort Value:
- 2015-0080-0001-0000
- Page Start:
- 116
- Page End:
- 144
- Publication Date:
- 2015-03-13
- Subjects:
- Primary: 03D60, -- secondary: 03C57
uncountable linear orders, -- computability, -- computable categoricity
Logic, Symbolic and mathematical -- Periodicals
511.3 - Journal URLs:
- http://www.aslonline.org/journals-journal.html ↗
http://www.jstor.org/journals/00224812.html ↗ - DOI:
- 10.1017/jsl.2014.68 ↗
- Languages:
- English
- ISSNs:
- 0022-4812
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD Digital store
- Ingest File:
- 22186.xml