We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Definability of Linear Orders over Negative Equivalences.
- Authors
Kasymov, N.; Morozov, A.
- Abstract
We study linear orders definable over negative and positive equivalences and their computable automorphisms. Special attention is paid to equivalences like η( α) = α∪id, α ⊆ ω. In particular, we describe orders that have negative presentations over such equivalences for co-enumerable sets α. Presentable and nonpresentable order types are exemplified for equivalences with various extra properties. We also give examples of negative orders with computable automorphisms whose inverses are not computable.
- Subjects
DEFINABILITY theory (Mathematical logic); LINEAR orderings; MATHEMATICAL equivalence; AUTOMORPHISMS; GENERALIZED inverses of linear operators
- Publication
Algebra & Logic, 2016, Vol 55, Issue 1, p24
- ISSN
0002-5232
- Publication type
Article
- DOI
10.1007/s10469-016-9373-x