Left-orderable computable groups

Journal of Symbolic Logic 83 (1):237-255 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/jsl.2017.19

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Π10 classes and orderable groups.Reed Solomon - 2002 - Annals of Pure and Applied Logic 115 (1-3):279-302.
Spaces of orders and their Turing degree spectra.Malgorzata A. Dabkowska, Mieczyslaw K. Dabkowski, Valentina S. Harizanov & Amir A. Togha - 2010 - Annals of Pure and Applied Logic 161 (9):1134-1143.
New Degree Spectra of Abelian Groups.Alexander G. Melnikov - 2017 - Notre Dame Journal of Formal Logic 58 (4):507-525.
Recursive Approximability of Real Numbers.Xizhong Zheng - 2002 - Mathematical Logic Quarterly 48 (S1):131-156.
The complexity of central series in nilpotent computable groups.Barbara F. Csima & Reed Solomon - 2011 - Annals of Pure and Applied Logic 162 (8):667-678.
Classifications of Computable Structures.Karen Lange, Russell Miller & Rebecca M. Steiner - 2018 - Notre Dame Journal of Formal Logic 59 (1):35-59.
The Arithmetical Hierarchy of Real Numbers.Xizhong Zheng & Klaus Weihrauch - 2001 - Mathematical Logic Quarterly 47 (1):51-66.
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
A Banach–Mazur computable but not Markov computable function on the computable real numbers.Peter Hertling - 2005 - Annals of Pure and Applied Logic 132 (2-3):227-246.
Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
When series of computable functions with varying domains are computable.Iraj Kalantari & Larry Welch - 2013 - Mathematical Logic Quarterly 59 (6):471-493.
Non-well-foundedness of well-orderable power sets.T. E. Forster & J. K. Truss - 2003 - Journal of Symbolic Logic 68 (3):879-884.
H‐monotonically computable real numbers.Xizhong Zheng, Robert Rettinger & George Barmpalias - 2005 - Mathematical Logic Quarterly 51 (2):157-170.
Effective categoricity of Abelian p -groups.Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov & Andrei Morozov - 2009 - Annals of Pure and Applied Logic 159 (1-2):187-197.

Analytics

Added to PP
2018-02-08

Downloads
4 (#1,590,841)

6 months
2 (#1,263,261)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Recursion theory and ordered groups.R. G. Downey & Stuart A. Kurtz - 1986 - Annals of Pure and Applied Logic 32:137-151.
Π10 classes and orderable groups.Reed Solomon - 2002 - Annals of Pure and Applied Logic 115 (1-3):279-302.

Add more references