arXiv Analytics

Sign in

arXiv:1901.09903 [math.LO]AbstractReferencesReviewsResources

Ranks for families of all theories of given languages

Nurlan Markhabatov, Sergey Sudoplatov

Published 2019-01-28Version 1

For families of all theories of arbitrary given languages we describe ranks and degrees. In particular, we characterize (non-)totally transcendental families. We apply these characterizations for the families of all theories of given languages, with models of given finite or infinite cardinality.

Comments: arXiv admin note: text overlap with arXiv:1901.08464
Categories: math.LO
Related articles: Most relevant | Search more
arXiv:1809.07191 [math.LO] (Published 2018-09-19)
Characterizations of Cancellable Groups
arXiv:2212.02169 [math.LO] (Published 2022-12-05)
The Uncountable Hadwiger Conjecture and Characterizations of Trees Using Graphs
arXiv:1311.0363 [math.LO] (Published 2013-11-02, updated 2014-01-21)
About the range property for H

Links

Toolbox